Conditional configuration graphs with discrete power-law distribution of vertex degrees

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 de...

Full description

Saved in:
Bibliographic Details
Published in:Sbornik. Mathematics 2018-02, Vol.209 (2), p.258-275
Main Author: Pavlov, Yu. L.
Format: Article
Language:English
Subjects:
Apexes
Asymptotic properties
conditional random graph
configuration graphs
Configurations
Constraining
generalized allocation scheme
Graph theory
Graphs
Independent variables
limit theorem
Power law
Random variables
vertex degree
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1064-5616
1468-4802
DOI:10.1070/SM8832