Degree distribution of competition-induced preferential attachment graphs

Combinatorics Probability and Computing

Volumn 14, Issue 5-6, 2005, Pages 697-721

  Berger, N ^a   Borgs, C ^a   Chayes, J T ^a   D'Souza, R M ^a   Kleinberg, R D ^b  

^a MICROSOFT RESEARCH   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTION EVALUATION; GEOMETRY; ITERATIVE METHODS; MATHEMATICAL MODELS; METRIC SYSTEM; RANDOM PROCESSES;

DEGREE DISTRIBUTION; FINITE THRESHOLDS; RANDOM GRAPH MODELS;

GRAPH THEORY;

EID: 26644456191     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548305006930     Document Type: Article

References (23)

1. Aiello, W., Chung, F. and Lu, L. (2002) Random evolution of massive graphs. In Handbook of Massive Data Sets, Kluwer, pp. 97-122.
2. Albert, R. and Barabási, A.-L. (2002) Statistical mechanics of complex networks. Rev. Mod. Phys. 74 47-97.
3. Aldous, D. J. (2003) A stochastic complex network model. Electron. Res. Announc. Amer. Math. Soc. 9 152-161.
4. Barabási, A.-L. and Albert, R. (1999) Emergence of scaling in random networks. Science 286 509-512.
5. Berger, N., Bollobás, B., Borgs, C., Chayes, J. T. and Riordan, O. (2003) Degree distribution of the FKP network model. In Proc. 30th International Colloquium on Automata, Languages and Programming, Vol. 2719 of Lecture Notes in Computer Science, Springer, pp. 725-738.
6. Berger, N., Borgs, C., Chayes, J. T., D'Souza, R. M. and Kleinberg, R. D. (2004) Competition-induced preferential attachment. In Proc. 31st International Colloquium on Automata, Languages and Programming. Vol. 3142 of Lecture Notes in Computer Science, Springer, pp. 208-221.
7. Bollobás, B. and Riordan, O. (2003) Mathematical results on scale-free random graphs. In Handbook of Graphs and Networks, Wiley-VCH, Weinheim, pp. 1-34.
8. Bollobás, B., Borgs, C., Chayes, J. T. and Riordan, O. (2003) Directed scale-free graphs. In Proc. 14th ACM-SIAM Symposium on Discrete Algorithms, pp. 132-139.
9. Bollobás, B., Riordan, O., Spencer, J. and Tusnady, G. E. (2001) The degree sequence of a scale-free random graph process. Random Struct. Alg. 18 279-290.
10. Carlson, J. M. and Doyle, J. (1999) Highly optimized tolerance: a mechanism for power laws in designed systems. Phys. Rev. E 60 1412.
11. Cooper, C. and Frieze, A. M. (2001) A general model of web graphs. In Proc. 9th European Symposium on Algorithms, pp. 500-511.
12. Dorogovtsev, S. N. and Mendes, J. F. F. (2002) Evolution of networks. Adv. Phys. 51 1079.
13. Eggenberger, F. and Pólya, G. (1923) Über die statistik verketteter Vorgänge. Z. Agnew. Math. Mech. 3 279-289.
14. Fabrikant, A., Koutsoupias, E. and Papadimitriou, C. H. (2002) Heuristically optimized trade-offs: a new paradigm for power laws in the internet. In Proc. 29th International Colloquium on Automata, Languages and Programming, Vol. 2380 of Lecture Notes in Computer Science, Springer, pp. 110-122.
15. Faloutsos, M., Faloutsos, P. and Faloutsos, C. (1999) On the power-law relationships of the Internet topology. Comput. Commun. Rev. 29 251.
16. Govindan, R. and Tangmunarunkit, H. (2000) Heuristics for Internet map discovery. In Proc. INFOCOM, pp. 1371-1380.
17. Kenyon, C. and Schabanel, N. Personal communication.
18. Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A. and Upfal, E. (2000) Stochastic models for the web graph. In Proc. 41st IEEE Symp. on Foundations of Computer Science, pp. 57-65.
19. Newman, M. E. J. (2003) The structure and function of complex networks. SIAM Review 45 167-256.
20. Price, D. J. de S. (1976) A general theory of bibliometric and other cumulative advantage processes. J. Amer. Soc. Inform. Sci. 27 292-306.
21. Simon, H. A. (1955) On a class of skew distribution functions. Biometrika 42 425-440.
22. Yule, G. U. (1924) A mathematical theory of evolution, based on the conclusions of Dr. J. C. Willis. Philos. Trans. Roy. Soc. London, Ser. B 213 21-87.
23. Zipf, G. K. (1949) Human Behavior and the Principle of Least Effort, Addison-Wesley, Cambridge, MA.