Abstract
We consider configuration graphs with N vertices. The degrees of the vertices are independent random variables identically distributed according to the power law, with a positive parameter τ . They are equal to the number of vertex semiedges that are numbered in an arbitrary order. The graph is constructed by joining all of the semiedges pairwise equiprobably to form edges. We study the subset of such random graphs under the condition that the sum of vertex degrees is known and it is equal to n. Let τ be a random variable following a truncated normal distribution on an arbitrary fixed finite interval. We obtained the limit distributions of the maximum vertex degree and the number of vertices with a given degree for various zones of N and n tendency to infinity.
Highlights
We consider configuration graphs with N vertices
The degrees of the vertices are independent random variables identically distributed according to the power law, with a positive parameter τ
We study the subset of such random graphs under the condition that the sum of vertex degrees is known and it is equal to n
Summary
We consider configuration graphs with N vertices. The degrees of the vertices are independent random variables identically distributed according to the power law, with a positive parameter τ. В таких моделях предполагается, что степени вершин являются независимыми одинаково распределенными случайными величинами. В [9] впервые рассматривались условные конфигурационные графы при условии, что число ребер известно. В работе рассматриваются условные конфигурационные графы с N вершинами, при условии, что сумма степеней вершин равна n, сами степени являются независимыми случайными величинами, имеющими общее распределение (1), где случайный параметр τ подчиняется усеченному нормальному закону, заданному на интервале [a, b], 0 < a < b < ∞ и имеющему параметры (2) и (3).
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Proceedings of the Karelian Research Centre of the Russian Academy of Sciences
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
