Abstract | ||
---|---|---|
We see that the entropy method yields strong concentration results for general self-bounding functions of independent random variables. These give an improvement of a concentration result of Talagrand much used in discrete mathematics. © 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2006 |
Year | DOI | Venue |
---|---|---|
2006 | 10.1002/rsa.v29:4 | Random Struct. Algorithms |
Keywords | Field | DocType |
certificate,concentration | Discrete mathematics,Random variable,Combinatorics,struct,Inequality,Mathematics,Bounding overwatch | Journal |
Volume | Issue | ISSN |
29 | 4 | 1042-9832 |
Citations | PageRank | References |
7 | 0.67 | 2 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Colin McDiarmid | 1 | 1071 | 167.05 |
Bruce A. Reed | 2 | 1311 | 122.69 |