On Large Deviation Properties of Erdös–Rényi Random Graphs (original) (raw)

Access this article

Log in via an institution

Subscribe and save

• Starting from 10 chapters or articles per month
• Access and download chapters and articles from more than 300k books and 2,500 journals
• Cancel anytime View plans

Buy Now

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

Instant access to the full article PDF.

REFERENCES

1. P. Erd¨os and A. R´enyi, On the evolution of random graphs, Publ. Math. Inst. Hungar. Acad. Sci. 5:17–61, (1960).
   Google Scholar
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.
   Google Scholar
3. A. L. Barabsi and R. Albert, Statistical mechanics of complex networks, Rev. Mod. Phys. 74:47–97, (2002).
   Google Scholar
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).
   Google Scholar
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 uid queues fed by a large number of on/off sources, IEEE Journal of Selected Areas in Communications 13:1017–1027, (1995).
   Google Scholar
7. M. Mandjes, and J. Han Kim, Large deviations for small buffers:An insensitivity result, Queueing Systems 37:349–362, (2001).
   Google Scholar
8. G. Semerjian, and R. Monasson, Relaxation and metastability in a local search procedure for the random satis ability problem, Phys. Rev. E 67:066103;W. Barthel, A. K. Hartmann, and M. Weigt, (2003) Solving satisfy ability problems by uctuations: The dynamics of stochastic local search algorithms, Phys. Rev. E 67:066104 (2003).
   Google Scholar
9. S. Cocco, and R. Monasson, Exponentially hard problems are sometimes polynomial, a large deviation analysis of search algorithms for the random satis ability problem, and its application to stop-and-restart resolutions, Phys. Rev. E 66:037101 (2002).
   Google Scholar
10. A. Montanari, and R. Zecchina, Optimizing searches via rare events, Phys. Rev. Lett. 88:178701 (2002).
    Google Scholar
11. N. O'Connell, Some large deviation results for sparse random graphs, Prob. Theor. Rel. Fields 110:277 (1998).
    Google Scholar
12. 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).
    Google Scholar
13. 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 eld, preprint cond-mat/0306380 (1999).
    Google Scholar
14. M. Mezard, G. Parisi, and M. Virasoro, Spin glasses and Beyond. World Scientific, Singapore, (1987).
    Google Scholar
15. C. M. Fortuin, and P. W. Kasteleyn, On the random cluster model. I. Introduction and relation to other models, Physica 57:536 (1972).
    Google Scholar
16. B. Bollobàs, Random Graphs. 2nd edition, Cambridge University Press, Cambridge, (2001).
    Google Scholar
17. R. Potts, Some generalized order-disorder transformations, Proc. Camb. Phil. Soc. 48:106 (1952).
    Google Scholar
18. F. Wu, The Potts model, Rev. Mod. Phys. 54:235 (1982).
    Google Scholar
19. J.-Ch. Angles d'Auriac, F. Igloi, M. Preissmann, A. Sebo, Optimal Cooperation and Sub-modularity for Computing Potts 'Partition Functions with a Large Number of State, J. Phys. 35A:6973 (2002).
    Google Scholar
20. M. Feller, An introduction to Probability Theory and Its Applications, Vol. 1 Wiley, 3rd ed, Chapter V, New York, (1968).
    Google Scholar
21. R. Segdewick, and P. Flajolet, An introduction to the analysis of algorithms, Chapter 3, Addison-Wesley, Boston, (1995).
    Google Scholar
22. D. Barraez, S. Boucheron, W. Fernandez de la Vega, On the uctuations of the giant component, Combin. Probab. Comput. 9:287–304 (2000).
    Google Scholar
23. see Ref. [16 ], chapter 6.
24. H. S. Wilf, Generating functionology, Theorem 3. 12. 1, Chapter 3, Academic Press (1994).
25. A. K. Hartmann, Sampling rare events:Statistics of local sequence alignments, Phys. Rev. E 65:056102 (2002).
    Google Scholar
26. O. Rivoire, Properties of atypical graphs from negative complexities, cond-mat/0312501 (2004).

Download references