[2209.01587] Tight Chernoff-Like Bounds Under Limited Independence
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Mathematics > Probability

arXiv:2209.01587 (math)
[Submitted on 4 Sep 2022]

Title:Tight Chernoff-Like Bounds Under Limited Independence

Authors:Maciej Skorski
View PDF
Abstract:This paper develops sharp bounds on moments of sums of k-wise independent bounded random variables, under constrained average variance. The result closes the problem addressed in part in the previous works of Schmidt et al. and Bellare, Rompel. We The work also discuss discusses other applications of independent interests, such as asymptotically sharp bounds on binomial moments.
Comments: The full version of the RANDOM'22 conference paper
Subjects: Probability (math.PR); Data Structures and Algorithms (cs.DS); Statistics Theory (math.ST)
Cite as: arXiv:2209.01587 [math.PR]
  (or arXiv:2209.01587v1 [math.PR] for this version)
  https://doi.org/10.48550/arXiv.2209.01587

Submission history

From: Maciej Skorski [view email]
[v1] Sun, 4 Sep 2022 10:11:22 UTC (1,007 KB)
Full-text links:

Access Paper:

view license
Current browse context:
math.PR
< prev   |   next >
new | recent | 2022-09
Change to browse by:
cs
cs.DS
math
math.ST
stat
stat.TH

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)