On the variational problem for upper tails in sparse random graphs

What is the probability that the number of triangles in Gn,p, the Erdős‐Rényi random graph with edge density p, is at least twice its mean? Writing it as exp[−r(n,p)], already the order of the rate function r(n, p) was a longstanding open problem when p = o(1), finally settled in 2012 by Chatterjee...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Random structures & algorithms Jg. 50; H. 3; S. 420 - 436
Hauptverfasser:	Lubetzky, Eyal, Zhao, Yufei
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Hoboken Wiley Subscription Services, Inc 01.05.2017
Schlagworte:	Asymptotic properties Constraining Density Deviation Graph theory Graphs large deviations sparse random graphs Triangles upper tails of subgraph counts Vibration
ISSN:	1042-9832, 1098-2418
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!