首页> 外文会议>Workshop on Algorithm Engineering and Experiments >Sampling Graphs with a Prescribed Joint Degree Distribution Using Markov Chains
【24h】

Sampling Graphs with a Prescribed Joint Degree Distribution Using Markov Chains

机译:使用马尔可夫链具有规定的联合度分布的抽样图

获取原文
获取外文期刊封面目录资料

摘要

One of the most influential results in network analysis is that many natural networks exhibit a power-law or log-normal degree distribution. This has inspired numerous generative models that match this property. However, more recent work has shown that while these generative models do have the right degree distribution, they are not good models for real life networks due to their differences on other important metrics like conductance. We believe this is, in part, because many of these real-world networks have very different joint degree distributions, i.e. the probability that a randomly selected edge will be between nodes of degree k and l. Assortativity is a sufficient statistic of the joint degree distribution, and it has been previously noted that social networks tend to be assortative, while biological and technological networks tend to be disassortative.
机译:网络分析中最有影响力的结果之一是许多自然网络展示了权力法或对数正常程度分布。这激发了符合此属性的许多生成型号。然而,最近的工作表明,虽然这些生成型号确实具有正确的学位分布,但由于它们对传导等其他重要指标的差异,它们不是真实生活网络的好模型。我们相信这是部分,因为这些现实世界的许多网络具有非常不同的联合度分布,即随机选择的边缘将在k和L的节点之间的概率。 assortativity是联合度分布的充分统计数据,先前已指出,社交网络往往是各种各样的,而生物和技术网络往往是反汇编。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号