A limit theorem for small cliques in inhomogeneous random graphs

DOI10.1002/jgt.22673zbMath1522.05430arXiv1903.10570MaRDI QIDQ6080866

Jan Hladký, Matas Šileikis, Christos Pelekis

Publication date: 4 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

limit theoremsinhomogeneous random graphssubgraph countsquasirandomnessgraphons

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (2)

Fluctuations of subgraph counts in graphon based random graphs ⋮ Prominent examples of flip processes

Cites Work

• Unnamed Item
• Fundamentals of Stein's method
• Universal limit theorems in graph coloring problems with connections to extremal combinatorics
• 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?
• Subgraph counts in random graphs using incomplete U-statistics methods
• A central limit theorem for decomposable random variables with applications to random graphs
• Higher-order fluctuations in dense random graph models
• Monochromatic subgraphs in randomly colored graphons
• FORCING QUASIRANDOMNESS WITH TRIANGLES
• The diameter of inhomogeneous random graphs
• Graphons, permutons and the Thoma simplex: three mod‐Gaussian moduli spaces
• The phase transition in inhomogeneous random graphs
• Cliques in dense inhomogeneous random graphs
• Local limit theorems for subgraph counts

This page was built for publication: A limit theorem for small cliques in inhomogeneous random graphs