Fluctuations of subgraph counts in graphon based random graphs

DOI10.1017/s0963548322000335zbMath1527.05155arXiv2104.07259MaRDI QIDQ6091052

Anirban Chatterjee, Bhaswar B. Bhattacharya, Svante Janson

Publication date: 23 November 2023

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

limit theoremsinhomogeneous random graphssubgraph countsgraphonsgeneralised \(U\)-statistics

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
• Universal limit theorems in graph coloring problems with connections to extremal combinatorics
• The large deviation principle for the Erdős-Rényi random graph
• The asymptotic distributions of generalized U-statistics with applications to random graphs
• Limits of dense graph sequences
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• When are small subgraphs of a random graph normally distributed?
• Asymptotic normality of graph statistics
• Subgraph counts in random graphs using incomplete U-statistics methods
• On the statistics of vision: The Julesz conjecture
• A central limit theorem for decomposable random variables with applications to random graphs
• Higher-order fluctuations in dense random graph models
• Berry-Esseen bounds for generalized \(U\)-statistics
• Limit theorems for distributions invariant under groups of transformations
• Monochromatic subgraphs in randomly colored graphons
• Universality of the mean-field for the Potts model
• Estimating and understanding exponential random graph models
• A functional limit theorem for random graphs with applications to subgraph count statistics
• Orthogonal decompositions and functional limit theorems for random graph statistics
• Gaussian Hilbert Spaces
• Graphons, permutons and the Thoma simplex: three mod‐Gaussian moduli spaces
• The phase transition in inhomogeneous random graphs
• Asymptotic for the cumulative distribution function of the degrees and homomorphism densities for random graphs sampled from a graphon
• A limit theorem for small cliques in inhomogeneous random graphs