On the asymptotics of degree structure of configuration graphs with bounded number of edges

DOI10.1515/DMA-2019-0020zbMATH Open1426.05151OpenAlexW2967829007MaRDI QIDQ2332854

Yuriy L. Pavlov, I. A. Cheplyukova

Publication date: 5 November 2019

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

Full work available at URL: https://doi.org/10.1515/dma-2019-0020

zbMATH Keywords

limit distributionvertex degreeconfiguration graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• On the limit distributions of the degrees of vertices in configuration graphs with a bounded number of edges
• On conditional Internet graphs whose vertex degrees have no mathematical expectation
• Random graphs of Internet type and the generalised allocation scheme
• On the limit distributions of the vertex degrees of conditional Internet graphs
• An analogue of the generalised allocation scheme: limit theorems for the number of cells containing a given number of particles

Related Items (1)

On the limit distributions of the degrees of vertices in configuration graphs with a bounded number of edges

This page was built for publication: On the asymptotics of degree structure of configuration graphs with bounded number of edges