arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 1209.0736math.STcs.ITcs.SImath.ITstat.TH
收藏

基于抽样的集合规模分布估计及大型网络的特征化

On Set Size Distribution Estimation and the Characterization of Large Networks via Sampling

Fabricio Murai, Bruno Ribeiro, Don Towsley, Pinghui Wang

摘要:

在这项工作中,我们研究了集大小分布估计问题,其中元素是随机抽样的非重叠集的集合,我们试图从样本中恢复原来的集大小分布。这个问题在容量规划、网络理论等领域都有应用。现实世界的应用实例包括在大型图中表征入度分布和在互联网上发现TCP/IP流大小分布。我们证明,这是很难估计的原始集大小分布。原始集合大小分布的可恢复性相对于保留在集合中的元素的分数呈现出尖锐的阈值。如果这个分数保持在阈值以下,通常是幂律分布和指数尾分布中元素的一半,则原始集合大小分布是不可恢复的。我们还讨论了我们的研究结果的实际意义。

英文摘要:

In this work we study the set size distribution estimation problem, where elements are randomly sampled from a collection of non-overlapping sets and we seek to recover the original set size distribution from the samples. This problem has applications to capacity planning, network theory, among other areas. Examples of real-world applications include characterizing in-degree distributions in large graphs and uncovering TCP/IP flow size distributions on the Internet. We demonstrate that it is hard to estimate the original set size distribution. The recoverability of original set size distributions presents a sharp threshold with respect to the fraction of elements that remain in the sets. If this fraction remains below a threshold, typically half of the elements in power-law and heavier-than-exponential-tailed distributions, then the original set size distribution is unrecoverable. We also discuss practical implications of our findings.

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

↑