Random walks on graphs: new bounds on hitting, meeting, coalescing and returning.
Roberto I. OliveiraYuval PeresPublished in: ANALCO (2019)
Keyphrases
- random walk
- directed graph
- markov chain
- hyper graph
- average degree
- spectral methods
- web graph
- lower bound
- stationary distribution
- markov random walk
- transition probabilities
- nodes of a graph
- graph structure
- flow graph
- bipartite graph
- link prediction
- graph matching
- steady state
- dynamic programming
- transition probability matrix
- pairwise
- machine learning