The diameter of sparse random graphs
The diameter of sparse random graphs
复制标题
DOI：
10.1002/rsa.20197
复制
发表时间：
2007-12
影响因子：
1
通讯作者：
Daniel Fernholz;V. Ramachandran
中科院分区：
文献类型：
--
作者：
Daniel Fernholz;V. Ramachandran
我们得到了一个表达式的形式c ln n + o（ln n）的直径的稀疏随机图与指定的度序列。在满足一定的收敛性和超临界性条件下，该结果几乎必然渐近成立，并且适用于经典随机图Gn，p（np = Θ（1）+ 1）和某些随机幂律图.© 2007 Wiley Periodicals，Inc.随机结构算法，2007
We derive an expression of the form c ln n + o(ln n) for the diameter of a sparse random graph with a specified degree sequence. The result holds asymptotically almost surely, assuming that certain convergence and supercriticality conditions are met, and is applicable to the classical random graph Gn,p with np = Θ(1) + 1, as well as certain random power law graphs. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007