Affiliation:
1. Institute of Applied Mathematical Research of Karelian Research Centre RAS , Petrozavodsk Russia
Abstract
Abstract
We consider configuration graphs with vertex degrees being independent identically distributed random variables. The distribution of these variables satisfies only relatively weak constraints on the probabilities of large values of degrees. For the case when the number of vertices tends to infinity, the conditions are found under which the graph is asymptotically almost surely connected. We also give estimates of the rate of convergence to zero of the probability that the graph is not connected.
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference13 articles.
1. Hofstad R. Random graphs and complex networks. Volume 1. Cambridge Univ. Press, Cambridge, 2017, 321 pp.
2. Faloutsos C., Faloutsos P., Faloutsos M., “On power-law relationships of the Internet topology”, Computer Communications Rev., 29 (1999), 251–262.
3. Bollobas B., “A probabilistic proof of an asymptotic formula for the number of labelled regular graphs”, European J.Combin., 1:4 (1980), 311–316.
4. Reittu H., Norros I., “On the power-law random graph model of massive data networks”, Performance Evaluation, 55:1-2 (2004), 3–23.
5. Durrett R., Random graph dynamics, Cambridge Univ. Press, Cambridge, 2007, 212 pp.