Shaibal Karmakar

Upper Tail Bounds for Irregular Graphs

We consider the upper tail large deviations of subgraph counts for irregular graphs H$$ \mathrm{H} $$ in 𝔾(n,p) , the sparse Erdős‐Rényi graph on n$$ n $$ vertices with edge connectivity probability p∈(0,1)$$ p\in \left(0,1\right) $$ . For n−1/Δ≪p≪1$$ {n}^{-1/\Delta}\ll p\ll 1 $$ , where Δ$$ \Delta $$ is the maximum de...