A central limit theorem for decomposable random variables with applications to random graphs

DOI10.1016/0095-8956(89)90014-2zbMath0689.05042OpenAlexW1968989096MaRDI QIDQ1264157

Michał Karoński, Andrzej Ruciński, Andrew David Barbour

Publication date: 1989

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(89)90014-2

zbMATH Keywords

rate of convergence normal approximation subgraph counts Bernoulli graphs decomposable random variables degree counts

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80)

Related Items

Testing for Balance in Social Networks, Proportional graphs, KOLMOGOROV BOUNDS FOR THE NORMAL APPROXIMATION OF THE NUMBER OF TRIANGLES IN THE ERDŐS–RÉNYI RANDOM GRAPH, On normal approximation rates for certain sums of dependent random variables, Wasserstein-2 bounds in normal approximation under local dependence, Berry-Esseen bounds for functionals of independent random variables, Probabilistic construction of proportional graphs, Moderate deviations via cumulants, Upper tails via high moments and entropic stability, How unproportional must a graph be?, On coupling constructions and rates in the CLT for dependent summands with applications to the antivoter model and weighted \(U\)-statistics, Normal approximation for generalizedU-statistics and weighted random graphs, A refined Cramér-type moderate deviation for sums of local statistics, Corrigendum to: ``On the limiting distribution of the metric dimension for random forests, Rates of convergence for multivariate normal approximation with applications to dense graphs and doubly indexed permutation statistics, Discretized normal approximation by Stein's method, Local limit theorems for occupancy models, Asymptotic for the cumulative distribution function of the degrees and homomorphism densities for random graphs sampled from a graphon, Asymptotic normality for -dependent and constrained -statistics, with applications to pattern matching in random strings and permutations, A limit theorem for small cliques in inhomogeneous random graphs, The number of triangles in random intersection graphs, Fluctuations of subgraph counts in graphon based random graphs, Stein's method for conditional central limit theorem, Kolmogorov bounds for decomposable random variables and subgraph counting by the Stein-Tikhomirov method, Wasserstein-\(p\) bounds in the central limit theorem under local dependence, Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph, A simplified second-order Gaussian Poincaré inequality in discrete setting with applications, From \(p\)-Wasserstein bounds to moderate deviations, Local limit theorems for subgraph counts, On Edgeworth expansions for dependency-neighborhoods chain structures and Stein's method, Fundamentals of Stein's method, A Berry-Esseen bound with applications to vertex degree counts in the Erdős-Rényi random graph, Local Limit Theorems for the Giant Component of Random Hypergraphs, Stein's method in high dimensions with applications, On the number of isolated vertices in a growing random graph, Concentration of measure for the number of isolated vertices in the Erdős-Rényi random graph by size bias couplings, Mod-ϕ Convergence, II: Estimates on the Speed of Convergence, Asymptotic normality in random graphs with given vertex degrees, Asymptotic normality of the \(k\)-core in random graphs, Moderate deviations of subgraph counts in the Erdős-Rényi random graphs 𝐺(𝑛,𝑚) and 𝐺(𝑛,𝑝), Normal approximation for random sums, Central limit theorems in the configuration model, Error bounds in local limit theorems using Stein's method, Deterministic Edge Weights in Increasing Tree Families, A multivariate CLT for bounded decomposable random vectors with the best known rate, Monotonicity, asymptotic normality and vertex degrees in random graphs, Bounded size biased couplings, log concave distributions and concentration of measure for occupancy models, A local central limit theorem for triangles in a random graph, CLT-related large deviation bounds based on Stein's method, The early evolution of the \(H\)-free process, Approximation of the difference of two Poisson-like counts by Skellam, Normal approximation for sums of weighted \(U\)-statistics -- application to Kolmogorov bounds in random subgraph counting, Limit theorems for topological invariants of the dynamic multi-parameter simplicial complex, Anti-concentration for subgraph counts in random graphs, A graph Fourier transform and proportional graphs, Combinatorial anti-concentration inequalities, with applications, Fixed point characterizations of continuous univariate probability distributions and their applications, Analysis of Statistics for Generalized Stirling Permutations, Higher-order fluctuations in dense random graph models, Small variance of subgraph counts in a random tournament, Berry-Esseen bounds for generalized \(U\)-statistics, Local limit theorems via Landau-Kolmogorov inequalities, On the limiting distribution of the metric dimension for random forests, The asymptotic distributions of generalized U-statistics with applications to random graphs

Cites Work