Abstract
With ξ the number of triangles in the usual (Erdo{double acute}s-Rényi) random graph G(m,p), p > 1/m and η > 0, we show (for some C η > 0) This is tight up to the value of C η.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 452-459 |
| Number of pages | 8 |
| Journal | Random Structures and Algorithms |
| Volume | 40 |
| Issue number | 4 |
| DOIs | |
| State | Published - Jul 2012 |
All Science Journal Classification (ASJC) codes
- Software
- Mathematics(all)
- Computer Graphics and Computer-Aided Design
- Applied Mathematics
Keywords
- Large deviations
- Random graphs
- Subgraph counts
- Upper tails