Answers are grounded in this paper and cite their sources.
Strong 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.
No takes yet. Share an insight, caveat, or question.
Van H. Vu (2002) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: