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