Concentration of measure for the number of isolated vertices in the Erdős-Rényi random graph by size bias couplings

DOI10.1016/j.spl.2011.06.002zbMath1226.05227arXiv1106.0048MaRDI QIDQ643216

Subhankar Ghosh, Martin Raič, Larry Goldstein

Publication date: 28 October 2011

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

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

zbMATH Keywords

large deviations; size biased couplings; graph degree

Mathematics Subject Classification ID

60E15: Inequalities; stochastic orderings

05C80: Random graphs (graph-theoretic aspects)

60C05: Combinatorial probability

Related Items

Size biased couplings and the spectral gap for random regular graphs, Bounded size biased couplings, log concave distributions and concentration of measure for occupancy models, Central moment inequalities using Stein's method, Weighted Poincaré inequalities, concentration inequalities and tail bounds related to Stein kernels in dimension one

Cites Work

• Applications of size biased couplings for concentration of measures
• Concentration of measures via size-biased couplings
• Normal approximation for coverage models over binomial point processes
• A central limit theorem for decomposable random variables with applications to random graphs
• Some large deviation results for sparse random graphs
• On the number of vertices of given degree in a random graph
• Poisson convergence and semi-induced properties of random graphs
• Poisson convergence and random graphs
• Multivariate normal approximations by Stein's method and size bias couplings
• CLT-related large deviation bounds based on Stein's method
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item