Complex networks renormalisation: flows and fixed points - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Physical Review Letters Année : 2008

Complex networks renormalisation: flows and fixed points

Résumé

Complex networks in nature, society and technology share a set of topological features, reflecting some common organisational principles. Recently, it has been claimed that some complex networks are self-similar under a convenient renormalisation procedure. Here we present a general method to systematically study renormalisation flows in graphs. We find that the behaviour of some variables under renormalisation, such as the maximum and the average number of connections of a node, is described by simple scaling laws, characterised by critical exponents. This result holds for any class of graphs, from random to scale-free networks, from lattices to hierarchical graphs. Therefore, renormalisation flows for graphs display features similar to those found in the well-known renormalisation of spin systems. Critical exponents and scaling functions can be used to classify graphs in universality classes, and to uncover similarities between graph topologies that are inaccessible to a standard analysis.
Fichier principal
Vignette du fichier
0803.3637.pdf (207.75 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00267300 , version 1 (07-09-2023)

Identifiants

Citer

Filippo Radicchi, José Javier Ramasco, Alain Barrat, Santo Fortunato. Complex networks renormalisation: flows and fixed points. Physical Review Letters, 2008, 101, pp.148701. ⟨hal-00267300⟩
66 Consultations
4 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More