Mixing time bounds for graphlet random walks.

Matteo Agostini Marco Bressan Shahrzad Haddadan

Published in: Inf. Process. Lett. (2019)

Keyphrases

random walk
upper bound
markov chain
lower bound
transition probabilities
directed graph
spectral methods
transition probability matrix
link prediction
stationary distribution
information retrieval
search engine
shortest path
social network analysis
flow graph
markov random walk