On maximal tail probability of sums of nonnegative, independent and identically distributed random variables
From MaRDI portal
Publication:1687185
DOI10.1016/j.spl.2017.04.024zbMath1380.60029arXiv1602.03547OpenAlexW2962988203MaRDI QIDQ1687185
Tomasz Łuczak, Matas Šileikis, Katarzyna Mieczkowska
Publication date: 22 December 2017
Published in: Statistics \& Probability Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.03547
Inequalities; stochastic orderings (60E15) Extremal problems in graph theory (05C35) Sums of independent random variables; random walks (60G50) Hypergraphs (05C65)
Related Items (2)
The Erdős matching conjecture and concentration inequalities ⋮ A generalization of Erdős' matching conjecture
Cites Work
- Unnamed Item
- Improved bounds for Erdős' matching conjecture
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
- On the maximum number of edges in a hypergraph with given matching number
- On Erdős' extremal problem on matchings in hypergraphs
- Bounds for the Distribution Function of a Sum of Independent, Identically Distributed Random Variables
- The Markov Inequality for Sums of Independent Random Variables
- On a Chebyshev-Type Inequality for Sums of Independent Random Variables
This page was built for publication: On maximal tail probability of sums of nonnegative, independent and identically distributed random variables