Stein's method for concentration inequalities

DOI10.1007/s00440-006-0029-yzbMath1116.60056arXivmath/0604352OpenAlexW2077532179MaRDI QIDQ2369871

Sourav Chatterjee

Publication date: 21 June 2007

Published in: Probability Theory and Related Fields (Search for Journal in Brave)

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

zbMATH Keywords

Stein's methodIsing modelGibbs measuresCurie-Weiss modelRandom permutationsConcentration inequalities

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Interacting particle systems in time-dependent statistical mechanics (82C22) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05)

Related Items

Minimax optimality of permutation tests ⋮ Noise sensitivity for the top eigenvector of a sparse random matrix ⋮ A note on concentration for polynomials in the Ising model ⋮ Modified log-Sobolev inequalities and two-level concentration ⋮ A threshold for cutoff in two-community random graphs ⋮ A refined Cramér-type moderate deviation for sums of local statistics ⋮ Applications of Stein's method for concentration inequalities ⋮ Random walk on sparse random digraphs ⋮ Differential privacy in constant function market makers ⋮ Discrepancy properties for random regular digraphs ⋮ Concentration inequalities using approximate zero bias couplings with applications to Hoeffding’s statistic under the Ewens distribution ⋮ Stein's method for conditional central limit theorem ⋮ On concentration inequalities and their applications for Gibbs measures in lattice systems ⋮ Detecting structured signals in Ising models ⋮ Metastable mixing of Markov chains: efficiently sampling low temperature exponential random graphs ⋮ Stein's method for nonlinear statistics: a brief survey and recent progress ⋮ From Stein identities to moderate deviations ⋮ Cutoff for permuted Markov chains ⋮ From \(p\)-Wasserstein bounds to moderate deviations ⋮ Rankings in directed configuration models with heavy tailed in-degrees ⋮ Central moment inequalities using Stein's method ⋮ Fundamentals of Stein's method ⋮ Unnamed Item ⋮ Diffusion limits of the random walk Metropolis algorithm in high dimensions ⋮ Stationary distribution and cover time of sparse directed configuration models ⋮ Comparing a large number of multivariate distributions ⋮ Stein’s method of normal approximation for dynamical systems ⋮ Matrix concentration inequalities via the method of exchangeable pairs ⋮ Concentration inequalities via zero bias couplings ⋮ Rigorous solution of strongly coupled \(SO(N)\) lattice gauge theory in the large \(N\) limit ⋮ On the mean-field equations for ferromagnetic spin systems ⋮ A new method of normal approximation ⋮ Bounded size bias coupling: a gamma function bound, and universal Dickman-function behavior ⋮ Approximation of stable law in Wasserstein-1 distance by Stein's method ⋮ Error bounds in local limit theorems using Stein's method ⋮ Estimation in spin glasses: a first step ⋮ Bayesian model selection for high-dimensional Ising models, with applications to educational data ⋮ On the singularity of adjacency matrices for random regular digraphs ⋮ 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 ⋮ Exchangeable pairs, switchings, and random regular graphs ⋮ Isomorphic edge disjoint subgraphs of hypergraphs ⋮ A Bernstein type inequality for sums of selections from three dimensional arrays ⋮ Concentration of measures via size-biased couplings ⋮ Mixing time trichotomy in regenerating dynamic digraphs ⋮ Approximating stationary distributions of fast mixing Glauber dynamics, with applications to exponential random graphs ⋮ Stein's Lemma, Malliavin calculus, and tail bounds, with application to polymer fluctuation exponent ⋮ From Poincaré inequalities to nonlinear matrix concentration ⋮ The circular law for random regular digraphs ⋮ Global testing against sparse alternatives under Ising models ⋮ Detection of sparse positive dependence ⋮ Commutation relations and Markov chains ⋮ An introduction to large deviations for random graphs ⋮ Product mixing in the alternating group ⋮ Modified log-Sobolev inequalities, Beckner inequalities and moment estimates ⋮ Weighted Poincaré inequalities, concentration inequalities and tail bounds related to Stein kernels in dimension one ⋮ Deterministic construction of sparse binary matrices via incremental integer optimization ⋮ Noise sensitivity of the top eigenvector of a Wigner matrix ⋮ Berry-Esseen bounds for generalized \(U\)-statistics ⋮ Stein's method, logarithmic Sobolev and transport inequalities ⋮ Arcsine laws for random walks generated from random permutations with applications to genomics ⋮ Local limit theorems via Landau-Kolmogorov inequalities ⋮ Cramér-type moderate deviation of normal approximation for unbounded exchangeable pairs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On normal approximations of distributions in terms of dependency graphs
• Concentration inequalities for random fields via coupling
• Exchangeable pairs and Poisson approximation
• Stein's method for diffusion approximations
• Two moments suffice for Poisson approximations: The Chen-Stein method
• Distribution function inequalities for martingales
• Poisson approximation for dependent trials
• The rate of convergence for multivariate sampling statistics
• Stein's method and the zero bias transformation with application to simple random sampling
• On coupling constructions and rates in the CLT for dependent summands with applications to the antivoter model and weighted \(U\)-statistics
• Concentration inequalities using the entropy method
• Poisson approximation and the Chen-Stein method. With comments and a rejoinder by the authors
• Concentration for locally acting permutations
• Concentration of measure and isoperimetric inequalities in product spaces
• Polynomial-Time Approximation Algorithms for the Ising Model
• Concentration for Independent Permutations
• The Berry-Esseen bound for character ratios
• An estimate of the remainder in a combinatorial central limit theorem
• Inference for Discrete Markov Fields: The Simplest Nontrivial Case
• Divide and conquer martingales and the number of triangles in a random graph
• Stein’s method and Plancherel measure of the symmetric group
• Probability Inequalities for Sums of Bounded Random Variables
• CLT-related large deviation bounds based on Stein's method
• A Combinatorial Central Limit Theorem