The degree distribution and the number of edges between nodes of given degrees in directed scale-free graphs

Built on

W. Hoeffding, Probability inequalities for sums of bounded random variables
Original
1963
Earlier work this paper cites.
M. Abramowitz, I. A. Stegun (editors), Handbook of mathematical functions with formulas, graphs and mathematical tables
1964
Earlier work this paper cites.
K. Azuma, Weighted sums of certain dependent variables
1967
Earlier work this paper cites.
A.-L. Barabási, R. Albert, Emergence of scaling in random networks
1999
Earlier work this paper cites.
S. Janson, T. Łuczak, A. Ruciński, Random graphs
2000
Earlier work this paper cites.

S. N. Dorogovtsev, J. F. F. Mendes, A. N. Samukhin, Structure of growing networks with preferential linking
2000
Cited alongside, same era.
B. Bollobás, Random graphs
2001
Cited alongside, same era.
B. Bollobás, O. M. Riordan, J. Spencer, G. Tusnády, The degree sequence of a scale-free random graph process
2001
Cited alongside, same era.
E. Drinea, M. Enachescu, M. Mitzenmacher, Variations on random graph models for the web
2001
Cited alongside, same era.
C. Cooper, A. Frieze, A general model of web graphs
2003
Cited alongside, same era.

B. Bollobás, C. Borgs, J. Chayes and O. Riordan, Directed scale-free graphs
2003
Later among the works it cites.
P. G. Buckley, D. Osthus, Popularity based random graph models leading to a scale-free degree sequence
2004
Later among the works it cites.
C. Cooper, Distribution of Vertex Degree in Web-Graphs
2006
Later among the works it cites.
E. A. Grechnikov, The degree distribution and the number of edges between vertices of given degrees in the Buckley-Osthus model of a random web graph
2012
Later among the works it cites.