在图中种树,然后把它们找回来
Planting trees in graphs, and finding them back
摘要:
本文研究了Erdens-Rényi随机图中种植结构的检测与重建问题。出于通信安全的问题,我们专注于种植结构,包括在树图。对于种植线图,我们建立以下相图。在初始图的平均度$λ$低于某个临界值$λ_c=1$的低密度区域中,当线长度$K$越过某个临界值$f(λ)\ln(n)$时,检测和重建从不可能变为容易,其中$n$是图中的节点数。在高密度区域$λ>λ_c$中,随着$K$从$o(\sqrt{n})$到$ω(\sqrt{n})$,检测从不可能变为容易,并且只要$K=o(n)$,重建就保持不可能。对于不同深度的$D$ -ary树$h$和$2\le D\le O(1)$,我们识别低密度区域$λ<λ_D$,使得以下成立。存在具有以下属性的阈值$h*=g(D)\ln(\ln(n))$。随着$h$与$h*$交叉,检测从可行变为不可能。我们还表明,只有部分重建是可行的最好的$h\ge h*$。我们猜想一个类似的图片,以保持$D$ -ary树的线在高密度区域$λ>λ_D$,但确认只有以下部分的图片:检测是很容易的$D$ -ary树的大小$ω(\sqrt{n})$,而在最好的情况下,只有部分重建是可行的$D$ -ary树的任何大小$o(n)$。这些结果与相应的图片{ \em低秩}种植结构的检测和重建,如密集的子图和块社区:我们观察到检测和重建之间的差异,后者是不可能的检测是容易的广泛的参数。这个属性不适用于以前研究的低秩种植结构。
英文摘要:
In this paper we study detection and reconstruction of planted structures in Erdős-Rényi random graphs. Motivated by a problem of communication security, we focus on planted structures that consist in a tree graph. For planted line graphs, we establish the following phase diagram. In a low density region where the average degree $λ$ of the initial graph is below some critical value $λ_c=1$, detection and reconstruction go from impossible to easy as the line length $K$ crosses some critical value $f(λ)\ln(n)$, where $n$ is the number of nodes in the graph. In the high density region $λ>λ_c$, detection goes from impossible to easy as $K$ goes from $o(\sqrt{n})$ to $ω(\sqrt{n})$, and reconstruction remains impossible so long as $K=o(n)$. For $D$-ary trees of varying depth $h$ and $2\le D\le O(1)$, we identify a low-density region $λ<λ_D$, such that the following holds. There is a threshold $h*=g(D)\ln(\ln(n))$ with the following properties. Detection goes from feasible to impossible as $h$ crosses $h*$. We also show that only partial reconstruction is feasible at best for $h\ge h*$. We conjecture a similar picture to hold for $D$-ary trees as for lines in the high-density region $λ>λ_D$, but confirm only the following part of this picture: Detection is easy for $D$-ary trees of size $ω(\sqrt{n})$, while at best only partial reconstruction is feasible for $D$-ary trees of any size $o(n)$. These results are in contrast with the corresponding picture for detection and reconstruction of {\em low rank} planted structures, such as dense subgraphs and block communities: We observe a discrepancy between detection and reconstruction, the latter being impossible for a wide range of parameters where detection is easy. This property does not hold for previously studied low rank planted structures.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。