Critical random graphs and the differential equations technique
Critical random graphs and the differential equations technique
复制标题
临界随机图和微分方程技术
DOI:
10.1007/s13226-017-0249-0
复制
发表时间:
2018
影响因子:
0.7
通讯作者:
Bhamidi S
中科院分区:
文献类型:
--
作者:
Bhamidi S
Over the last few years a wide array of random graph models have been postulated to understand properties of empirically observed networks. Most of these models come with a parametert(usually related to edge density) and a (model dependent) critical timetcthat specifies when a giant component emerges. There is evidence to support that for a wide class of models, under moment conditions, the nature of this emergence is universal and looks like the classical Erdős-Rényi random graph, in the sense of the critical scaling window and (a) the sizes of the components in this window (all maximal component sizes scaling liken2/3) and (b) the structure of components (rescaled byn−1/3) converge to random fractals related to the continuum random tree. The aim of this note is to give a non-technical overview of recent breakthroughs in this area, emphasizing a particular tool in proving such results called the differential equations technique first developed and used extensively in probabilistic combinatorics in the work of Wormald [52, 53] and developed in the context of critical random graphs by the authors and their collaborators in [10–12].
登录
查看更多内容
DOI:
10.1007/bfb0092620
发表时间:
1997
期刊:
--
影响因子:
--
作者:
G. Grimmett
通讯作者:
G. Grimmett
DOI:
--
发表时间:
2011
期刊:
Combinatorics, probability & computing
影响因子:
--
作者:
O. Riordan
通讯作者:
O. Riordan
影响因子:
1
作者:
Tomasz Łuczak
通讯作者:
Tomasz Łuczak
影响因子:
2
作者:
B. Bollobás;O. Riordan
通讯作者:
O. Riordan
DOI:
--
发表时间:
2010
期刊:
影响因子:
--
作者:
Adrien Joseph
通讯作者:
Adrien Joseph