Abstract
We consider a random graph constructed by the configuration model with the degrees of vertices distributed identically and independently according to the law P(ξ≥k), k = 1, 2, …, with τ ∈ (1, 2). Connections between vertices are then equiprobably formed in compliance with their degrees. This model admits multiple edges and loops. We study the number of loops of a vertex with given degree d and its limiting behavior for different values of d as the number N of vertices grows. Depending on d = d(N), four different limit distributions appear: Poisson distribution, normal distribution, convolution of normal and stable distributions, and stable distribution. We also find the asymptotics of the mean number of loops in the graph.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. A. Bender and E. R. Canfield, “The asymptotic number of labeled graphs with given degree sequences,” J. Comb. Theory, Ser. A 24(3), 296–307 (1978).
B. Bollobás, “A probabilistic proof of an asymptotic formula for the number of labelled regular graphs,” Eur. J. Comb. 1, 311–316 (1980).
M. Faloutsos, P. Faloutsos, and Ch. Faloutsos, “On power-law relationships of the Internet topology,” in SIGCOMM’ 99: Proc. Conf. on Applications, Technologies, Architectures, and Protocols for Computer Communication (ACM, New York, 1999), Comput. Commun. Rev. 29, pp. 251–262.
B. Gnedenko, “Sur la distribution limite du terme maximum d’une série alétorie,” Ann. Math., Ser. 2 44, 423–453 (1943).
R. W. van der Hofstad, G. Hooghiemstra, and D. Znamenski, “Distances in random graphs with finite mean and infinite variance degrees,” Electron. J. Probab. 12, 703–766 (2007).
I. A. Ibragimov and Yu. V. Linnik, Independent and Stationary Sequences of Random Variables (Wolters-Noordhoff, Groningen, 1971).
S. Janson, “The probability that a random multigraph is simple,” Comb. Probab. Comput. 18, 205–225 (2009).
S. Janson, T. Łuczak, and A. Ruciński,, Random Graphs (Wiley, New York, 2000).
M. Molloy and B. Reed, “A critical point for random graphs with a given degree sequence,” Random Struct. Algorithms 6, 161–179 (1995).
M. E. J. Newman, S. H. Strogatz, and D. J. Watts, “Random graphs with arbitrary degree distributions and their applications,” Phys. Rev. E 64, 026118 (2001).
Yu. L. Pavlov, “On power-law random graphs and branching processes,” in Computer Data Analysis and Modeling: Complex Stochastic Data and Systems: Proc. 8th Int. Conf. (Belarus. State Univ., Minsk, 2007), Vol. 1, pp. 92–98.
H. Reittu and I. Norros, “On the power-law random graph model of massive data networks,” Perform. Eval. 55, 3–23 (2004).
B. A. Sevastyanov, Branching Processes (Nauka, Moscow, 1971) [in Russian].
M. Stepanov, “On the loop number of a node of random graph ‘Internet-type’,” in Optimal Stopping and Stochastic Control: Abstr. Int. Workshop, Petrozavodsk, 2005 (Petrozavodsk, 2005), p. 65.
Author information
Authors and Affiliations
Corresponding author
Additional information
Published in Russian in Trudy Matematicheskogo Instituta imeni V.A. Steklova, 2013, Vol. 282, pp. 212–230.
Rights and permissions
About this article
Cite this article
Pavlov, Y.L., Stepanov, M.M. Limit distributions of the number of loops in a random configuration graph. Proc. Steklov Inst. Math. 282, 202–219 (2013). https://doi.org/10.1134/S0081543813060175
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0081543813060175