On the normality of giant components

On the normality of giant components

We consider a general family of random graph processes, which begin with an empty graph, and where at every step an edge is added at random according to some rule. We show that when certain general conditions are satisfied, the order of the giant component tends to a normal distribution. © 2012 Wile...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Random structures & algorithms 2013-12, Vol.43 (4), p.452-485
1. Verfasser: Seierstad, Taral Guldahl
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
central limit theorem
differential equation method
giant component
Graphs
Normal distribution
Normality
random graph
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We consider a general family of random graph processes, which begin with an empty graph, and where at every step an edge is added at random according to some rule. We show that when certain general conditions are satisfied, the order of the giant component tends to a normal distribution. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 43, 452–485, 2013
ISSN:1042-9832
1098-2418
DOI:10.1002/rsa.20464