RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Diskr. Mat., 2019, Volume 31, Issue 2, Pages 114–122 (Mi dm1573)  

On connectivity of configuration graphs

Yu. L. Pavlov

Institute of Applied Mathematical Research of the Karelian Research Centre RAS, Petrozavodsk

Abstract: We consider configuration graphs with vertex degrees being independent identically distributed random variables. The distribution of these variables is unknown except that it imposes only relatively weak constraints on the limit behaviour of the large values of degrees. For the number of vertices tending 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.

Funding Agency Grant Number
Ministry of Science and Higher Education of the Russian Federation


DOI: https://doi.org/10.4213/dm1573

Full text: PDF file (411 kB)
First page: PDF file
References: PDF file   HTML file

UDC: 519.212.2+519.175.4
Received: 13.04.2019

Citation: Yu. L. Pavlov, “On connectivity of configuration graphs”, Diskr. Mat., 31:2 (2019), 114–122

Citation in format AMSBIB
\Bibitem{Pav19}
\by Yu.~L.~Pavlov
\paper On connectivity of configuration graphs
\jour Diskr. Mat.
\yr 2019
\vol 31
\issue 2
\pages 114--122
\mathnet{http://mi.mathnet.ru/dm1573}
\crossref{https://doi.org/10.4213/dm1573}
\elib{http://elibrary.ru/item.asp?id=37652132}


Linking options:
  • http://mi.mathnet.ru/eng/dm1573
  • https://doi.org/10.4213/dm1573
  • http://mi.mathnet.ru/eng/dm/v31/i2/p114

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Дискретная математика
    Number of views:
    This page:131
    References:25
    First page:24

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020