从距离查询重构随机图
Reconstructing random graphs from distance queries
AI总结:
本文研究了从距离查询重构常数直径二项随机图 $G(n,p)$ 的最小查询复杂度,在特定阈值窗口外给出了紧致的 $Θ(n^{4-d}p^{2-d})$ 复杂度估计,揭示了查询复杂度的非单调跳跃行为,并提出了最优的非自适应重构算法。
摘要:
我们估计了以高概率重构具有常数直径的二项随机图 $G(n,p)$ 所需的最少距离查询数。对于 $n^{-k/(k+1)+o(1)}$($k\in\mathbb{Z}_{>0}$)的“阈值窗口”之外的所有 $p>n^{-1+o(1)}$,我们得到了紧致(至多相差常数因子)的答案:以高概率,查询复杂度等于 $Θ(n^{4-d}p^{2-d})$,其中 $d$ 是随机图的直径。这表明了以下非单调行为:当直径变大时,查询复杂度会骤降;然而,在这些时刻之间,查询复杂度会增长。我们还证明存在一种非自适应算法,能以高概率使用 $O(n^{4-d}p^{2-d}\ln n)$ 次距离查询重构随机图,并且这是最优的。
英文摘要:
We estimate the minimum number of distance queries that is sufficient to reconstruct the binomial random graph $G(n,p)$ with constant diameter with high probability. We get a tight (up to a constant factor) answer for all $p>n^{-1+o(1)}$ outside "threshold windows" around $n^{-k/(k+1)+o(1)}$, $k\in\mathbb{Z}_{>0}$: with high probability the query complexity equals $Θ(n^{4-d}p^{2-d})$, where $d$ is the diameter of the random graph. This demonstrates the following non-monotone behaviour: the query complexity jumps down at moments when the diameter gets larger; yet, between these moments the query complexity grows. We also show that there exists a non-adaptive algorithm that reconstructs the random graph with $O(n^{4-d}p^{2-d}\ln n)$ distance queries with high probability, and this is best possible.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。