arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv cs/0012019cs.NI
收藏

关于Internet拓扑幂律的一个注记

A Note on Power-Laws of Internet Topology

Hongsong Chou

摘要:

Faloutsos等人(1999)提出的三个幂律是近年来许多关于在看似混沌的Internet拓扑结构中寻找隐藏规则的研究中的重要发现。在本文中,我们要指出的是,Faloutsos等人(1999,以下简称{ \it Faloutsos' Power Laws})发现的前两个定律实际上是等价的。也就是说,只要它们中的任何一个为真,另一个就可以从它导出,并且{ \it反之亦然}。虽然这两个定律是等价的,但它们提供了不同的方法来测量它们相应的幂律关系的指数。我们还表明,这两种措施将得到等效的结果,但具有不同的误差线。我们认为,对于不是很大的出度($\leq 32$在我们的模拟)的节点,第一Faloutsos的幂律是优于第二个在给出一个更好的估计的指数,而对于非常大的出度($> 32$)的节点的幂律关系可能不存在,至少对于出度和节点出度之间的关系的频率。

英文摘要:

The three Power-Laws proposed by Faloutsos et al(1999) are important discoveries among many recent works on finding hidden rules in the seemingly chaotic Internet topology. In this note, we want to point out that the first two laws discovered by Faloutsos et al(1999, hereafter, {\it Faloutsos' Power Laws}) are in fact equivalent. That is, as long as any one of them is true, the other can be derived from it, and {\it vice versa}. Although these two laws are equivalent, they provide different ways to measure the exponents of their corresponding power law relations. We also show that these two measures will give equivalent results, but with different error bars. We argue that for nodes of not very large out-degree($\leq 32$ in our simulation), the first Faloutsos' Power Law is superior to the second one in giving a better estimate of the exponent, while for nodes of very large out-degree($> 32$) the power law relation may not be present, at least for the relation between the frequency of out-degree and node out-degree.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑