An estimate for the number of edges between vertices of given degrees in random graphs in the Bollobás—Riordan model

Moscow Journal of Combinatorics and Number Theory

Volumn 1, Issue 2, 2011, Pages 40-73

  Grechnikov, Evgeniy ^a  

^a YANDEX   (Russian Federation)

Author keywords

Bollob s Riordan model; degree distribution; power law; random graphs; scale free graphs; web graphs

Indexed keywords

EID: 84893102953     PISSN: 22205438     EISSN: 26407361     Source Type: Journal    
DOI: None     Document Type: Article

References (10)

1. K.Azuma, Weighted sums of certain dependent variables, Tôhoku Math. J. 19 (1967), 357–367.
2. A.-L.Barabási, R.Albert, Emergence of scaling in random networks, Science 286 (1999), 509–512.
3. B.Bollobás, Random Graphs, Cambridge Univ. Press, Second Edition, 2001.
4. B.Bollobás,O.M.Riordan,Mathematicalresultsonscale-freerandomgraphs, Handbook of graphs and networks, Wiley-VCH, Weinheim, 2003, 1–34.
5. B.Bollobás, O.M.Riordan, The diameter of a scale-free random graph, Combinatorica 24, № 1 (2004), 5–34.
6. B.Bollobás, O.M.Riordan, J.Spencer, G.Tusnády, The degree sequence of a scale-free random graph process, Random Structures Algorithms 18, № 3 (2001), 279–290.
7. R.Durrett, Random graph dynamics, Cambridge, 2007.
8. W.Hoeffding, Probability inequalities for sums of bounded random variables, J. Amer. Statist. Assoc. 58 (1963), 13–30.
9. S.Janson, T. Luczak, A.Ruciński, Random graphs, Wiley, NY, 2000.
10. D.E.Knuth, The art of computer programming. 1: Fundamental algorithms, Third Edition, Addison—Wesley, 1997.