On a characteristic of a conditional distribution of configuration graph

DOI10.1515/DMA-2025-0022MaRDI QIDQ6854951zbMATH OpenFDO

Authors I. A. Cheplyukova

Publication date 23 February 2026

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/DMA-2025-0022

zbMATH Keywords

configuration graphlimit distributionvertex degree

Mathematics Subject Classification ID

Vertex degrees (05C07) Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Combinatorial probability (60C05) Central limit and other weak theorems (60F05)

Cites work

• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• An analogue of the generalised allocation scheme: limit theorems for the number of cells containing a given number of particles
• Conditional configuration graphs with discrete power-law distribution of vertex degrees
• Limit distributions of the number of vertices of a given degree in a configuration graph with bounded number of edges
• On the asymptotics of degree structure of configuration graphs with bounded number of edges
• On the limit distributions of the degrees of vertices in configuration graphs with a bounded number of edges
• One-sided local large deviation and renewal theorems in the case of infinite mean
• Random graph dynamics
• Random graphs and complex networks. Volume 1
• Random graphs of Internet type and the generalised allocation scheme

This page was built for publication: On a characteristic of a conditional distribution of configuration graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6854951)