152 search results - page 1 / 31 » Constructive Proofs of Concentration Bounds |
APPROX
2010
Springer
13 years 6 months ago
2010
Springer
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
COMBINATORICA
2008
13 years 5 months ago
2008
A random geometric graph Gn is constructed by taking vertices X1, . . . , Xn Rd at random (i.i.d. according to some probability distribution with a bounded density function) and...
WDAG
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. We have a new proof of the lower bound that k-set agreement requires f/k + 1 rounds in a synchronous, message-passing model with f crash failures. The proof involves cons...
MFCS
1997
Springer
13 years 9 months ago
1997
Springer
We prove an exponential lower bound for the length of any resolution proof for the same set of clauses as the one used by Urquhart [13]. Our contribution is a significant simpli...
CIE
2006
Springer
13 years 8 months ago
2006
Springer
or representation theory of groups), and even borrows abstract geometrical concepts like Euler characteristic or Grothendieck ring. However, the most stimulating for proof complexi...