By Abigail Raz

This paper examines bounds on upper tails for cycle counts in \(G_{n,p}\). For a fixed graph \(H\) define \(\xi_H= \xi_H^{n,p}\) to be the number of copies of \(H\) in \(G_{n,p}\). It is a much studied and surprisingly difficult problem to understand the upper tail of the distribution of \(\xi_H\), for... Show more

April 2, 2019

Loading full text...

Similar articles

Loading recommendations...

x1

Upper tail bounds for cycles

Click on play to start listening