Abstract
A process of evolving random graphs is considered where vertices are added to the graph one by one, and edges connecting the new vertex to the old ones are drawn independently, each with probability depending linearly on the degree of the endpoint. In the paper the asymptotic degree distribution and the order of the maxdegree are determined.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A.-L. Barabási and R. Albert, Emergence of scaling in random networks, Science, 286 (1999), 509–512.
C. Cooper and A. Frieze, A general model of web graphs, Random Structures Algorithms, 22 (2003), 311–335.
Zs. Katona and T. F. Móri, A new class of scale free random graphs, Statist. Probab. Lett., 76 (2006), 1603–1606.
L. LeCam, An approximation theorem for the Poisson binomial distribution, Pacific J. Math., 10 (1960), 1181–1197.
T. F. Móri, On random trees, Studia Sci. Math. Hungar., 39 (2002), 143–155.
T. F. Móri, The maximum degree of the Barabási-Albert random tree, Combin. Probab. Comput., 14 (2005), 339–348.
J. Neveu, Discrete-Parameter Martingales, North-Holland (Amsterda, 1975).
M. Shaked and J. G. Shanthikumar, Stochastic Orders and their Applications, Academic Press (San Diego, 1994).
Author information
Authors and Affiliations
Additional information
Research supported by the Hungarian Scientific Research Fund, Grant No. T-43037.
Rights and permissions
About this article
Cite this article
Móri, T.F. On a 2-parameter class of scale free random graphs. Acta Math Hung 114, 37–48 (2007). https://doi.org/10.1007/s10474-006-0511-0
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10474-006-0511-0