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.
Topologically biased random walk and community finding in networks
Gabrielli A.;Guido Caldarelli
2010
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.File | Dimensione | Formato | |
---|---|---|---|
prod_57644-doc_24821.pdf
solo utenti autorizzati
Descrizione: Topologically biased random walk and community finding in networks
Tipologia:
Versione Editoriale (PDF)
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
258.74 kB
Formato
Adobe PDF
|
258.74 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.