Phase transitions in dynamical random graphs

Journal of Statistical Physics

Volumn 123, Issue 5, 2006, Pages 1007-1032

  Turova, Tatyana S ^a  

^a LUND UNIVERSITY   (Sweden)

Author keywords

Inhomogeneous random graphs; Phase transitions

Indexed keywords

EID: 33746890856     PISSN: 00224715     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10955-006-9101-3     Document Type: Article

References (23)

1. K. B. Athreya and P. E. Ney, Branching processes. Die Grundlehren der mathematischen Wissenschaften, Band 196. (Springer-Verlag, New York-Heidelberg, 1972).
2. A.-L. Barabási, R. Albert and H. Jeong, Mean-field theory for scale-free random networks. Physica A: Statistical Mechanics and its Applications 272:173-187 (1999).
3. A. D. Barbour and G. Reinert, Small worlds. Random Structures Algorithms 19:54-74 (2001).
4. B. Bollobás, Random graphs. (Academic Press, 1985).
5. B. Bollobás, S. Janson and O. Riordan, The phase transition in the uniformly grown random graph has infinite order, To appear in Random Structures and Algorithms.
6. B. Bollobás, O. Riordan, J. Spencer and G. Tusnády, The degree sequence of a scale-free random graph process. Random Structures Algorithms 18:279-290 (2001).
7. D. S. Callaway, J. E. Hopcroft, J. M. Kleinberg, M. E. J. Newman and S. H. Strogatz, Are randomly grown graphs really random? Phys. Review E 64:041902 (2001).
8. S. N. Dorogovtsev and J. F. F. Mendes, Evolution of networks: From biological nets to the Internet and WWW. (Oxford University Press, Oxford, 2003).
9. R. Durret, Rigorous result for the CHKNS random graph model. Discrete random walks (Paris, 2003), 95-104 (electronic), Discrete Math. Theor. Comput. Sci. Proc., AC, Assoc. Discrete Math. Theor. Comput. Sci., Nancy, 2003.
10. P. Erdös and A. Rényi, On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci. 5:17-61 (1960).
11. S. Janson, T. Łuczak and A. Ruciński, Random graphs, Wiley-Interscience Series in Discrete Mathematics and Optimization. (Wiley-Interscience, New York, 2000).
12. R. M. Karp, The transitive closure of a random digraph. Random Structures Algorithms 1(1):73-93 (1990).
13. V. A. Malyshev, Random graphs and grammars on graphs. Discrete Math. Appl. 8(3):247-262 (1998).
14. V. A. Malyshev, Random infinite spin graph evolution. On Dobrushin's way. From probability theory to statistical physics, Amer. Math. Soc. Transl. Ser. 2, pp. 157-167, 198, Amer. Math. Soc., Providence, RI, 2000.
15. B. Söderberg, Properties of random graphs with hidden color. Physical Review E 68:026107 (2003).
16. B. Söderberg, Random graphs with hidden color. Physical Review E 68:015102(R) (2003).
17. B. Söderberg, A general formalism for inhomogeneous random graphs. Physical Review E 66:066121 (2002).
18. T. S. Turova, Long paths and cycles in the dynamical graphs. Journal of Statistical Physics 110(1/2):385-417 (2003).
19. T. S. Turova, Dynamical random graphs with memory. Phys. Review E 70:059902(2004) 1-9 (2004).
20. (Also: Erratum: Dynamical random graphs with memory. Phys. Review E 65:066102 (2002).
21. T. S. Turova, Note on the random graphs in the subcritical case. Dynamical systems from number theory to probability-2, A. Yu. Khrennikov (ed.) (Växjö University Press, 2003), 187-192.
22. T. S. Turova, Study of Synaptic Plasticity via Random Graphs. BioSystems 67:281-286 (2002).
23. D. J. Watts and S. H. Strogatz, Collective dynamics of "small-world" networks. Nature 393:440-442 (1998).