Abstract:
A model of a configuration graph on $N$ vertices is considered in which the degrees of the vertices are distributed identically and independently according to the law $\mathbf P\{\xi=k\}=k^{-\tau}-(k+1)^{-\tau}$, $k=1,2,\dots$, $\tau>0$, and the number of edges is no greater than $n$. Limit theorems for the number of vertices of a particular degree and for the maximum vertex degree as $N,n\to\infty$ are established.
Bibliography: 18 titles.
Keywords:configuration graph, limit distribution, the number of vertices of a particular degree, the maximum vertex degree.
Fulltext:
PDF file (556 kB)
