Modularity from fluctuations in random graphs and complex networks

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

doi:10.1103/PhysRevE.70.025101

Modularity from fluctuations in random graphs and complex networks

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

^*Corresponding author for this work

Chemical and Biological Engineering

Research output: Contribution to journal › Article › peer-review

507 Scopus citations

Abstract

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 language	English (US)
Article number	025101
Pages (from-to)	025101-1-025101-4
Journal	Physical Review E - Statistical, Nonlinear, and Soft Matter Physics
Volume	70
Issue number	2 2
DOIs	https://doi.org/10.1103/PhysRevE.70.025101
State	Published - Aug 2004

ASJC Scopus subject areas

Statistical and Nonlinear Physics
Statistics and Probability
Condensed Matter Physics

Access to Document

10.1103/PhysRevE.70.025101

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

Cite this

@article{2fd05718906f47b3888b67f80008e0a1,

title = "Modularity from fluctuations in random graphs and complex networks",

abstract = "The study of Erd{\"o}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.",

author = "Roger Guimer{\`a} and Marta Sales-Pardo and Amaral, {Lu{\'i}s A.Nunes}",

note = "Funding Information: We thank Alex Arenas, Andr{\'e} A. Moreira, Carla A. Ng, and Daniel B. Stouffer for numerous suggestions and discussions. R.G. and M.S. thank the Fulbright Program and the Spanish Ministry of Education, Culture & Sports. L.A.N.A. gratefully acknowledges the support of a Searle Leadership Fund Award and of a NIH/NIGMS K-25 award.",

year = "2004",

month = aug,

doi = "10.1103/PhysRevE.70.025101",

language = "English (US)",

volume = "70",

pages = "025101--1--025101--4",

journal = "Physical Review E",

issn = "2470-0045",

publisher = "American Physical Society",

number = "2 2",

}

TY - JOUR

T1 - Modularity from fluctuations in random graphs and complex networks

AU - Guimerà, Roger

AU - Sales-Pardo, Marta

AU - Amaral, Luís A.Nunes

N1 - Funding Information: We thank Alex Arenas, André A. Moreira, Carla A. Ng, and Daniel B. Stouffer for numerous suggestions and discussions. R.G. and M.S. thank the Fulbright Program and the Spanish Ministry of Education, Culture & Sports. L.A.N.A. gratefully acknowledges the support of a Searle Leadership Fund Award and of a NIH/NIGMS K-25 award.

PY - 2004/8

Y1 - 2004/8

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=36348947993&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=36348947993&partnerID=8YFLogxK

U2 - 10.1103/PhysRevE.70.025101

DO - 10.1103/PhysRevE.70.025101

M3 - Article

C2 - 15447530

AN - SCOPUS:36348947993

VL - 70

SP - 025101-1-025101-4

JO - Physical Review E

JF - Physical Review E

SN - 2470-0045

IS - 2 2

M1 - 025101

ER -

Modularity from fluctuations in random graphs and complex networks

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this