On the largest component of a random graph with a subpower-law degree sequence in a subcritical phase
成果类型：
Article
署名作者：
Pittel, B. G.
署名单位：
University System of Ohio; Ohio State University
刊物名称：
ANNALS OF APPLIED PROBABILITY
ISSN/ISSBN：
1050-5164
DOI：
10.1214/07-AAP493
发表日期：
2008
页码：
1636-1650
关键词：
摘要：
A uniformly random graph on n vertices with a fixed degree sequence, obeying a y subpower law, is studied. It is shown that, for y > 3, in a subcritical phase with high probability the largest component size does not exceed n I /Y +E,, -n = 0 (In In n1 In n), I ly being the best power for this random graph. This is similar to the best possible n'l(y-') bound for a different model of the random graph, one with independent vertex degrees, conjectured by Durrett, and proved recently by Janson.
来源URL：