期刊
JOURNAL OF STATISTICAL PHYSICS
卷 124, 期 6, 页码 1377-1397出版社
SPRINGER
DOI: 10.1007/s10955-006-9168-x
关键词
simple graphs; random graphs; degree distribution; generating algorithms; configuration model
Let F be a probability distribution with support on the non-negative integers. Four methods for generating a simple undirected graph with (approximate) degree distribution F are described and compared. Two methods are based on the so called configuration model with modifications ensuring a simple graph, one method is an extension of the classical Erdos-Renyi graph where the edge probabilities are random variables, and the last method starts with a directed random graph which is then modified to a simple undirected graph. All methods are shown to give the correct distribution in the limit of large graph size, but under different assumptions on the degree distribution F and also using different order of operations.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据