On the mean distance in scale free graphs

Methodology and Computing in Applied Probability

Volumn 7, Issue 3, 2005, Pages 285-306

  Hooghiemstra, G ^a   Van Mieghem, P ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Mean distance; Scale free graphs

Indexed keywords

EID: 28044473396     PISSN: 13875841     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11009-005-4518-8     Document Type: Article

References (36)

1. M. Abramowitz and I. A. Stegun 1968 "Handbook of Mathematical Functions" Dover New York
2. W. Aiello, F. Chung, and L. Lu, "A random graph model for power law graphs," Experimental Mathematics vol. 10(1) pp. 53-66, 2001.
3. W. Aiello F. Chung and L. Lu 2002 Random evolution of massive graphs In J. Abello P. M. Pardalos and M. G. C. Resende Handbook of Massive Data Sets Kluwer Academic Dordrecht pp. 97-122
4. R. Albert and A.-L. Barabási, "Emergence of scaling in random networks," Science vol. 286 pp. 509-512, 1999. 10.1126/ science.286.5439.509
5. R. Albert and A.-L. Barabási, "Statistical mechanics of complex networks," Reviews of Modern Physics vol. 74 pp. 47-97, 2002. 10.1103/RevModPhys.74.47
6. S. Asmussen 1978 Some martingale methods in the limit theory of supercritical branching processes In A. Joffe P. Ney (eds.) Branching Processes. Advances in Applied Probability 5 Marcel Dekker New York
7. A.-L. Barabasi 2002 Linked, the New Science of Networks Perseus Publishing Cambridge, MA
8. B. Bollobás, Random Graphs 2nd edition, Academic Press, 2001.
9. B. Bollobás and O. Riordan, The Diameter of Scale-Free Random Graphs, Preprint Dept. of Math. Sciences, University of Memphis, 2003a.
10. B. Bollobás and O. Riordan 2003b "Mathematical results on scale-free random graphs" Handbook of Graphs and Networks Wiley-VCH Weinheim pp. 1-34
11. B. Bollobás and O. Riordan, Coupling Scale-Free and Classical Random Graphs. Preprint, 2003c.
12. B. Bollobás, O. Riordan, J. Spencer, and G. Tusnády, "The degree sequence of a scale-free random graph process, "Random Structures Algorithms, vol. 18 pp. 279-290, 2001. 10.1002/ rsa.1009
13. B. Bollobás C. Borgs J. T. Chayes and O. Riordan 2003 Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Baltimore, MD, 2003) ACM New York pp. 132-139 (Directed scale-free graphs)
14. F. Chung and L. Lu, "The average distances in random graphs with given expected degrees," PNAS vol. 99(25) pp. 15879-15882, 2002a. 10.1073/pnas.252631999
15. F. Chung and L. Lu, "Connected components in random graphs with given expected degree sequences," Annals of Combinatorics vol. 6 pp. 125-145, 2002b.
16. C. Cooper and A. A. Frieze, "A general model of web graphs," Random Structures Algorithms vol. 22(3) pp. 311-335, 2003. 10.1002/ rsa.10084
17. S. N. Dorogovtsev, A. V. Goltsev and J. F. F. Mendes, "Pseudofractal scale-free web," Physical review. E, vol. 65, pp. 66-122, 2002. 10.1103/PhysRevE.65.066122
18. S. N. Dorogovtsev, J. F. F. Mendes and A. N. Samuhkin, "Metric structure of random networks," Nuclear Physics. B vol. 653 p. 307, 2003. 10.1016/S0550-3213(02)01119-7
19. M. S. Dubuc, "La densité de la loi-limite d'un processus en cascade expansif," Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete vol. 19 pp. 281-290, 1971. 10.1007/BF00535833
20. C. Faloutsos, P. Faloutsos and M. Faloutsos, "On power-law relationships of the Internet topology," Proceedings of the ACM SIGCOMM, 1999.
21. G. R. Grimmett and D. R. Stirzacker 1982 Probability and Random Processes Clarendon Press Oxford
22. R. van der Hofstad, G. Hooghiemstra and P. Van Mieghem, "Distances in random graphs with finite variance degrees," Random Structures and Algorithms vol. 27(1) pp. 76-123, 2005. 10.1002/rsa.20063
23. R. van der Hofstad, G. Hooghiemstra and D. Znamenski, "Distances in random graphs with finite mean and infinite variance degrees," Preprint 2004a.
24. R. van der Hofstad, G. Hooghiemstra and D. Znamenski, "Random graphs with infinite mean degrees," Preprint 2004b.
25. R. van der Hofstad, G. Hooghiemstra and D. Znamenski, "Random graphs with i.i.d. degrees," Preprint 2004c.
26. P. Jagers 1975 Branching Processes with Biological Applications John Wiley and Sons London
27. R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins and E. Upfal, "Stochastic Models for the Web Graph." 42st Annual IEEE Symposium on Foundations of Computer Science, pp. 57-65, 2000.
28. M. Loève 1960 Probability Theory 2nd edition, Van Nostrand New York
29. M. Molloy and B. Reed, "A critical point for random graphs with a given degree sequence," Random Structures and Algorithms vol. 6 pp. 161-179, 1995.
30. M. Molloy and B. Reed, "The size of the giant component of a random graph with a given degree sequence" Combinatorics, Probability and Computing vol. 7, pp. 295-305, 1998.
31. M.E.J. Newman, "The structure and function of complex networks" SIAM Review vol. 45(2) pp. 167-256, 2003. 10.1137/ S003614450342480
32. M. E. J. Newman, S. H. Strogatz, and D. J. Watts, "Random graphs with arbitrary degree distribution and their application," Physical Review. E vol. 64, 026118, pp. 1-17, 2001. 026118
33. R. Pastor-Satorras, A. Vázquez and A. Vespignani, "Dynamical and correlation properties of the Internet," Physical Review Letters vol. 87 pp. 258-701, 2001. 10.1103/PhysRevLett.87.258701
34. H. Reittu and I. Norros, "On the power law random graph model of massive data networks," Performance Evalution vol. 55(1-2) pp. 3-23, 2004. 10.1016/S0166-5316(03)00097-X
35. H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger, "Network topology generators: Degree-based vs. structural." ACM Sigcomm'02, Pittsburgh, Pennsylvania, pp. 19-23, USA, 2002.
36. P. Van Mieghem, "The limit random variable W of a branching process." Submitted to Methodology and Computing in Applied Probability, 2004.