Random walks on graphs: new bounds on hitting, meeting, coalescing and returning.
Roberto I. OliveiraYuval PeresPublished in: CoRR (2018)
Keyphrases
- random walk
- directed graph
- markov chain
- hyper graph
- average degree
- spectral methods
- web graph
- link prediction
- lower bound
- markov random walk
- graph structure
- stationary distribution
- transition probabilities
- nodes of a graph
- graph matching
- graph clustering
- graph partitioning
- graph structures
- steady state
- probability distribution
- pairwise
- learning algorithm