Distances in Random graphs with finite variance degrees

Random Structures and Algorithms

Volumn 27, Issue 1, 2005, Pages 76-123

  Van Der Hofstad, Remco ^a   Hooghiemstra, Gerard ^b   Van Mieghem, Piet ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 24144451049     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.20063     Document Type: Article

References (42)

1. W. Aiello, F. Chung, and L. Lu, A random graph model for power law graphs, Experiment Math 10(1) (2001), 53-66.
2. W. Aiello, F. Chung, and L. Lu, "Random evolution of massive graphs," Handbook of massive data sets, Eds., J. Abello, P. M. Pardalos and M. G. C. Resende, 97-122. Kluwer Academic, Dordrecht, 2002.
3. R. Albert and A.-L. Barabási, Emergence of scaling in random networks, Science 286 (1999), 509-512.
4. R. Albert and A.-L. Barabási, Statistical mechanics of complex networks, Rev Mod Phys 74 (2002), 47-97.
5. N. Alon and J. Spencer, The probabilistic method, 2nd edition, Wiley, New York, 2000.
6. S. Asmussen, Some martingale methods in the limit theory of supercritical branching processes, Branching processes, A. Joffe and P. Ney (Editors), 1-26. Marcel Dekker, New York and Basel, 1978.
7. K. B. Athreya and P. E. Ney, Branching processes, Springer, Berlin, 1972.
8. A.-L. Barabási, Linked: The new science of networks, Perseus Publishing, Cambridge, MA, 2002.
9. B. Bollobás, Random graphs, 2nd edition, Academic Press, New York, 2001.
10. B. Bollobás, C. Borgs, J. T. Chayes, and O. Riordan, Directed scale-free graphs, Proc Fourteenth Annu ACM-SIAM Symp Discrete Algorithms (Baltimore, MD, 2003), ACM, New York, 2003, pp.132-139.
11. B. Bollobás and O. Riordan, The diameter of scale-free random graphs, preprint, Department of Mathematical Sciences, University of Memphis, 2003.
12. B. Bollobás and O. Riordan, Mathematical results on scale-free random graphs, Handbook of graphs and networks, Wiley-VCH, Weinheim, 2003, pp. 1-34.
13. B. Bollobás and O. Riordan, Coupling scale-free and classical random graphs, Preprint, 2003.
14. 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 (2001), 279-290.
15. B. Bollobás and F. de la Vega, The diameter of random regular graphs, Combinatorica 2 (1982), 125-134.
16. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener, Graph structure in the Web, Comput Networks 33 (2000), 309-320.
17. F. Chung and L. Lu, The average distances in random graphs with given expected degrees, PNAS 99(25) (2002), 15879-15882.
18. F. Chung and L. Lu, Connected components in random graphs with given expected degree sequences, Ann Combinat 6 (2002), 125-145.
19. C. Cooper and A. A. Frieze, A general model of web graphs, Random Structures Algorithms 22(3) (2003), 311-335.
20. S. N. Dorogovtsev, A. V. Goltsev, and J. F. F. Mendes, Pseudofractal scale-free web, Phys Rev E 65(2002) 066122.
21. S. N. Dorogovtsev, J. F. F. Mendes, and A. N. Samuhkin, Metric structure of random networks, Nucl Phys B 653 (2003), 307.
22. C. Faloutsos, P. Faloutsos, and M. Faloutsos, On power-law relationships of the internet topology, Comput Commun Rev 29 (1999), 251-262.
23. W. Feller, An introduction to probability theory and its applications, Volume II, 2nd edition, Wiley, New York, 1971.
24. R. van der Hofstad, G. Hooghiemstra, and D. Znamenski, Distances in random graphs with finite mean and infinite variance degrees, preprint 2005.
25. R. van der Hofstad, G. Hooghiemstra, and D. Znamenski, Distances in random graphs with infinite mean degrees, preprint, 2004.
26. R. van der Hofstad, G. Hooghiemstra, and D. Znamenski, Random graphs with arbritrary i.i.d. degrees, preprint, 2005.
27. G. Hooghiemstra and P. Van Mieghem, On the mean distance in scale free graphs. Preprint, 2003, online available from http://ssor.twi.tudelft.nl/~gerardh/
28. S. Janson, T. Luczak, and A. Rucinski, Random graphs, Wiley, New York, 2000.
29. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins, Trawling the Web for emerging cyber communities, Comput Networks 31(11-16) (1999), 1481-1493.
30. R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal, Stochastic Models for the Web Graph, 42nd Annu IEEE Symp Foundations of Computer Science, 2000, pp. 57-65.
31. M. Molloy and B. Reed, A critical point for random graphs with a given degree sequence, Random Structures Algorithms 6 (1995), 161-179.
32. M. Molloy and B. Reed, The size of the giant component of a random graph with a given degree sequence, Combin Probab Comput 7 (1998), 295-305.
33. M. E. J. Newman, The structure and function of complex network, SIAM Rev 45(2) (2003), 167-256.
34. V. Paxson, End-to-end routing behaviour in the Internet, IEEE Trans Networking 5(5) (1997), 601-615.
35. M. E. J. Newman, S. H. Strogatz, and D. J. Watts, Random graphs with arbitrary degree distribution and their application, Phys Rev E 64 (2002), 026118, 1-17.
36. H. Reittu and I. Norros, On the power law random graph model of massive data networks, Performance Eval 55(1-2) (2004), 3-23.
37. S. H. Strogatz, Exploring complex networks, Nature 410(8) (2001), 268-276.
38. H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger, Network topology generators: Degree-based vs. structural, ACM Sigcomm'02, Pittsburgh, PA, 2002, pp. 19-23.
39. H. Thorisson, Coupling, stationarity and regeneration, Springer, New York, 2000.
40. P. Van Mieghem, G. Hooghiemstra, and R. van der Hofstad, A scaling law for the hopcount. Report 2000125, Delft University of Technology, Delft, The Netherlands, available online at http://www.nas.ewi.tudelft.nl/people/Piet/papers/hopcount.pdf
41. D. J. Watts, Small worlds, the dynamics of networks between order and randomness, Princeton University Press, Princeton, NJ, 1999.
42. D. Williams, Diffusions, Markov processes and martingales, Wiley, New York, 1979.