Tight Bounds for Coalescing-Branching Random Walks on Regular Graphs.
Petra BerenbrinkGeorge GiakkoupisPeter KlingPublished in: SODA (2018)
Keyphrases
- random walk
- tight bounds
- directed graph
- upper bound
- spectral methods
- average degree
- hyper graph
- markov chain
- web graph
- transition probabilities
- nodes of a graph
- link prediction
- transition probability matrix
- graph laplacian
- search tree
- graph clustering
- flow graph
- graph mining
- graph structure
- bipartite graph
- weighted graph
- stationary distribution
- search space
- lower bound
- markov random walk
- reinforcement learning