期刊
INTERNET MATHEMATICS
卷 6, 期 4, 页码 489-522出版社
TAYLOR & FRANCIS INC
DOI: 10.1080/15427951.2010.557277
关键词
-
资金
- Direct For Mathematical & Physical Scien [0804324] Funding Source: National Science Foundation
Random graphs with given degrees are a natural next step in complexity beyond the Erdos-Renyi model, yet the degree constraint greatly complicates simulation and estimation. We use an extension of a combinatorial characterization due to Erdos and Gallai to develop a sequential algorithm for generating a random labeled graph with a given degree sequence. The algorithm is easy to implement and allows for surprisingly efficient sequential importance sampling. The resulting probabilities are easily computed on the fly, allowing the user to reweight estimators appropriately, in contrast to some ad hoc approaches that generate graphs with the desired degrees but with completely unknown probabilities. Applications are given, including simulating an ecological network and estimating the number of graphs with a given degree sequence.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据