Reducing the Hitting and the Cover Times of Random Walks on Finite Graphs by Local Topological Information.
Satoshi IkedaIzumi KuboMasafumi YamashitaPublished in: VLSI (2003)
Keyphrases
- random walk
- topological information
- markov chain
- structural information
- spatial information
- d objects
- directed graph
- geometrical information
- community structure
- average degree
- link prediction
- markov random walk
- spectral methods
- transition probabilities
- hyper graph
- transition probability matrix
- graph laplacian
- stationary distribution
- flow graph
- web graph
- computer vision