Diameters in preferential attachment models

Journal of Statistical Physics

Volumn 139, Issue 1, 2010, Pages 72-107

  Dommers, Sander ^a   van der Hofstad, Remco ^a   Hooghiemstra, Gerard ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b Department of Microelectronics   (Netherlands)

Author keywords

Distances in random graphs; Preferential attachment models; Small world networks; Universality

Indexed keywords

EID: 77949570807     PISSN: 00224715     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10955-010-9921-z     Document Type: Article

References (45)

1. Abramowitz, M., Stegun, I. A. (eds.): Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. US Government Printing Office, Washington (1964).
2. Aiello, W., Chung, F., Lu, L.: Random evolution in massive graphs. In: Handbook of Massive Data Sets. Massive Comput., vol. 4, pp. 97-122. Kluwer Acad., Dordrecht (2002).
3. Albert, R., Barabási, A.-L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74(1), 47-97 (2002).
4. Alon, N., Spencer, J. H.: The Probabilistic Method, 2nd edn. Wiley, New York (2000).
5. Barabási, A.-L.: Linked: The New Science of Networks. Perseus, Cambridge (2002).
6. Barabási, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509-512 (1999).
7. Berger, N., Bollobás, B., Borgs, C., Chayes, J., Riordan, O.: Degree distribution of the FKP network model. In: Automata, Languages and Programming. Lecture Notes in Comput. Sci., vol. 2719, pp. 725-738. Springer, Berlin (2003).
8. Bhamidi, S.: Universal techniques to analyze preferential attachment trees: Global and local analysis. In preparation. Version August 19, 2007 available from http://www. unc. edu/~bhamidi/preferent. pdf.
9. Bollobás, B.: Random Graphs, 2nd edn. Cambridge Studies in Advanced Mathematics, vol. 73. Cambridge University Press, Cambridge (2001).
10. Bollobás, B., Riordan, O.: Mathematical results on scale-free random graphs. In: Handbook of Graphs and Networks, pp. 1-34. Wiley, Weinheim (2003).
11. Bollobás, B., Riordan, O.: Robustness and vulnerability of scale-free random graphs. Internet Math. 1(1), 1-35 (2003).
12. Bollobás, B., Riordan, O.: Coupling scale-free and classical random graphs. Internet Math. 1(2), 215-225 (2004).
13. Bollobás, B., Riordan, O.: The diameter of a scale-free random graph. Combinatorica 24(1), 5-34 (2004).
14. Bollobás, B., Riordan, O.: Shortest paths and load scaling in scale-free trees. Phys. Rev. E. 69, 036114 (2004).
15. Bollobás, B., Riordan, O., Spencer, J., Tusnády, G.: The degree sequence of a scale-free random graph process. Random Struct. Algorithms 18(3), 279-290 (2001).
16. Bollobás, B., Borgs, C., Chayes, J., Riordan, O.: Directed scale-free graphs. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, 2003, pp. 132-139. New York (2003).
17. Bollobás, B., Janson, S., Riordan, O.: The phase transition in inhomogeneous random graphs. Random Struct. Algorithms 31(1), 3-122 (2007).
18. Chung, F., Lu, L.: The average distances in random graphs with given expected degrees. Proc. Natl. Acad. Sci. USA 99(25), 15879-15882 (2002) (electronic).
19. Chung, F., Lu, L.: The average distance in a random graph with given expected degrees. Internet Math. 1(1), 91-113 (2003).
20. Chung, F., Lu, L.: Coupling online and offline analyses for random power law graphs. Internet Math. 1(4), 409-461 (2004).
21. Chung, F., Lu, L.: Complex Graphs and Networks. CBMS Regional Conference Series in Mathematics, vol. 107. Published for the Conference Board of the Mathematical Sciences, Washington (2006).
22. Cooper, C., Frieze, A.: A general model of web graphs. Random Struct. Algorithms 22(3), 311-335 (2003).
23. Deijfen, M., van den Esker, H., van der Hofstad, R., Hooghiemstra, G.: A preferential attachment model with random initial degrees. Arkiv Mat. 47(1), 41-72 (2009).
24. Dorogovtsev, S. N., Mendes, J. F. F.: Evolution of networks. Adv. Phys. 51, 1079-1187 (2002).
25. Durrett, R.: Random Graph Dynamics. Cambridge University Press, Cambridge (2007).
26. Feller, W.: An Introduction to Probability Theory and Its Applications, vol. II. Wiley, London (1970).
27. Fernholz, D., Ramachandran, V.: The diameter of sparse random graphs. Random Struct. Algorithms 31(4), 482-516 (2007).
28. Hagberg, O., Wiuf, C.: Convergence properties of the degree distribution of some growing network models. Bull. Math. Biol. 68, 1275-1291 (2006).
29. Janson, S., Łuczak, T., Ruciński, A.: Random Graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, New York (2000).
30. Jordan, J.: The degree sequences and spectra of scale-free random graphs. Random Struct. Algorithms 29(2), 226-242 (2006).
31. Móri, T. F.: On random trees. Studia Sci. Math. Hungar. 39(1-2), 143-155 (2002).
32. Móri, T. F.: The maximum degree of the Barabási-Albert random tree. Comb. Probab. Comput. 14(3), 339-348 (2005).
33. Newman, M. E. J.: The structure and function of complex networks. SIAM Rev. 45(2), 167-256 (2003) (electronic).
34. Norros, I., Reittu, H.: On a conditionally Poissonian graph process. Adv. Appl. Probab. 38(1), 59-75 (2006).
35. Oliveira, R., Spencer, J.: Connectivity transitions in networks with super-linear preferential attachment. Internet Math. 2(2), 121-163 (2005).
36. Pittel, B.: Note on the heights of random recursive trees and random m-ary search trees. Random Struct. Algorithms 5(2), 337-347 (1994).
37. Reittu, H., Norros, I.: On the power law random graph model of massive data networks. Perform. Eval. 55(1-2), 3-23 (2004).
38. Rudas, A., Tóth, B., Valkó, B.: Random trees and general branching processes. Random Struct. Algorithms 31(2), 186-202 (2007).
39. van den Esker, H., van der Hofstad, R., Hooghiemstra, G., Znamenski, D.: Distances in random graphs with infinite mean degrees. Extremes 8, 111-140 (2006).
40. van den Esker, H., van der Hofstad, R., Hooghiemstra, G.: Universality for the distance in finite variance random graphs. J. Stat. Phys. 133(1), 169-202 (2008).
41. van der Hofstad, R.: Random graphs and complex networks. In preparation, (2009). Available on http://www. win. tue. nl/~rhofstad/NotesRGCN. pdf.
42. van der Hofstad, R., Hooghiemstra, G., van Mieghem, P.: Distances in random graphs with finite variance degrees. Random Struct. Algorithms 26, 76-123 (2005).
43. van der Hofstad, R., Hooghiemstra, G., Znamenski, D.: Distances in random graphs with finite mean and infinite variance degrees. Electron. J. Probab. 12(25), 703-766 (2007) (electronic).
44. van der Hofstad, R., Hooghiemstra, G., Znamenski, D.: A phase transition for the diameter of the configuration model. Internet Math. 4(1), 113-128 (2008).
45. Wadsworth, G. P., Bryan, J. G.: Introduction to Probability and Random Variables. McGraw-Hill, New York (1960).