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.
|Physical Review E - Statistical, Nonlinear, and Soft Matter Physics
|Published - Aug 2004
ASJC Scopus subject areas
- Condensed Matter Physics
- Statistical and Nonlinear Physics
- Statistics and Probability