Conditional configuration graphs with discrete power-law distribution of vertex degrees
Yu. L. Pavlov
Institute of Applied Mathematical Research of the Karelian Research Centre RAS, Petrozavodsk
The paper is concerned with configuration graphs with discrete power-law distribution of vertex degrees. The parameter of this distribution is a random variable, which is unknown except that it imposes relatively weak constraints on the asymptotic behaviour of the probabilities of large values of degrees. For such graphs with the known number of edges, we find the limiting distributions of the maximal degree of a vertex and of the number of vertices of a given degree for various laws of convergence to infinity of the numbers of vertices and edges. The results in the present paper, which are proved using the generalized scheme of allocation of particles to cells, demonstrate the potency of this method in the case of independent random variables with known limiting behaviour of the tail of the distribution.
Bibliography: 13 titles.
configuration graphs, vertex degree, limit theorem, conditional random graph, generalized allocation scheme.
|Russian Foundation for Basic Research
|This research was carried out with the financial support of the Russian Foundation for Basic Research (grant no. 16-01-00005-a).
PDF file (642 kB)
First page: PDF file
Sbornik: Mathematics, 2018, 209:2, 258–275
Yu. L. Pavlov, “Conditional configuration graphs with discrete power-law distribution of vertex degrees”, Mat. Sb., 209:2 (2018), 120–137; Sb. Math., 209:2 (2018), 258–275
Citation in format AMSBIB
\paper Conditional configuration graphs with discrete power-law distribution of vertex degrees
\jour Mat. Sb.
\jour Sb. Math.
Citing articles on Google Scholar:
Related articles on Google Scholar:
|Number of views:|