Improved Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs.
Colin CooperTomasz RadzikNicolas RiveraPublished in: SPAA (2017)
Keyphrases
- random walk
- directed graph
- hyper graph
- web graph
- markov chain
- average degree
- spectral methods
- lower bound
- link prediction
- transition probability matrix
- stationary distribution
- graph mining
- multi db
- markov random walk
- branch and bound
- nodes of a graph
- graph model
- graph laplacian
- transition probabilities
- search tree
- optimal solution
- proximity measures
- graph structures
- search space