Deviation probabilities for arithmetic progressions and irregular discrete structures
From MaRDI portal
(Redirected from Publication:6136819)
Abstract: Let the random variable count the number of edges of a hypergraph induced by a random -element subset of its vertex set. Focussing on the case that the degrees of vertices in vary significantly we prove bounds on the probability that is far from its mean. It is possible to apply these results to discrete structures such as the set of -term arithmetic progressions in the . Furthermore, our main theorem allows us to deduce results for the case is generated by including each vertex independently with probability . In this setting our result on arithmetic progressions extends a result of Bhattacharya, Ganguly, Shao and Zhao cite{BGSZ}. We also mention connections to related central limit theorems.
Recommendations
- Deviation probabilities for arithmetic progressions and other regular discrete structures
- Deviation probabilities for arithmetic progressions and other regular discrete structures
- Upper tails for arithmetic progressions in random subsets
- Upper tail large deviations for arithmetic progressions in a random set
- On the probability of nonexistence in binomial subsets
Cites work
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- scientific article; zbMATH DE number 3405266 (Why is no real title available?)
- scientific article; zbMATH DE number 3198427 (Why is no real title available?)
- Bivariate fluctuations for the number of arithmetic progressions in random sets
- Concentration of multivariate polynomials and its applications
- Deviation probabilities for arithmetic progressions and other regular discrete structures
- Gaussian-width gradient complexity, reverse log-Sobolev inequalities and nonlinear large deviations
- Martingale Central Limit Theorems
- Moderate deviations of subgraph counts in the Erdős-Rényi random graphs \(G(n,m)\) and \(G(n,p)\)
- Nonlinear large deviations
- On tail probabilities for martingales
- On the Departure from Normality of a Certain Class of Martingales
- On the missing log in upper tail estimates
- On the probability of nonexistence in binomial subsets
- On the rate of convergence in the martingale central limit theorem
- Probability Inequalities for Sums of Bounded Random Variables
- Replica symmetry in upper tails of mean-field hypergraphs
- Some Approximations to the Binomial Distribution Function
- The large deviation principle for the Erdős-Rényi random graph
- The lower tail: Poisson approximation revisited
- Upper tail large deviations for arithmetic progressions in a random set
- Upper tails for arithmetic progressions in random subsets
- Upper tails for counting objects in randomly induced subhypergraphs and rooted random graphs
- Upper tails via high moments and entropic stability
- Weighted sums of certain dependent random variables
Cited in
(2)
This page was built for publication: Deviation probabilities for arithmetic progressions and irregular discrete structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6136819)