English

Upper tail bounds for irregular graphs

Probability 2025-04-10 v3 Combinatorics

Abstract

We consider the upper tail large deviations of subgraph counts for irregular graphs H\mathrm{H} in G(n,p)\mathbb{G}(n,p), the sparse Erd\H{o}s-R\'enyi graph on nn vertices with edge connectivity probability p(0,1)p \in (0,1). For n1/Δp1n^{-1/\Delta} \ll p \ll 1, where Δ\Delta is the maximum degree of H\mathrm{H}, we derive the upper tail large deviations for any irregular graph H\mathrm{H}. On the other hand, we show that for pp such that 1nvHpeH(logn)αH/(αH1)1 \ll n^{v_{\mathrm{H}}} p^{e_{\mathrm{H}}} \ll (\log n)^{\alpha^{*}_{\mathrm{H}}/\left(\alpha^{*}_{\mathrm{H}}-1\right)}, where vHv_{\mathrm{H}} and eHe_{\mathrm{H}} denote the number of vertices and edges of H\mathrm{H}, and αH\alpha^*_{\mathrm{H}} denotes the fractional independence number, the upper tail large deviations of the number of unlabelled copies of H\mathrm{H} in G(n,p)\mathbb{G}(n,p) is given by that of a sequence of Poisson random variables with diverging mean, for any strictly balanced graph H\mathrm{H}. Restricting to the rr-armed star graph we further prove a localized behavior in the intermediate range of pp (left open by the above two results) and show that the mean-field approximation is asymptotically tight for the logarithm of the upper tail probability. This work further identifies the typical structures of G(n,p)\mathbb{G}(n,p) conditioned on upper tail rare events in the localized regime.

Keywords

Cite

@article{arxiv.2503.05311,
  title  = {Upper tail bounds for irregular graphs},
  author = {Anirban Basak and Shaibal Karmakar},
  journal= {arXiv preprint arXiv:2503.05311},
  year   = {2025}
}

Comments

24 pages; This version contains additional results about typical structures of random graphs conditioned on upper tail events

R2 v1 2026-06-28T22:10:34.553Z