Three-wise independent random walks can be slightly unbounded.

Shyam Narayanan

Published in: Random Struct. Algorithms (2022)

Keyphrases

random walk
markov chain
directed graph
stationary distribution
multi db
link prediction
transition probabilities
transition probability matrix
average degree
markov random walk
graph laplacian
spectral methods
proximity measures
flow graph