Login / Signup
The cover time of a biased random walk on a random regular graph of odd degree.
Tony Johansson
Published in:
CoRR (2018)
Keyphrases
</>
random walk
directed graph
flow graph
link prediction
transition probabilities
markov chain
graph laplacian
random walker
markov random walk
search engine
web graph
spectral methods
average degree
spectral graph partitioning
transition probability matrix
graph structure
clustering method
pairwise