Better bounds for coalescing-branching random walks.

Michael Mitzenmacher Rajmohan Rajaraman Scott T. Roche

Published in: CoRR (2016)

Keyphrases

random walk
upper bound
branch and bound
lower bound
markov chain
directed graph
link prediction
search tree
transition probabilities
transition probability matrix
learning algorithm
flow graph
stationary distribution
graph laplacian
spectral methods
proximity measures
average degree
web graph