Fetching the paper…
Reading the bibliography…
We provide a systematic approach to deal with the following problem.
W. Hoeffding, (1948). A class of statistics with asymptotically normal distribution
1948
Earlier work this paper cites.
W. Hoeffding, (1956). On the Distribution of the Number of Successes in Independent trials
1956
Earlier work this paper cites.
W. Hoeffding, (1963). Probability inequalities for sums of bounded random variables
1963
Earlier work this paper cites.
K. Azuma, (1967). Weighted sums of certain dependent random variables
1967
Earlier work this paper cites.
P. Erdős, L. Lovász, (1975). Problems and results on 3-chromatic hypergraphs and some related questions
1975
Earlier work this paper cites.
R. Kaas, J.M. Burhman, (1980). Mean, Median, Mode in the Binomial Distribution
1980
Earlier work this paper cites.
C. McDiarmid, (1989). On the method of bounded differences
1989
Earlier work this paper cites.
A. Siegel, (1992). Towards a usable theory of Chernoff-Hoeffding bounds for heterogeneous and partially dependent random variables
1992
Earlier work this paper cites.
M. Bellare, J. Rompel, (1994). Randomness-efficient oblivious sampling
1994
Earlier work this paper cites.
M.A. Arcones, (1995). A Bernstein-type inequality for U U -statistics and U U -processes
1995
Earlier work this paper cites.
J.P. Schmidt, A. Siegel, A. Srinivasan, (1995). Chernoff-Hoeffding bounds for applications with limited independence
1995
Earlier work this paper cites.
E. Giné, R. Latala, J. Zinn, (2000). Exponential and Moment Inequalities for U U -Statistics
2000
Earlier work this paper cites.
2000
Cited alongside, same era.
S.A. Van de Geer, (2002). On Hoeffding’s inequality for dependent random variables
2002
Cited alongside, same era.
V. Bentkus, (2004). On Hoeffding’s inequalities
2004
Cited alongside, same era.
S. Janson, (2004). Large Deviations for Sums of Partly Dependent Random Variables
2004
Cited alongside, same era.
J.H. Kim, V.H. Vu, (2004). Divide and conquer martingales and the number of triangles in a random graph
2004
Cited alongside, same era.
R.S. Kallabis, M.H. Neumann, (2006). An exponential inequality under weak dependence
2012
Later among the works it cites.
B. DeMarco, J Kahn. (2012). Upper tails for triangles
2012
Later among the works it cites.
X. Fan, I. Grama, Q. Liu, (2012). Hoeffding’s inequality for supermartingales
2012
Later among the works it cites.
C. Pelekis, (2013). Bernoulli trials of fixed parity, random and randomly oriented graphs
2013
Later among the works it cites.
C. Pelekis, M. Schauer, (2013). Network coloring and colored coin games
2013
Later among the works it cites.
E. Rio, (2013). Extensions of the Hoeffding-Azuma inequalities
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2006
Cited alongside, same era.
N. Alon, J. Spencer, (2008). The Probabilistic Method
2008
Cited alongside, same era.
R. Gradwohl, A. Yehudayoff, (2008). t-Wise independence with local dependencies
2008
Cited alongside, same era.
L.A. Kontorovich, K. Ramanan, (2008). Concentration inequalities for dependent random variables via the martingale method
2008
Cited alongside, same era.
B. Delyon, (2009). Exponential inequalities for sums of weakly dependent variables
2009
Cited alongside, same era.
R. Impagliazzo, V. Kabanets, (2010). Constructive proofs of concentration bounds
2010
Cited alongside, same era.
S. Ghosh, L. Goldstein, M. Raič, (2011). Concentration of measure for the number of isolated vertices in the Erdős-Rényi random graph by size bias couplings
2011
Cited alongside, same era.
2013
Later among the works it cites.
D. Gavinsky, S. Lovett, M. Saks, S. Srinivasan, (2014). A Tail Bound for Read-k Families of Functions
2014
Later among the works it cites.
N. Linial, Z. Luria, (2014). Chernoff’s inequality - A very elementary proof
2014
Later among the works it cites.
J. Hazla, T. Holenstein, (2015). Upper tail estimates with combinatorial proofs
2015
Closest in time.
E. Joly, G. Lugosi, (2015). Robust estimation of U U -statistics
2015
Closest in time.
C. Pelekis, J. Ramon, Y. Wang, (2015). On the Bernstein-Hoeffding method
2015
Closest in time.
J. Ramon, Y. Wang, G. Zheng-Chu, (2015). Learning from networked examples
2015
Closest in time.