arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1312.7170math.COmath.PR
收藏

随机几何图的相识时间

The acquaintance time of (percolated) random geometric graphs

Tobias Muller, Pawel Pralat

摘要:

本文研究了连通图$G$的相识时间$\AC(G)$.本文主要研究随机几何图的随机子图$\G(n,r,p)$,其中$n$的顶点是独立于$[0,1]^2$的均匀随机选取的,且当两个顶点之间的欧氏距离至多为$r$时,两个顶点以概率$p$相邻.我们目前的渐近结果的相识时间$\G(n,r,p)$广泛的$p=p(n)$和$r=r(n)$。特别是,我们表明,与高概率$\AC(G) = Θ(r^{-2})$的$G \in \G(n,r,1)$,“普通”的随机几何图形,只要$πn r^2 - \ln n \to \infty$(即,以上的连接阈值)。对于随机几何图$G \in \G(n,r,p)$,我们证明了具有高概率的$\AC(G) = Θ(r^{-2} p^{-1} \ln n)$,只要对某些$\eps>0$有$p n r^2 \geq n^{1/2+\eps}$和$p < 1-\eps$.

英文摘要:

In this paper, we study the acquaintance time $\AC(G)$ defined for a connected graph $G$. We focus on $\G(n,r,p)$, a random subgraph of a random geometric graph in which $n$ vertices are chosen uniformly at random and independently from $[0,1]^2$, and two vertices are adjacent with probability $p$ if the Euclidean distance between them is at most $r$. We present asymptotic results for the acquaintance time of $\G(n,r,p)$ for a wide range of $p=p(n)$ and $r=r(n)$. In particular, we show that with high probability $\AC(G) = Θ(r^{-2})$ for $G \in \G(n,r,1)$, the "ordinary" random geometric graph, provided that $πn r^2 - \ln n \to \infty$ (that is, above the connectivity threshold). For the percolated random geometric graph $G \in \G(n,r,p)$, we show that with high probability $\AC(G) = Θ(r^{-2} p^{-1} \ln n)$, provided that $p n r^2 \geq n^{1/2+\eps}$ and $p < 1-\eps$ for some $\eps>0$.

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

↑