Login / Signup
The cover time of a biased random walk on a random cubic graph.
Colin Cooper
Alan M. Frieze
Tony Johansson
Published in:
CoRR (2018)
Keyphrases
</>
random walk
directed graph
flow graph
markov chain
link prediction
graph laplacian
multi db
transition probabilities
transition probability matrix
nodes of a graph
spectral methods
average degree
optimal solution
markov random walk
shape analysis
random walker