The lower tail: Poisson approximation revisited
From MaRDI portal
Abstract: The well-known "Janson's inequality" gives Poisson-like upper bounds for the lower tail probability Pr(X le (1-eps)E X) when X is the sum of dependent indicator random variables of a special form. We show that, for large deviations, this inequality is optimal whenever X is approximately Poisson, i.e., when the dependencies are weak. We also present correlation-based approaches that, in certain symmetric applications, yield related conclusions when X is no longer close to Poisson. As an illustration we, e.g., consider subgraph counts in random graphs, and obtain new lower tail estimates, extending earlier work (for the special case eps=1) of Janson, Luczak and Rucinski.
Recommendations
Cites work
- A correlation inequality and a poisson limit theorem for nonoverlapping balanced subgraphs of a random graph
- A large deviation result on the number of small subgraphs of a random graph
- Colorings generated by monotone properties
- Concentration of multivariate polynomials and its applications
- Correlation inequalities on some partially ordered sets
- Counting extensions
- scientific article; zbMATH DE number 3198427 (Why is no real title available?)
- Independent sets in hypergraphs
- New versions of Suen's correlation inequality
- On the upper tail of counts of strictly balanced subgraphs
- Poisson approximation for large deviations
- Poisson convergence and random graphs
- The deletion method for upper tail estimates
- The Janson inequalities for general up-sets
- The large deviation principle for the Erdős-Rényi random graph
- The missing log in large deviations for triangle counts
- Threshold functions for small subgraphs
- Tight upper tail bounds for cliques
- Upper tails for arithmetic progressions in random subsets
- Upper tails for counting objects in randomly induced subhypergraphs and rooted random graphs
- Upper tails for subgraph counts in random graphs
- When are small subgraphs of a random graph normally distributed?
Cited in
(29)- Upper tails for arithmetic progressions in random subsets
- Number of arithmetic progressions in dense random subsets of \(\mathbb{Z}/n\mathbb{Z}\)
- Upper tails via high moments and entropic stability
- Large deviations of subgraph counts for sparse Erdős-Rényi graphs
- Nonlinear large deviation bounds with applications to Wigner matrices and sparse Erdős-Rényi graphs
- On the missing log in upper tail estimates
- Bivariate fluctuations for the number of arithmetic progressions in random sets
- Upper tail bounds for stars
- A general method for lower bounds on fluctuations of random variables
- Moderate deviations of subgraph counts in the Erdős-Rényi random graphs \(G(n,m)\) and \(G(n,p)\)
- Poisson approximation for large deviations
- scientific article; zbMATH DE number 1305474 (Why is no real title available?)
- The Janson inequalities for general up-sets
- A counterexample to the DeMarco-Kahn upper tail conjecture
- On the method of typical bounded differences
- On the lower tail variational problem for random graphs
- Upper tail for homomorphism counts in constrained sparse random graphs
- Deviation probabilities for arithmetic progressions and other regular discrete structures
- Counting extensions revisited
- Moderate deviations in cycle count
- Lower tails via relative entropy
- Deviation probabilities for arithmetic progressions and irregular discrete structures
- Local limit theorems for subgraph counts
- Deviation probabilities for arithmetic progressions and other regular discrete structures
- The clique chromatic number of sparse random graphs
- Moderate deviations of triangle counts in the Erdős-Rényi random graph G (n, m): the lower tail
- Limit theorems for high-dimensional Betti numbers in the multiparameter random simplicial complexes
- Normal approximation for subgraph count in random hypergraphs
- Lower large deviations for geometric functionals
This page was built for publication: The lower tail: Poisson approximation revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2795741)
