A preferential attachment model with random initial degrees

Arkiv for Matematik

Volumn 47, Issue 1, 2009, Pages 41-72

  Deijfen, Maria ^a   Van Den Esker, Henri ^b   Van Der Hofstad, Remco ^c   Hooghiemstra, Gerard ^b  

^a STOCKHOLM UNIVERSITY   (Sweden)

^b Delft University of Technology ^*  (Netherlands)

^c EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 60849139431     PISSN: 00042080     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11512-007-0067-4     Document Type: Article

References (30)

1. AIELLO, W., CHUNG, F. and LU, L., Random evolution in massive graphs, in Handbookof Massive Data Sets, Massive Comput. 4, pp. 97-122, Kluwer, Dordrecht, 2002.
2. BARABASI, A. L. and ALBERT, R., Emergence of scaling in random networks, Science 286 (1999), 509-512.
3. BERESTYCKI, N. and DURRETT, R., A phase transition in the random transposition random walk, Probab. Theory Related Fields 136 (2006), 203-233.
4. BIANCONI, G. and BARABÁSI, A.-L., Bose-Einstein condensation in complex networks, Phys. Rev. Lett. 86:24 (2001), 5632-5635.
5. BIANCONI, G. and BARABASI, A.-L., Competition and multiscaling in evolving networks, Europhys. Lett. 54:4 (2001), 436-442.
6. BOLLOBS, B., BORGS, C, CHAYES, J. and RIORDAN, O., Directed scale-free graphs, in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Baltimore, MD, 2003), pp. 132-139, ACM, New York, 2003.
7. BOLLOBÁS, B., JANSON, S. and RIORDAN, O., The phase transition in inhomogeneous random graphs, Random Structures Algorithms 31 (2007), 3-122.
8. BOLLOBÁS, B. and RIORDAN, O., Mathematical results on scale-free random graphs, in Handbook of Graphs and Networks, pp. 1-34, Wiley, Weinheim, 2003.
9. BOLLOBÁS, B., RIORDAN, O., SPENCER, J. and TUSNÁDY, G., The degree sequence of a, scale-free random graph process, Random Structures Algorithms 18 (2001), 279-290.
10. BORGS, C, CHAYES, J., DASKALAKIS, D. and ROCH, G, First to market is not everything: an analysis of preferential attachment with fitness, in Proceedings of the 39th annual ACM symposium on the theory of computation, pp. 135-144, 2007.
11. BRITTON, T., DEIJFEN, M. and MARTTN-LÖF, A., Generating simple random graphs with prescribed degree distribution, J. Stat. Phys. 124 (2006), 1377-1397.
12. CHUNG, F. and LU, L., The average distances in random graphs with given expected degrees, Proc. Natl. Acad. Sci. USA 99:25 (2002), 15879-15882.
13. CHUNG, F. and Lu, L., Connected components in random graphs with given expected degree sequences, Ann. Comb. 6 (2002), 125-145.
14. COOPER, C. and FRIEZE, A., A general model of web graphs, Random Structures Algorithms 22 (2003), 311-335.
15. ERGUN, G. and RODGERS, G. J., Growing random networks with fitness, Phys. A 303 (2002), 261-272.
16. FALOUTSOS, C, FALOUTSOS, P. and FALOUTSOS, M., On power-law relationships of the internet topology, Computer Communications R.eviews 29 (1999), 251-262.
17. FELLER, W., An Introduction to Probability Theory and its Applications. Vol. II, Wiley, New York, 1971.
18. GRIMMETT, G. R. and STIRZAKER, D. R., Probability and Random Processes, Oxford University Press, New York, 2001.
19. GUT, A., Probability. A Graduate Course, Springer Texts in Statistics, Springer, New York, 2005.
20. HAGBERG, O. and WlUF, C, Convergence properties of the degree distribution of some growing network models, Bull. Math. Biol. 68:6 (2006), 1275-1291.
21. HALL, P., Order of magnitude of moments of sums of random variables, J. LondonMath. Soc. 24 (1981), 562-568.
22. VAN DER HOFSTAD, R. and HOOGHIEMSTRA, G., Diameters in preferential attachment models, Preprint, 2007.
23. JORDAN, J., The degree sequences and spectra of scale-free random graphs, RandomStructures Algorithms 29 (2006), 226-242.
24. KATONA, Z. and MÓRI, T. F., A new class of scale free random graphs, Statist. ProbabLett. 76:15 (2006), 1587-1593.
25. KUMAR, R., RAGHAVAN, P., RAJAGOPALAN, S., SIVAKUMAR, D., TOMKINS, A. and UPFAL, E., Stochastic models for the web graph, in 41 st Annual Symposium on Foundations of Computer Science (Redondo Beach, CA, 2000), pp. 57-65, IEEE Comput. Soc. Press, Los Alamitos, CA, 2000.
26. KUMAR, R., RAGHAVAN, P., RAJAGOPALAN, S. and TOMKINS, A., Trawling the web for emerging cyber communities, Computer Networks 31 (1999), 1481-1493,
27. NEWMAN, M. E, J, The structure and function of complex networks, SIAM Rev. 45 (2003), 167-256.
28. PICKANDS, III, J., Moment convergence of sample extremes, Ann. Math. Statist. 39 (1968), 881-889.
29. SÖDERBERG, B., General formalism for inhomogeneous random graphs, Phys. Rev. E 66:6 (2002), 6 pp.
30. SZYMAŃSKI, J., Concentration of vertex degrees in a scale-free random graph process, Random Structures Algorithms 26 (2005), 224-236.