PageRank Induced Topology for Real-World Networks

Bruno Gaume (1, 2) , Fabien Mathieu (3)

1 CLLE-ERSS - Cognition, Langues, Langage, Ergonomie
2 IRIT - Institut de recherche en informatique de Toulouse
3 LINCS - Laboratory of Information, Network and Communication Sciences

This article presents a stochastic method for studying the structure of large small worlds graphs. The principle of this method is to apply a PageRank-like importance algorithm, with a damping factor and an external importance source. By varying the source vector, one obtains a powerful graph visualization tool, which reveals the structural organization of small worlds graphs.

Mots clés: complex network; random walk

Domaines: Réseaux et télécommunications [cs.NI]; Réseaux sociaux et d'information [cs.SI]; Linguistique

Bruno Gaume, Fabien Mathieu. PageRank Induced Topology for Real-World Networks. 2016. ⟨hal-01322040⟩