Distances in random graphs with finite mean and infinite variance degrees

Electronic Journal of Probability

Volumn 12, Issue , 2007, Pages 703-766

  van der Hofstad, Remco ^a   Hooghiemstra, Gerard ^b   Znamenski, Dmitri ^c  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

^c EURANDOM   (Netherlands)

Author keywords

Branching processes; Configuration model; Coupling; Graph distance

Indexed keywords

EID: 34249731448     PISSN: None     EISSN: 10836489     Source Type: Journal    
DOI: 10.1214/EJP.v12-420     Document Type: Article

References (25)

1. R. Albert and A.-L. Barabasi. Statistical mechanics of complex networks. Rev. Modern Phys., 74, 47-97, 2002.
2. N. Alon and J.H. Spencer. The Probabilistic Method. 2nd Edition. Wiley, New York, 2000.
3. B. Bollobas. Random Graphs, 2nd edition. Cambridge University Press, Cambridge, 2001.
4. B. Bollobas, S. Janson and O. Riordan. The phase transition in inhomogeneous random graphs. To appear in Random Structures Algorithms. Available on http://arxiv.org/abs/math.PR/0504589, 2006.
5. T. Britton, M. Deijfen, and A. Martin-Lof. Generating simple random graphs with arbitrary degree sequences, Journal of Statistical Physics 124(6), 1377-1397, 2006.
6. F. Chung and L. Lu. The average distances in random graphs with given expected degrees. Proc. Natl. Acad. Sci., 25, 15879-15882, 2002.
7. R. Cohen and S. Havlin. Scale free networks are ultrasmall. Phys. Rev. Lett., 90, 058701, 1-4, 2003.
8. P.L. Davies. The simple branching process: a note on convergence when the mean is infinite. J. Appl. Probab. 15, 466-480, 1978.
9. R. Durrett. Random Graph Dynamics. Cambridge University Press, Cambridge (2006).
10. H. van den Esker, R. van der Hofstad, G. Hooghiemstra and D. Znamenski. Distances in random graphs with infinite mean degrees. Extremes, 8, 111-141, 2006.
11. A. Gut. Probability: A graduate course. Springer, 2005.
12. C. Faloutsos, P. Faloutsos and M. Faloutsos. On power-law relationships of the internet topology. Comp. Comm. Rev., 29, 251-262, 1999.
13. W. Feller. An Introduction to Probability Theory and Its Applications. Volume II, 2nd edition, Wiley, New York, 1971.
14. R. van der Hofstad, G. Hooghiemstra and P. Van Mieghem. Random graphs with finite variance degrees. Random Structures Algorithms, 27(1), 76-123, 2005.
15. R. van der Hofstad, G. Hooghiemstra and D. Znamenski. Random graphs with arbitrary i.i.d. degrees, Available on http://arxiv.org/abs/math.PR/0502580, 2006.
16. S. Janson. On concentration of probability. Contemporary Combinatorics, ed. B. Bollobas, Bolyai Soc. Math. Stud. 10, 289-301, Janos Bolyai Mathematical Society, Budapest, 2002.
17. S. Janson, T. Luczak and A. Rucinski. Random Graphs. Wiley, New York, 2000.
18. M.E.J. Newman. The structure and function of complex networks. SIAM Rev. 45(2), 167-256, 2003.
19. M.E.J. Newman, S.H. Strogatz, and D.J. Watts. Random graphs with arbitrary degree distribution and their application. Phys. Rev. E, 64, 026118, 2001.
20. I. Norros and H. Reittu. On a conditionally Poissonean graph process. Adv. Appl. Prob. 38, 59-75, 2006.
21. H. Reittu and I. Norros. On the power law random graph model of massive datanetworks. Performance Evalution, 55 (1-2), 3-23, 2004.
22. H-J. Schuh and A. D. Barbour. On the asymptotic behaviour of branching processes with infinite mean. Adv. Appl. Probab., 9, 681-723, 1977.
23. E. Seneta. The simple branching processes with infinite mean. I. J. Appl. Probab., 10, 206-212, 1973.
24. H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger. Network topology generators: Degree-based vs. structural. Proceedings of ACM Sigcomm, Pittsburgh, Pennsylvania, USA, 147-159, 2002.
25. D. J. Watts. Small Worlds, The Dynamics of Networks between Order and Randomness. Princeton University Press, Princeton, New Jersey, 1999.