Modularity from fluctuations in random graphs and complex networks

Roger Guimerà*, Marta Sales-Pardo, Luís A.Nunes Amaral

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

553 Scopus citations


The study of Erdös Renyi (ER) random graphs, in which pair of nodes connected with probability p and complex network was discussed. The study show the high modularity function due to fluctuation in the establishment of links, which were magnified by the large number of ways in which a network could be partitioned into modules. The study suggests that due to fluctuation, stochastic models give rise to modular network. The results show that for the clustering coefficient and other quantities the modularity of complex networks must always be compared to the null case of a random graph.

Original languageEnglish (US)
Article number025101
Pages (from-to)025101-1-025101-4
JournalPhysical Review E - Statistical, Nonlinear, and Soft Matter Physics
Issue number2 2
StatePublished - Aug 2004

ASJC Scopus subject areas

  • Condensed Matter Physics
  • Statistical and Nonlinear Physics
  • Statistics and Probability


Dive into the research topics of 'Modularity from fluctuations in random graphs and complex networks'. Together they form a unique fingerprint.

Cite this