Subgraphs in random networks.

Understanding the subgraph distribution in random networks is important for modeling complex systems. In classic Erdos networks, which exhibit a Poissonian degree distribution, the number of appearances of a subgraph G with n nodes and g edges scales with network size as approximately N(n-g). However, many natural networks have a non-Poissonian degree distribution. Here we present approximate equations for the average number of subgraphs in an ensemble of random sparse directed networks, characterized by an arbitrary degree sequence. We find scaling rules for the commonly occurring case of directed scale-free networks, in which the outgoing degree distribution scales as P(k) approximately k(-gamma). Considering the power exponent of the degree distribution, gamma, as a control parameter, we show that random networks exhibit transitions between three regimes. In each regime, the subgraph number of appearances follows a different scaling law, approximately Nalpha, where alpha=n-g+s-1 for gamma<2, alpha=n-g+s+1-gamma for 2gamma(c), where s is the maximal outdegree in the subgraph, and gamma(c)=s+1. We find that certain subgraphs appear much more frequently than in Erdos networks. These results are in very good agreement with numerical simulations. This has implications for detecting network motifs, subgraphs that occur in natural networks significantly more than in their randomized counterparts.

[1]  P. Erdos,et al.  On the strength of connectedness of a random graph , 1964 .

[2]  D. Champion,et al.  Book Review:Assimilation in American Life: The Role of Race, Religion, and National Origins. Milton M. Gordon , 1965 .

[3]  B. Anderson,et al.  Sociological theories in progress , 1966 .

[4]  S. Leinhardt,et al.  The Structure of Positive Interpersonal Relations in Small Groups. , 1967 .

[5]  P. Holland,et al.  A Method for Detecting Structure in Sociometric Data , 1970, American Journal of Sociology.

[6]  P. Holland,et al.  Local Structure in Social Networks , 1976 .

[7]  Edward A. Bender,et al.  The Asymptotic Number of Labeled Graphs with Given Degree Sequences , 1978, J. Comb. Theory A.

[8]  Frank Harary,et al.  Matrix measures for transitivity and balance , 1979 .

[9]  B. Bollobás.  The evolution of random graphs , 1984 .

[10]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[11]  S. Brenner,et al.  The structure of the nervous system of the nematode Caenorhabditis elegans. , 1986, Philosophical transactions of the Royal Society of London. Series B, Biological sciences.

[12]  P. Gács,et al.  Algorithms , 1992 .

[13]  Bruce A. Reed,et al.  A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.

[14]  Bruce A. Reed,et al.  The Size of the Giant Component of a Random Graph with a Given Degree Sequence , 1998, Combinatorics, Probability and Computing.

[15]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[16]  S. Redner.  How popular is your paper? An empirical study of the citation distribution , 1998, cond-mat/9804163.

[17]  M. Newman,et al.  Scaling and percolation in the small-world network model. , 1999, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[18]  Lada A. Adamic,et al.  Internet: Growth dynamics of the World-Wide Web , 1999, Nature.

[19]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[20]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[21]  H E Stanley,et al.  Classes of small-world networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[22]  Cohen,et al.  Resilience of the internet to random breakdowns , 2000, Physical review letters.

[23]  P D Karp,et al.  Global properties of the metabolic map of Escherichia coli. , 2000, Genome research.

[24]  M. Newman,et al.  Random graphs with arbitrary degree distributions and their applications. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[25]  Z. Burda,et al.  Statistical ensemble of scale-free random graphs. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[26]  D. Fell,et al.  The small world inside large metabolic networks , 2000, Proceedings of the Royal Society of London. Series B: Biological Sciences.

[27]  Fan Chung Graham,et al.  A Random Graph Model for Power Law Graphs , 2001, Exp. Math..

[28]  A. Rbnyi.  ON THE EVOLUTION OF RANDOM GRAPHS , 2001 .

[29]  A. Krzywicki.  Defining statistical ensembles of random graphs , 2001 .

[30]  S. Strogatz.  Exploring complex networks , 2001, Nature.

[31]  Ramon Ferrer i Cancho,et al.  The small world of human language , 2001, Proceedings of the Royal Society of London. Series B: Biological Sciences.

[32]  P. ERDbS.  ON THE STRENGTH OF CONNECTEDNESS OF A RANDOM GRAPH , 2001 .

[33]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[34]  A. Barabasi,et al.  Bose-Einstein condensation in complex networks. , 2000, Physical review letters.

[35]  R. F. Cancho,et al.  Topology of technology graphs: small world patterns in electronic circuits. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[36]  S Redner,et al.  Degree distributions of growing networks. , 2001, Physical review letters.

[37]  Pierre Collet,et al.  The Number of Large Graphs with a Positive Density of Triangles , 2002 .

[38]  S. N. Dorogovtsev,et al.  Modern architecture of random graphs: Constructions and correlations , 2002 .

[39]  S. N. Dorogovtsev,et al.  Evolution of networks , 2001, cond-mat/0106144.

[40]  Reuven Cohen,et al.  Percolation critical exponents in scale-free networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[41]  K. Sneppen,et al.  Specificity and Stability in Topology of Protein Networks , 2002, Science.

[42]  M. Newman.  Random Graphs as Models of Networks , 2002, cond-mat/0202208.

[43]  P. Bourgine,et al.  Topological and causal structure of the yeast transcriptional regulatory network , 2002, Nature Genetics.

[44]  Pierre Collet,et al.  A Rigorous Upper Bound on the Propagation Speed for the Swift–Hohenberg and Related Equations , 2002 .

[45]  S. Shen-Orr,et al.  Network motifs in the transcriptional regulation network of Escherichia coli , 2002, Nature Genetics.

[46]  Johannes Berg,et al.  Correlated random networks. , 2002, Physical review letters.

[47]  S. Shen-Orr,et al.  Network motifs: simple building blocks of complex networks. , 2002, Science.

[48]  Sergey N. Dorogovtsev,et al.  Principles of statistical mechanics of random networks , 2002, ArXiv.

[49]  M E J Newman.  Assortative mixing in networks. , 2002, Physical review letters.

[50]  Jean-Pierre Eckmann,et al.  Curvature of co-links uncovers hidden thematic layers in the World Wide Web , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[51]  R. Ferrer i Cancho,et al.  Scale-free networks from optimal design , 2002, cond-mat/0204344.

[52]  F. Chung,et al.  The average distances in random graphs with given expected degrees , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[53]  S. N. Dorogovtsev,et al.  Mesoscopics and fluctuations in networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[54]  A. ADoefaa,et al.  ? ? ? ? f ? ? ? ? ? , 2003 .

[55]  G. Bianconi,et al.  Number of loops of size h in growing scale-free networks. , 2002, Physical review letters.

[56]  Albert-László Barabási,et al.  Hierarchical organization in complex networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[57]  K. Sneppen,et al.  Detection of topological patterns in complex networks: correlation profile of the internet , 2002, cond-mat/0205379.

[58]  宁北芳,et al.  疟原虫var基因转换速率变化导致抗原变异[英]／Paul H, Robert P, Christodoulou Z, et al//Proc Natl Acad Sci U S A , 2005 .