首页> 外文会议>Workshop on Combinatorial and Algorithmic Aspects of Networking(CAAN 2004) >Limits and Power Laws of Models for the Web Graph and Other Networked Information Spaces
【24h】

Limits and Power Laws of Models for the Web Graph and Other Networked Information Spaces

机译:Web图和其他联网信息空间模型的限制和动力定律

获取原文

摘要

We consider a new model of the web graph and related networks. The model is motivated by the copying models of the web graph, where new nodes copy the link structure of existing nodes, and a certain number of additional random links are introduced. Our model parametrizes the number of random links, thereby allowing for the analysis of threshold behaviour. We consider infinite limits of graphs generated by our model, and compare properties of these limits with orientations of the infinite random graph. We analyze the power law behaviour of the in-degree distribution of graphs generated by our model.
机译:我们考虑一个新的Web图形和相关网络的模型。该模型由Web图的复制模型激励,其中新节点复制了现有节点的链路结构,并且介绍了一定数量的额外随机链路。我们的模型参数化随机链路的数量,从而允许分析阈值行为。我们考虑由我们的模型生成的图形的无限限制,并将这些限制的属性与无限随机图的方向进行比较。我们分析了我们模型生成的图表的程度分布的权力法行为。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号