arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0907.0078physics.data-an
收藏

自然截断幂律的抽样:匹配悖论

Sampling from naturally truncated power laws: The matchmaking paradox

I. M. Sokolov, I. Eliazar

摘要:

考虑一个由N >> 1条链路连接的M >> 1个节点组成的网络,其中每个节点的链路数分布遵循指数为0<α<1的幂律。由于N是有限的,幂律自然被截断。任意采样m << M个节点的子集,得到样本均值η:采样子集内每个节点的平均链接数。我们研究了样本均值η的统计量,发现它在总体均值ν=N/M附近的波动范围非常广,而且有很强的偏斜性,产生的典型值系统地显著小于总体均值ν。将这些结果应用到二分网络的情况下,我们表明,这些网络的两个部分的样本平均值通常是不同的-我们在标题中称之为“配对悖论”的事实。

英文摘要:

Consider a network of M >> 1 nodes connected by N >> 1 links, in which the distribution of the number of links per node follows a power law with exponent 0<α<1. The power law is naturally truncated due to the fact that N is finite. A subset of m << M nodes is sampled arbitrarily, yielding the sample mean η: The average number of links per node, within the sampled subset. We explore the statistics of the sample mean ηand show that its fluctuations around the population mean ν=N/M are extremely broad and strongly skewed -- yielding typical values which are systematically and significantly smaller than the population mean ν. Applying these results to the case of bipartite networks, we show that the sample means of the two parts of these networks generally differ -- the fact we call "matchmaking paradox" in the title.

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

↑