Popularity based random graph models leading to a scale-free degree sequence

Discrete Mathematics

Volumn 282, Issue 1-3, 2004, Pages 53-68

  Buckley, Pierce G ^a   Osthus, Deryk ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

Power law degrees; Random graphs; Scale free degrees; Web graph

Indexed keywords

MATHEMATICAL MODELS; PROBABILITY; PROBLEM SOLVING; SET THEORY; STATISTICAL METHODS; THEOREM PROVING; WORLD WIDE WEB;

POWER LAW DEGREES; RANDOM GRAPHS; SCALE-FREE DEGREES;

GRAPH THEORY;

EID: 2342503759     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2003.10.020     Document Type: Article

References (23)

1. Abramowitz M., Stegun I.A. Handbook of Mathematical Functions. 1965;Dover Publications, New York.
2. Aiello W., Chung F., Lu L. Random evolution in massive graphs. Abello J., et al. Handbook on Massive Data Sets. 2002;Kluwer, Dordrecht.
3. Barabási A.L., Albert R. Emergence of scaling in random networks. Science. 286:1999;509-512.
4. Albert R., Barabási A.L. Statistical mechanics of complex networks. Rev. Modern Phys. 74:2002;47-97.
5. Barabási A.L., Albert R., Jeong H. Mean-field theory for scale-free random networks. Physica A. 272:1999;173-187.
6. Barabási A.L., Albert R., Jeong H. Scale-free characteristics of random networks. the topology of the world wide web Physica A. 281:2000;69-77.
7. H. Bateman, A. Erdélyi, Higher Transcendental Functions, Vol. 1, McGraw-Hill, New York, 1953.
8. Bollobás B., Riordan O. Linearized chord diagrams and an upper bound for Vassiliev invariants. J. Knot Theory Ramifications. 9:2000;847-853.
9. B. Bollobás, O. Riordan, The diameter of a scale-free random graph, Combinatorica, to appear.
10. Bollobás B., Riordan O., Spencer J., Tusnády G. The degree sequence of a scale-free random graph process. Random Struct. Algorithms. 18:2001;279-290.
11. A.Z. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, J. Wiener, Graph structure in the web: experiments and models, Proceedings of the Ninth WWW Conference, 2000, pp. 309-320.
12. Cooper C., Frieze A. A general model for web graphs. Random Struct. Algorithms. 22:2003;311-335.
13. Dorogovtsev S.N., Mendes J.F.F. Evolution of Networks. Adv. Phys. 51:2002;1079-1187.
14. Dorogovtsev S.N., Mendes J.F.F. Evolution of Networks. 2003;Oxford University Press, Oxford.
15. Dorogovtsev S.N., Mendes J.F.F., Samukhin A.N. Structure of growing networks with preferential links. Phys. Rev. Lett. 85:2000;4633-4636.
16. E. Drinea, M. Enachescu, M. Mitzenmacher, Variations on random graph models for the web, Technical Report, Harvard University, Department of Computer Science, 2001.
17. Janson S., Lłuczak T., Ruciński A. Random Graphs. 2000;Wiley-Interscience, New York.
18. J. Kleinberg, R. Kumar, P. Raghavan, S. Rajagopalan, A. Tomkins, The web as a graph: measurements, models and methods, Proceedings of the International Conference on Combinatorics and Computing, 1999, pp. 1-18.
19. Krapivsky P.L., Leyvraz F., Redner S. Connectivity of growing random networks. Phys. Rev. Lett. 85:2000;4629-4632.
20. R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, E. Upfal, Stochastic models for the web graph, Proceedings IEEE Symposium on Foundations of Computer Science, 2000.
21. Motwani R., Raghavan P. Randomized Algorithms. 1995;Cambridge University Press, Cambridge.
22. Szymański J. On a nonuniform random recursive tree. Ann. Discrete Math. 33:1987;297-306.
23. S. Wolfram, Mathematica 4.1, Wolfram Research, 2001.