Random Walks, Bisections and Gossiping in Circulant Graphs.

Bernard Mans Igor E. Shparlinski

Published in: Algorithmica (2014)

Keyphrases

random walk
directed graph
spectral methods
average degree
hyper graph
web graph
markov chain
link prediction
nodes of a graph
weighted graph
graph mining
markov random walk
graph partitioning
stationary distribution
graph laplacian
proximity measures
graph structure
transition probability matrix
undirected graph