Premium
On the normality of giant components
Author(s) -
Seierstad Taral Guldahl
Publication year - 2013
Publication title -
random structures and algorithms
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.314
H-Index - 69
eISSN - 1098-2418
pISSN - 1042-9832
DOI - 10.1002/rsa.20464
Subject(s) - struct , normality , giant component , random graph , mathematics , graph , combinatorics , discrete mathematics , computer science , statistics , programming language
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