Upper tails for triangles

Authors:
B. DeMarco;J. Kahn
Affiliations:
Department of Mathematics, Rutgers University, Piscataway, New Jersey 08854;Department of Mathematics, Rutgers University, Piscataway, New Jersey 08854
Venue:
Random Structures & Algorithms
Year:
2012

Citing 4
Cited 2

The infamous upper tail

Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
A Large Deviation Result on the Number of Small Subgraphs of a Random Graph

Combinatorics, Probability and Computing
Divide and conquer martingales and the number of triangles in a random graph

Random Structures & Algorithms
The Deletion Method For Upper Tail Estimates

Combinatorica

The missing log in large deviations for triangle counts

Random Structures & Algorithms
Tight upper tail bounds for cliques

Random Structures & Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

With ξ the number of triangles in the usual (Erdős-Rényi) random graph G(m,p), p 1/m and η 0, we show (for some Cη 0) \documentclass{article} \usepackage{mathrsfs} \usepackage{amsmath, amssymb} \pagestyle{empty} \begin{document}\begin{align*} \text {Pr}(\xi (1+\eta){{\sf E}} \xi) Cη. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 40, 452–459, 2012 © 2012 Wiley Periodicals, Inc.