Skip to main content
SpringerLink
Log in

A Simple Asymmetric Evolving Random Network

  • Published:
Journal of Statistical Physics Aims and scope Submit manuscript

Abstract

We introduce a new oriented evolving graph model inspired by biological networks. A node is added at each time step and is connected to the rest of the graph by random oriented edges emerging from older nodes. This leads to a statistical asymmetry between incoming and outgoing edges. We show that the model exhibits a percolation transition and discuss its universality. Below the threshold, the distribution of component sizes decreases algebraically with a continuously varying exponent depending on the average connectivity. We prove that the transition is of infinite order by deriving the exact asymptotic formula for the size of the giant component close to the threshold. We also present a thorough analysis of aging properties. We compute local-in-time profiles for the components of finite size and for the giant component, showing in particular that the giant component is always dense among the oldest nodes but invades only an exponentially small fraction of the young nodes close to the threshold.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. R. Albert and A.-L. Barabási, Statistical mechanics of complex networks, Rev. Modern Phys. 74:47(2002).

    Google Scholar 

  2. F. Bergeron, G. Labelle, and P. Leroux, Combinatorial Species and Tree-like Structures, Chap. 3, Encyclopedia of Mathematics (Cambridge University Press, 1998).

  3. S. N. Dorogovtsev and J. F. F. Mendes, Evolution of networks, to appear in Adv. Phys. 51 (2002).

  4. S. N. Dorogovtsev, J. F. F. Mendes, and A. N. Samukhin, Anomalous percolation properties of growing networks, Phys. Rev. E 64:066110(2001).

    Google Scholar 

  5. P. Erdös and A. Rényi, On the evolution of random graphs, Publ. Math. Inst. Hungar. Acad. Sci. 5:17-61 (1960).

    Google Scholar 

  6. I. P. Goulden and D. M. Jackson, Combinatorial Enumeration, Chap. 3 (Wiley, 1983).

  7. N. Guelzim, S. Bottani, P. Bourgine, and F. Képès, Topological and causal structure of the yeast genetic network, Nature Genetics, in press.

  8. J. Kim, P. L. Krapivsky, B. Kahng, and S. Redner, Evolving protein interaction networks, arXiv:cond-mat/0203167.

  9. D. S. Callaway, J. E. Hopcroft, J. M. Kleinberg, M. E. J. Newman, and H. Strogatz, Are randomly grow graphs really random?, Phys. Rev. E 64:041902(2001).

    Google Scholar 

  10. G. Schaeffer, Private Communication.

  11. R. M. Wilson and J. H. van Lint, A Course in Combinatorics, Chap. 2 (Cambridge University Press, New York, 1992).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Service de Physique Théorique de Saclay, CE Saclay, 91191, Gif sur Yvette, France

    Michel Bauer & Denis Bernard (Member of the CNRS)

Authors
  1. Michel Bauer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Denis Bernard
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Michel Bauer.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bauer, M., Bernard, D. A Simple Asymmetric Evolving Random Network. Journal of Statistical Physics 111, 703–737 (2003). https://doi.org/10.1023/A:1022842013935

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022842013935

Search

Navigation