Topologically biased random walk with application for community finding in networks
arXiv:1003.1883 · doi:10.1103/PhysRevE.82.066109
Abstract
We present a new 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 (PEM) to study the features of random walks {\em vs.} parameter values. Furthermore, we show an analysis of the spectral gap maximum associated to the value of the second eigenvalue of the transition matrix related to the relaxation rate to the stationary state. Applications of these studies allow {\em ad hoc} algorithms for the exploration of complex networks and their communities.
8 pages, 7 figures
References in corpus (6)
- Synchronization in complex networks
- Benchmark graphs for testing community detection algorithms
- Comparing community structure identification
- Preferential attachment in the growth of social networks: the case of Wikipedia
- Wikipedias: Collaborative web-based encyclopedias as complex networks
- Entropy Rate of Diffusion Processes on Complex Networks