On the asymptotics of degree structure of configuration graphs with bounded number of edges
From MaRDI portal
Publication:2332854
DOI10.1515/dma-2019-0020zbMath1426.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
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the asymptotics of degree structure of configuration graphs with bounded number of edges