![]() |
![]() |
University of Birmingham > Talks@bham > Data Science and Computational Statistics Seminar > Backtrackless walks on a graph
Backtrackless walks on a graphAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Hong Duong. The aim of this talk is to explore the use and applications of backtrackless walks on a graph. We will discuss how the backtrackless walks and the coefficients of the reciprocal of the Ihara zeta function, which are related to the frequencies of prime cycles in the graph, can be used to implement graph kernels. We will further present explicit methods for computing the eigensystem of the edge-based Laplacian of a graph. This reveals a connection between the eigenfunctions of the edge-based Laplacian and both the classical random walk and the backtrackless random walk on a graph. The definition of edge-based Laplacian allows us to define and implement more complex partial differential equations on graphs such as the second order wave equation. This talk is part of the Data Science and Computational Statistics Seminar series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsFilling in the blank – I will be ….... in 2050’ Facts and Snacks Algebra Reading Group on Sporadic GroupsOther talksDisorder relevance for non-convex random gradient Gibbs measures in d=2 Quantum simulations using ultra cold ytterbium TBC Modelling uncertainty in image analysis. Geometry of alternating projections in metric spaces with bounded curvature Ultrafast, all-optical, and highly efficient imaging of molecular chirality |