On large deviation properties of Erdös-Rényi random graphs

Journal of Statistical Physics

Volumn 117, Issue 3-4, 2004, Pages 387-426

  Engel, Andreas ^a   Monasson, Rémi ^b   Hartmann, Alexander K ^c  

^a UNIVERSITY OF OLDENBURG   (Germany)

^b CNRS   (France)

^c Germany   (Germany)

Author keywords

cavity method; large deviations; Potts model; Random graphs

Indexed keywords

EID: 7244240993     PISSN: 00224715     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10955-004-2268-6     Document Type: Article

References (28)

1. P. Erdös and A. Rényi, On the evolution of random graphs, Publ. Math. Inst. Hungar. Acad. Sci. 5:17-61. (1960).
2. N. C. Wormald, Models of random regular graphs. Surveys in combinatorics, 1999, J. D. Lamb and D. A. Preece, eds. London Mathematical Society, Lecture Note Series, Vol. 276, Cambridge University Press, Cambridge, (1999), pp. 239-298.
3. A. L. Barabsi and R. Albert, Statistical mechanics of complex networks, Rev. Mod. Phys. 74:47-97, (2002).
4. B. Bollobas, O. Riordan, J. Spencer, and G. Tusnady, The degree sequence of a scale free random graph process, Random Structures and Algorithms 18:279-290, (2001).
5. A. Andreanov, F. Barbieri, and O. C. Martin, Large deviations in spin glass ground state energies, preprint cond-mat/0307709, (2003).
6. A. Simonian and J. Guibert, Large deviations approximation for fluid queues fed by a large number of on/off sources, IEEE Journal of Selected Areas in Communications 13:1017- 1027, (1995).
7. M. Mandjes, and J. Han Kim, Large deviations for small buffers: An insensitivity result, Queueing Systems 37:349-362, (2001).
8. G. Semerjian, and R. Monasson, Relaxation and metastability in a local search procedure for the random satisfiability problem, Phys. Rev. E 67:066103; W. Barthel, A. K. Hartmann, and M. Weigt, (2003) Solving satisfiability problems by fluctuations: The dynamics of stochastic local search algorithms, Phys. Rev. E 67:066104 (2003).
9. G. Semerjian, and R. Monasson, Relaxation and metastability in a local search procedure for the random satisfiability problem, Phys. Rev. E 67:066103; W. Barthel, A. K. Hartmann, and M. Weigt, (2003) Solving satisfiability problems by fluctuations: The dynamics of stochastic local search algorithms, Phys. Rev. E 67:066104 (2003).
10. S. Cocco, and R. Monasson, Exponentially hard problems are sometimes polynomial, a large deviation analysis of search algorithms for the random satisfiability problem, and its application to stop-and-restart resolutions, Phys. Rev. E 66:037101 (2002).
11. A. Montanari, and R. Zecchina, Optimizing searches via rare events, Phys. Rev. Lett. 88:178701 (2002).
12. N. O'Connell, Some large deviation results for sparse random graphs, Prob. Theor. Rel. Fields 110:277 (1998).
13. F. P. Machado, Large deviations for the number of open clusters per site in long range bond percolation, Markov Processes and Related Fields 3:367-376 (1997).
14. P. Duxbury, D. Jacobs, M. Thorpe, and C. Moukarzel, Floppy modes and the free-energy: Rigidity and connectivity percolation on Bethe lattices, Phys. Rev. E 59:2084; C. Moukarzel, (2003) Rigidity percolation in a field, preprint cond-mat/0306380 (1999).
15. P. Duxbury, D. Jacobs, M. Thorpe, and C. Moukarzel, Floppy modes and the free-energy: Rigidity and connectivity percolation on Bethe lattices, Phys. Rev. E 59:2084; C. Moukarzel, (2003) Rigidity percolation in a field, preprint cond-mat/0306380 (1999).
16. M. Mezard, G. Parisi, and M. Virasoro, Spin glasses and Beyond. World Scientific, Singapore, (1987).
17. C. M. Fortuin, and P. W. Kasteleyn, On the random cluster model. I. Introduction and relation to other models, Physica 57:536 (1972).
18. B. Bollobàs, Random Graphs. 2nd edition, Cambridge University Press, Cambridge, (2001).
19. R. Potts, Some generalized order-disorder transformations, Proc. Camb. Phil. Soc. 48:106 (1952).
20. F. Wu, The Potts model, Rev. Mod. Phys. 54:235 (1982).
21. J.-Ch. Angles d'Auriac, F. Igloi, M. Preissmann, A. Sebo, Optimal Cooperation and Submodularity for Computing Potts' Partition Functions with a Large Number of State, J. Phys. 35A:6973 (2002).
22. M. Feller, An introduction to Probability Theory and Its Applications, Vol.1 Wiley, 3rd ed, Chapter V, New York, (1968).
23. R. Segdewick, and P. Flajolet, An introduction to the analysis of algorithms. Chapter 3, Addison-Wesley, Boston, (1995).
24. D. Barraez, S. Boucheron, W. Fernandez de la Vega, On the fluctuations of the giant component, Combin. Probab. Comput. 9:287-304 (2000).
25. see Ref. [16], chapter 6.
26. H. S. Wilf, Generating functionology, Theorem 3.12.1. Chapter 3, Academic Press (1994).
27. A. K. Hartmann, Sampling rare events: Statistics of local sequence alignments, Phys. Rev. E 65:056102 (2002).
28. O. Rivoire, Properties of atypical graphs from negative complexities, cond-mat/0312501 (2004).