Topologically biased random walk and community finding in networks

Abstract

We present an approach of topology biased random walks for undirected networks. We focus on a one-parameter family of biases, and by using a formal analogy with perturbation theory in quantum mechanics we investigate the features of biased random walks. This analogy is extended through the use of parametric equations of motion to study the features of random walks vs parameter values. Furthermore, we show an analysis of the spectral gap maximum associated with the value of the second eigenvalue of the transition matrix related to the relaxation rate to the stationary state. Applications of these studies allow ad hoc algorithms for the exploration of complex networks and their communities.