The upper tail problem for induced 4‐cycles in sparse random graphs

Building on the techniques from the breakthrough paper of Harel, Mousset and Samotij, which solved the upper tail problem for cliques, we compute the asymptotics of the upper tail for the number of induced copies of the 4‐cycle in the binomial random graph Gn,p$$ {G}_{n,p} $$. We observe a new pheno...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Random structures & algorithms 2024-03, Vol.64 (2), p.401-459
1. Verfasser:	Cohen Antonir, Asaf
Format:	Artikel
Sprache:	eng
Schlagworte:	Graph theory non linear large deviations random graphs upper tail
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!