Geodesic
On the connectivity of configuration graphs
Diskretnaya Matematika, Tome 31 (2019) no. 2, pp. 114-122

Voir la notice de l'article provenant de la source Math-Net.Ru

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.
Keywords: configuration graph, random vertex degrees, graph connectivity. 
@article{DM_2019_31_2_a8,
     author = {Yu. L. Pavlov},
     title = {On the connectivity of configuration graphs},
     journal = {Diskretnaya Matematika},
     pages = {114--122},
     publisher = {mathdoc},
     volume = {31},
     number = {2},
     year = {2019},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2019_31_2_a8/}
}
TY  - JOUR
AU  - Yu. L. Pavlov
TI  - On the connectivity of configuration graphs
JO  - Diskretnaya Matematika
PY  - 2019
SP  - 114
EP  - 122
VL  - 31
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2019_31_2_a8/
LA  - ru
ID  - DM_2019_31_2_a8
ER  - 
%0 Journal Article
%A Yu. L. Pavlov
%T On the connectivity of configuration graphs
%J Diskretnaya Matematika
%D 2019
%P 114-122
%V 31
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2019_31_2_a8/
%G ru
%F DM_2019_31_2_a8
Yu. L. Pavlov. On the connectivity of configuration graphs. Diskretnaya Matematika, Tome 31 (2019) no. 2, pp. 114-122. http://geodesic.mathdoc.fr/item/DM_2019_31_2_a8/