On the concentration of multivariate polynomials with small expectation

DOI<344::AID-RSA4>3.0.CO;2-5 10.1002/1098-2418(200007)16:4<344::AID-RSA4>3.0.CO;2-5zbMath0958.60028OpenAlexW1985376393MaRDI QIDQ4500690

Van H. Vu

Publication date: 9 April 2001

Full work available at URL: https://doi.org/10.1002/1098-2418(200007)16:4<344::aid-rsa4>3.0.co;2-5

zbMATH Keywords

random graphscombinatorial number theorylarge deviation bound

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Large deviations (60F10)

Related Items

Concentration of non‐Lipschitz functions and applications, The infamous upper tail, Upper tails via high moments and entropic stability, Colorful triangle counting and a \textsc{MapReduce} implementation, On the Method of Typical Bounded Differences, Concentration inequalities using the entropy method, On Sidon sets which are asymptotic bases of order \(4\), On the missing log in upper tail estimates, A counterexample to the DeMarco‐Kahn upper tail conjecture, Derandomized Concentration Bounds for Polynomials, and Hypergraph Maximal Independent Set, Concentration and Moment Inequalities for Polynomials of Independent Random Variables, An extension of the Erdős‐Tetali theorem, Dense sumsets of Sidon sequences, A concentration result with application to subgraph count, Concentration inequalities for nonlinear matroid intersection, On a refinement of Waring's problem, Unnamed Item, Tight upper tail bounds for cliques

Cites Work

• Unnamed Item
• Unnamed Item
• Majorizing measures: The generic chaining
• Counting extensions
• Intersection Theorems for Systems of Sets
• THIN SUBBASES
• Poisson approximation for large deviations
• On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs
• A Large Deviation Inequality for Functions of Independent, Multi-Way Choices
• Representations of integers as the sum of k terms