Deviation probabilities for arithmetic progressions and irregular discrete structures

From MaRDI portal
(Redirected from Publication:6136819)




Abstract: Let the random variable X,:=,e(mathcalH[B]) count the number of edges of a hypergraph mathcalH induced by a random m-element subset B of its vertex set. Focussing on the case that the degrees of vertices in mathcalH vary significantly we prove bounds on the probability that X is far from its mean. It is possible to apply these results to discrete structures such as the set of k-term arithmetic progressions in the 1,dots,N. Furthermore, our main theorem allows us to deduce results for the case BsimBp is generated by including each vertex independently with probability p. 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.



Cites work









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)