Pages that link to "Item:Q3977078"

The following pages link to Poisson approximation for large deviations (Q3977078):

Displaying 50 items.

• Combinatorial theorems in sparse random sets (Q350550) (← links)
• Moderate deviations via cumulants (Q354766) (← links)
• A sharp threshold for a modified bootstrap percolation with recovery (Q478467) (← links)
• On limits of sparse random graphs (Q510626) (← links)
• On Sidon sets which are asymptotic bases (Q532088) (← links)
• Online vertex-coloring games in random graphs (Q532126) (← links)
• On the benefits of adaptivity in property testing of dense graphs (Q603911) (← links)
• Lower large deviations for geometric functionals (Q782832) (← links)
• Local connectivity of neutral networks (Q841796) (← links)
• \(H(n)\)-factors in random graphs (Q945455) (← links)
• Subhypergraph counts in extremal and random hypergraphs and the fractional \(q\)-independence (Q965817) (← links)
• The discrepancy of the lex-least de Bruijn sequence (Q966010) (← links)
• Geography of local configurations (Q988755) (← links)
• Ramsey properties of random hypergraphs (Q1380335) (← links)
• On \(K^ 4\)-free subgraphs of random graphs (Q1385983) (← links)
• Maximum antichains in random subsets of a finite set (Q1570763) (← links)
• Higher order corrections for anisotropic bootstrap percolation (Q1626605) (← links)
• Upper tails for arithmetic progressions in random subsets (Q1678647) (← links)
• Moment inequalities for functions of independent random variables (Q1775439) (← links)
• On a refinement of Waring's problem (Q1847774) (← links)
• Compound Poisson approximation: A user's guide (Q1872438) (← links)
• Upper tails for subgraph counts in random graphs (Q1881736) (← links)
• Concentration of measure and isoperimetric inequalities in product spaces (Q1908323) (← links)
• Beating treewidth for average-case subgraph isomorphism (Q2041983) (← links)
• A sharp threshold for bootstrap percolation in a random hypergraph (Q2042875) (← links)
• When Janson meets McDiarmid: Bounded difference inequalities under graph-dependence (Q2070641) (← links)
• Random Van der Waerden theorem (Q2073318) (← links)
• The covering threshold of a directed acyclic graph by directed acyclic subgraphs (Q2112584) (← links)
• Upper tails via high moments and entropic stability (Q2165741) (← links)
• On the probability of nonexistence in binomial subsets (Q2184826) (← links)
• Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution (Q2255289) (← links)
• On the missing log in upper tail estimates (Q2284727) (← links)
• Upper tail bounds for stars (Q2309238) (← links)
• Explicit two-source extractors and resilient functions (Q2320598) (← links)
• Optimal inter-object correlation when replicating for availability (Q2377265) (← links)
• Asymptotic linearity of binomial random hypergraphs via cluster expansion under graph-dependence (Q2672967) (← links)
• The lower tail: Poisson approximation revisited (Q2795741) (← links)
• Upper bounds on probability thresholds for asymmetric Ramsey properties (Q2874080) (← links)
• The missing log in large deviations for triangle counts (Q2904593) (← links)
• For most graphs <i>H</i> , most <i>H</i> -free graphs have a linear homogeneous set (Q2930050) (← links)
• Ramsey properties of random discrete structures (Q3061178) (← links)
• A concentration result with application to subgraph count (Q3119051) (← links)
• Tight upper tail bounds for cliques (Q3145838) (← links)
• Vertex Ramsey properties of randomly perturbed graphs (Q3386525) (← links)
• On Sidon sets and asymptotic bases (Q3458238) (← links)
• A zero‐one law for a random subset (Q3977083) (← links)
• Random graphs with monochromatic triangles in every edge coloring (Q4286293) (← links)
• Threshold Functions for <i>H</i>-factors (Q4290084) (← links)
• On the concentration of multivariate polynomials with small expectation (Q4500690) (← links)
• The infamous upper tail (Q4537625) (← links)