arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0906.0720math.PRmath.CO
收藏

图G(n,p)和G(n,m)中随机定向路的相关性

Correlations for paths in random orientations of G(n,p) and G(n,m)

Sven Erick Alm, Svante Janson, Svante Linusson

摘要:

我们研究随机图,$G(n,p)$和$G(n,m)$,随机方向的边缘。对于三个固定的不同的顶点s,a,b,我们研究了事件a -> s和s -> b在组合概率空间中的相关性。对于G(n,p),我们证明了存在一个p_c=1/2,使得对于固定的<p_c the correlation is negative for large enough n and for p>p_c,当n足够大时,相关性为正。我们猜想,对于固定的n \ge 27,相关系数对于p的三个临界值改变了三次符号。对于G(n,m),同样证明了,对于$p=m/\binom{n}{2}$,存在一个临界p_c,它是某个方程的解,近似等于0.7993。计算G(n,m)中任意k条有向边不存在的概率的引理被认为是独立的。我们提出了精确的递归计算P(a -&gt; s)$ and P(a -> s, s -> b)$。我们还简要讨论了相应的问题在淬火版本的问题。

英文摘要:

We study random graphs, both $G(n,p)$ and $G(n,m)$, with random orientations on the edges. For three fixed distinct vertices s,a,b we study the correlation, in the combined probability space, of the events a -> s and s -> b. For G(n,p), we prove that there is a p_c=1/2 such that for a fixed p<p_c the correlation is negative for large enough n and for p>p_c the correlation is positive for large enough n. We conjecture that for a fixed n\ge 27 the correlation changes sign three times for three critical values of p. For G(n,m) it is similarly proved that, with $p=m/\binom{n}{2}$, there is a critical p_c that is the solution to a certain equation and approximately equal to 0.7993. A lemma, which computes the probability of non existence of any k directed edges in G(n,m), is thought to be of independent interest. We present exact recursions to compute P(a -> s)$ and P(a -> s, s -> b)$. We also briefly discuss the corresponding question in the quenched version of the problem.

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

↑