Poisson approximation for large deviations
From MaRDI portal
Publication:3977078
Recommendations
Cites work
Cited in
(94)- On the concentration of multivariate polynomials with small expectation
- Upper tails for subgraph counts in random graphs
- Upper tails via high moments and entropic stability
- Subhypergraph counts in extremal and random hypergraphs and the fractional \(q\)-independence
- On the lower tail variational problem for random graphs
- A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem
- Concentration and moment inequalities for polynomials of independent random variables
- The discrepancy of the lex-least de Bruijn sequence
- The covering threshold of a directed acyclic graph by directed acyclic subgraphs
- Random polynomial graphs for random Turán problems
- Compound Poisson approximation: A user's guide
- Combinatorial theorems in sparse random sets
- Counting extensions revisited
- The lower tail: Poisson approximation revisited
- On the cycle space of a random graph
- Geography of local configurations
- An improved upper bound on the density of universal random graphs
- An efficient container lemma
- On Sidon sets and asymptotic bases
- Higher order corrections for anisotropic bootstrap percolation
- Moderate deviations via cumulants
- Threshold Functions for H-factors
- The missing log in large deviations for triangle counts
- Vertex Ramsey properties of randomly perturbed graphs
- Ramsey properties of random discrete structures
- Monotone circuit lower bounds from robust sunflowers
- Concentration for Poisson \(U\)-statistics: subgraph counts in random geometric graphs
- Tight upper tail bounds for cliques
- On a refinement of Waring's problem
- A concentration result with application to subgraph count
- Rainbow thresholds
- Spanners in randomly weighted graphs: Euclidean case
- Schur properties of randomly perturbed sets
- On the benefits of adaptivity in property testing of dense graphs
- Representations of integers as the sum of k terms
- Concentration of measure and isoperimetric inequalities in product spaces
- On limits of sparse random graphs
- On the missing log in upper tail estimates
- A robust Corrádi-Hajnal theorem
- Optimal inter-object correlation when replicating for availability
- On the \(\mathrm{AC}^0\) complexity of subgraph isomorphism
- Random graphs with monochromatic triangles in every edge coloring
- Local connectivity of neutral networks
- Moment inequalities for functions of independent random variables
- Beating treewidth for average-case subgraph isomorphism
- scientific article; zbMATH DE number 1112658 (Why is no real title available?)
- The infamous upper tail
- Online vertex-coloring games in random graphs
- A counterexample to the DeMarco-Kahn upper tail conjecture
- Bounding Ramsey numbers through large deviation inequalities
- On the method of typical bounded differences
- On the concentration of the chromatic number of random graphs
- Moderate deviations in cycle count
- A sharp threshold for a modified bootstrap percolation with recovery
- Explicit two-source extractors and resilient functions
- Generating random networks without short cycles
- On the probability of nonexistence in binomial subsets
- Upper tails for arithmetic progressions in random subsets
- On the typical structure of graphs not containing a fixed vertex-critical subgraph
- Formulas versus Circuits for Small Distance Connectivity
- Upper tail bounds for stars
- \(H(n)\)-factors in random graphs
- On Sidon sets which are asymptotic bases
- Asymptotic linearity of binomial random hypergraphs via cluster expansion under graph-dependence
- The Janson inequalities for general up-sets
- For most graphs H, most H-free graphs have a linear homogeneous set
- A zero‐one law for a random subset
- Maximum antichains in random subsets of a finite set
- The effect of adding randomly weighted edges
- On \(K^ 4\)-free subgraphs of random graphs
- The power of many colours
- Lower large deviations for geometric functionals
- Optimal explicit small-depth formulas for the coin problem
- Large Deviations of Poisson Cluster Processes
- When Janson meets McDiarmid: Bounded difference inequalities under graph-dependence
- Random Van der Waerden theorem
- Lower tails via relative entropy
- Upper tail bounds for cycles
- Small Submatroids in Random Matroids
- Large deviations for integer centered Poisson approximation
- On the chromatic number in the stochastic block model
- Approximation durch Poissonsche Prozesse
- When does the \(K_{4}\)-free process stop?
- scientific article; zbMATH DE number 434651 (Why is no real title available?)
- Approximation algorithms for the covering Steiner problem
- Ramsey properties of random hypergraphs
- Concentration for noncommutative polynomials in random matrices
- CLT-related large deviation bounds based on Stein's method
- Large deviations by Poisson approximations
- Upper bounds on probability thresholds for asymmetric Ramsey properties
- Optimal stopping for many connected components in a graph
- A sharp threshold for bootstrap percolation in a random hypergraph
- Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution
- Poisson approximation for non-backtracking random walks
This page was built for publication: Poisson approximation for large deviations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3977078)
