Rate of convergence to the Poisson law of the numbers of cycles in the generalized random graphs

DOI10.1007/978-3-030-76829-4_5MaRDI QIDQ5014516zbMATH OpenOpenAlexFDO

Authors Maria A. Danshina, S. G. Bobkov, V. V. Ulyanov

Publication date 8 December 2021

Published in Operator Theory and Harmonic Analysis (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2101.06431

zbMATH Keywords

rate of convergencecyclesPoisson lawgeneralized random graphs

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30)

Abstract: Convergence of order $O(1/sqrtn)$ is obtained for the distance in total variation between the Poisson distribution and the distribution of the number of fixed size cycles in generalized random graphs with random vertex weights. The weights are assumed to be independent identically distributed random variables which have a power-law distribution. The proof is based on the Chen--Stein approach and on the derived properties of the ratio of the sum of squares of random variables and the sum of these variables. These properties can be applied to other asymptotic problems related to generalized random graphs.

Recommendations

• On the number of cycles in a nonequiprobable random graph
• Poisson convergence of numbers of vertices of a given degree in random graphs
• On the number of cycles in a random non-equiprobable graph
• Limit laws for the number of triangles in the generalized random graphs with random node weights
• scientific article; zbMATH DE number 4082595

Cites work

• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• Asymptotic equivalence and contiguity of some random graphs
• Central limit type theorems in the generalized random graphs with random vertex weights
• Connected components in random graphs with given expected degree sequences
• Divide and conquer martingales and the number of triangles in a random graph
• Generating simple random graphs with prescribed degree distribution
• Limit laws for the number of triangles in the generalized random graphs with random node weights
• Novel scaling limits for critical inhomogeneous random graphs
• On a conditionally Poissonian graph process
• Poisson approximation and the Chen-Stein method. With comments and a rejoinder by the authors
• Random Graphs
• Random graphs and complex networks. Volume 1
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension
• The Volume of the Giant Component of a Random Graph with Given Expected Degrees
• The phase transition in inhomogeneous random graphs
• Two moments suffice for Poisson approximations: The Chen-Stein method
• Upper tails for subgraph counts in random graphs
• Upper tails for triangles

Cited in

(2)

• scientific article; zbMATH DE number 7763253 (Why is no real title available?)
• Exponential inequalities for the number of subgraphs in the Erdös-Rényi random graph

This page was built for publication: Rate of convergence to the Poisson law of the numbers of cycles in the generalized random graphs

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