New Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs.
Colin CooperTomasz RadzikNicolas RiveraPublished in: ACM Trans. Parallel Comput. (2019)
Keyphrases
- random walk
- directed graph
- hyper graph
- spectral methods
- average degree
- web graph
- lower bound
- link prediction
- markov chain
- markov random walk
- branch and bound
- transition probabilities
- nodes of a graph
- flow graph
- transition probability matrix
- bipartite graph
- graph structure
- proximity measures
- graph mining
- graph structures
- adjacency matrix
- pairwise
- search algorithm
- multi db
- search tree