
doi: 10.1002/rsa.10032
AbstractStrong concentration results play a fundamental role in probabilistic combinatorics and theoretical computer science. In this paper, we present several new concentration results developed recently by the author and collaborators. To illustrate the power of these new results, we discuss applications in many different areas of mathematics, from combinatorial number theory to the theory of random graphs. © 2002 Wiley Periodicals, Inc. Random Struct. Alg., 20:262–316, 2002
Additive bases, including sumsets, Large deviations, finite projective planes, concentration inequalities, additive bases, Random graphs (graph-theoretic aspects), Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.), strong concentration, matching and coloring, random graphs
Additive bases, including sumsets, Large deviations, finite projective planes, concentration inequalities, additive bases, Random graphs (graph-theoretic aspects), Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.), strong concentration, matching and coloring, random graphs
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 49 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
