Poisson approximation for cycles in the generalised random graph
From MaRDI portal
Cites work
- Asymptotic equivalence and contiguity of some random graphs
- Counting cliques and cycles in scale-free inhomogeneous random graphs
- Counting triangles in power-law uniform random graphs
- Foundations of modern probability. In 2 volumes
- Fundamentals of Stein's method
- Generating simple random graphs with prescribed degree distribution
- Limit laws for self-loops and multiple edges in the configuration model
- Limit laws for the number of triangles in the generalized random graphs with random node weights
- Loops of any size and Hamilton cycles in random scale-free networks
- Novel scaling limits for critical inhomogeneous random graphs
- On a conditionally Poissonian graph process
- Optimal subgraph structures in scale-free configuration models
- Probability with statistical applications
- Random graphs and complex networks. Volume 1
- Random graphs.
- Random measures, theory and applications
- Rate of convergence to the Poisson law of the numbers of cycles in the generalized random graphs
- Scaling limits for critical inhomogeneous random graphs with finite third moments
- The average distances in random graphs with given expected degrees
- The largest component in a subcritical random graph with a power law degree distribution
- The phase transition in inhomogeneous random graphs
- Two moments suffice for Poisson approximations: The Chen-Stein method
- Universality for the distance in finite variance random graphs
This page was built for publication: Poisson approximation for cycles in the generalised random graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7307004)
