Random graphs
Random graphs
复制标题
DOI：
10.1002/0471667196.ess2165.pub2
复制
发表时间：
2006-01
期刊：
影响因子：
--
通讯作者：
Alan M. Frieze
中科院分区：
文献类型：
--
作者：
Alan M. Frieze
介绍泊松随机图的数学，随机网络的最简单模型。本章从模型的定义开始，然后是基本属性的推导，如平均度，度分布和聚类系数。随后详细推导了随机图的大尺度结构性质，包括巨组分出现时的相变位置、巨组分的大小、小组分的平均大小以及网络的预期直径。本章最后讨论了随机图模型的一些缺点。
An introduction to the mathematics of the Poisson random graph, the simplest model of a random network. The chapter starts with a definition of the model, followed by derivations of basic properties like the mean degree, degree distribution, and clustering coefficient. This is followed with a detailed derivation of the large-scale structural properties of random graphs, including the position of the phase transition at which a giant component appears, the size of the giant component, the average size of the small components, and the expected diameter of the network. The chapter ends with a discussion of some of the shortcomings of the random graph model.