When are small subgraphs of a random graph normally distributed?

Recommendations

scientific article; zbMATH DE number 747034
Upper tails for subgraph counts in random graphs
Subgraph counts in random graphs using incomplete U-statistics methods
Distribution of subgraphs of random regular graphs
A functional limit theorem for random graphs with applications to subgraph count statistics

Cites work

scientific article; zbMATH DE number 3889584 (Why is no real title available?)
scientific article; zbMATH DE number 4041966 (Why is no real title available?)
scientific article; zbMATH DE number 4087713 (Why is no real title available?)
scientific article; zbMATH DE number 3620754 (Why is no real title available?)
Every graph is contained in a sparsest possible balanced graph
On random simplices in product distributions
Poisson convergence and random graphs
Strongly balanced graphs and random graphs
Subgraph counts in random graphs using incomplete U-statistics methods

Cited in

(77)

Deviation probabilities for arithmetic progressions and other regular discrete structures
Normal approximation of subgraph counts in the random-connection model
Triangles and subgraph probabilities in random regular graphs
Local limit theorems for subgraph counts
scientific article; zbMATH DE number 7763253 (Why is no real title available?)
scientific article; zbMATH DE number 2127720 (Why is no real title available?)
On the concentration of the chromatic number of random graphs
A limit theorem for small cliques in inhomogeneous random graphs
Asymptotic linearity of binomial random hypergraphs via cluster expansion under graph-dependence
Asymptotic for the cumulative distribution function of the degrees and homomorphism densities for random graphs sampled from a graphon
A simplified second-order Gaussian Poincaré inequality in discrete setting with applications
Moderate deviations for functionals over infinitely many Rademacher random variables
The upper tail problem for induced 4‐cycles in sparse random graphs
When is a scale-free graph ultra-small?
Encoding and avoiding 2-connected patterns in polygon dissections and outerplanar graphs
The number of perfect matchings, and the nesting properties, of random regular graphs
The Distribution of Patterns in Random Trees
Picker-chooser fixed graph games
Local limit theorems via Landau-Kolmogorov inequalities
Normal approximation for sums of weighted \(U\)-statistics -- application to Kolmogorov bounds in random subgraph counting
On the missing log in upper tail estimates
Central limit theorems for patterns in multiset permutations and set partitions
A large deviation result on the number of small subgraphs of a random graph
A local central limit theorem for triangles in a random graph
Fundamentals of Stein's method
Anti-concentration for subgraph counts in random graphs
The deletion method for upper tail estimates
The number of triangles in random intersection graphs
Upper tail bounds for stars
Induced subgraphs in sparse random graphs with given degree sequences
Weighted dependency graphs
The missing log in large deviations for triangle counts
Threshold functions for small subgraphs: an analytic approach
Fluctuations of subgraph counts in graphon based random graphs
Normal approximation for generalized \(U\)-statistics and weighted random graphs
Limiting distribution of short cycles in inhomogeneous random uniform hypergraph
Normal limiting distributions for systems of linear equations in random sets
Central limit theorem for statistics of subcritical configuration models
The lower tail: Poisson approximation revisited
Upper tails via high moments and entropic stability
Asymptotic normality of subcubes in random subgraphs of the \(n\)-cube
Concentration of non‐Lipschitz functions and applications
Logarithmic Sobolev inequalities for finite spin systems and applications
On the number of subgraphs of a specified form embedded in a random graph
On the number of induced subgraphs of a random graph
A functional limit theorem for random graphs with applications to subgraph count statistics
Distribution of the number of spanning regular subgraphs in random graphs
Variance of the subgraph count for sparse Erdős-Rényi graphs
Testing for Equivalence of Network Distribution Using Subgraph Counts
Upper tails for subgraph counts in random graphs
A transition of limiting distributions of large matchings in random graphs
Unions of random trees and applications
On the number of weakly connected subdigraphs in random \(k\)NN digraphs
Bivariate fluctuations for the number of arithmetic progressions in random sets
The probability of non-existence of a subgraph in a moderately sparse random graph
Subgraph counts in random graphs using incomplete U-statistics methods
Law of the iterated logarithm for random graphs
Convex hulls of dense balanced graphs
Threshold functions for small subgraphs in simple graphs and multigraphs
Moderate deviations via cumulants
Exponential inequalities for the number of subgraphs in the Erdös-Rényi random graph
On tree census and the giant component in sparse random graphs
A concentration result with application to subgraph count
Central limit theorems in the configuration model
Approximating stationary distributions of fast mixing Glauber dynamics, with applications to exponential random graphs
Large cycles in random generalized Johnson graphs
KOLMOGOROV BOUNDS FOR THE NORMAL APPROXIMATION OF THE NUMBER OF TRIANGLES IN THE ERDŐS–RÉNYI RANDOM GRAPH
The behaviour of (n over \(k,\dots ,k,n-ik)c^ i/i!\) is asymptotically normal
Sub-Gaussian tails for the number of triangles in \(G( n, p)\)
Moderate deviations of subgraph counts in the Erdős-Rényi random graphs \(G(n,m)\) and \(G(n,p)\)
Kolmogorov bounds for decomposable random variables and subgraph counting by the Stein-Tikhomirov method
Stein's method of exchangeable pairs in multivariate functional approximations
Subgraph distributions in dense random regular graphs
Asymptotic distributions in random graphs with applications to social networks
The asymptotic distributions of generalized U-statistics with applications to random graphs
Poisson convergence and semi-induced properties of random graphs
The Numbers of Spanning Trees, Hamilton Cycles and Perfect Matchings in a Random Graph

This page was built for publication: When are small subgraphs of a random graph normally distributed?

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