arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1102.5063cs.SIphysics.soc-phstat.ME
收藏

参与者较少的稀疏随机图拓扑发现

Topology Discovery of Sparse Random Graphs With Few Participants

Animashree Anandkumar, Avinatan Hassidim, Jonathan Kelner

摘要:

我们考虑使用端到端随机测量(例如,延迟)之间的节点子集,称为参与者。其余的节点是隐藏的,并且不提供用于拓扑发现的任何信息。我们考虑了两种路由模型下的拓扑发现:(a)参与者沿着最短路径交换消息,并获得端到端的测量,(b)此外,参与者沿着第二短路径交换消息。对于场景(a),我们提出的算法使用均匀选择的参与者的次线性数量,在一个次线性的编辑距离保证。对于场景(b),我们得到了一个更强的结果,并表明,我们可以实现一致的重建时,一个次线性数量的均匀选择的节点参与。这意味着稀疏随机图的准确发现是易于使用的参与者的数量非常少。我们最终获得了一个下界的参与者的数量所需的任何算法来重建原始的随机图到一个给定的编辑距离。我们还表明,虽然一致的发现是易于处理的稀疏随机图使用少量的参与者,在一般情况下,有图,不能被发现的任何算法,即使有大量的参与者,并与参与者之间的所有路径的端到端的信息的可用性。

英文摘要:

We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. The rest of the nodes are hidden, and do not provide any information for topology discovery. We consider topology discovery under two routing models: (a) the participants exchange messages along the shortest paths and obtain end-to-end measurements, and (b) additionally, the participants exchange messages along the second shortest path. For scenario (a), our proposed algorithm results in a sub-linear edit-distance guarantee using a sub-linear number of uniformly selected participants. For scenario (b), we obtain a much stronger result, and show that we can achieve consistent reconstruction when a sub-linear number of uniformly selected nodes participate. This implies that accurate discovery of sparse random graphs is tractable using an extremely small number of participants. We finally obtain a lower bound on the number of participants required by any algorithm to reconstruct the original random graph up to a given edit distance. We also demonstrate that while consistent discovery is tractable for sparse random graphs using a small number of participants, in general, there are graphs which cannot be discovered by any algorithm even with a significant number of participants, and with the availability of end-to-end information along all the paths between the participants.

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

↑