RUS  ENG
Full version
JOURNALS // Teoriya Veroyatnostei i ee Primeneniya // Archive

Teor. Veroyatnost. i Primenen., 2021 Volume 66, Issue 3, Pages 468–486 (Mi tvp5332)

This article is cited in 1 paper

Limit distributions of the number of vertices of a given degree in a configuration graph with bounded number of edges

Yu. L. Pavlov, I. A. Cheplyukova

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

Abstract: We consider the model of an $N$-vertex configuration graph where the number of edges is at most $n$ and the degrees of vertices are independent and identically distributed (i.i.d.) random variables (r.v.'s). The distribution of the r.v. $\xi$, which is defined as the degree of any given vertex, is assumed to satisfy the condition $p_k=\mathbf{P}\{\xi=k\}\sim\frac{L}{k^g\ln^h k}$ as $k\to\infty$, where $L>0$, $g>1$, $h\ge0$. Limit theorems for the number of vertices of a given degree as $N, n\to\infty$ are proved.

Keywords: configuration graph, degree of a vertex, limit distribution.

Received: 28.06.2019
Revised: 17.02.2020
Accepted: 25.02.2020

DOI: 10.4213/tvp5332


 English version:
Theory of Probability and its Applications, 2021, 66:3, 376–390

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025