随机定向图中的联络
Connections in randomly oriented graphs
摘要:
给定一个无向图$G$,让我们通过投掷独立的(可能有偏的)硬币来随机定向$G$,$G$的每条边都有一个硬币。对于存在从一个顶点$a\rightarrow b$到一个顶点$b$的有向路径的随机定向事件,我们证明了$G$的任意三个顶点$s$,$a$和$b$都有$\mathbb{P}(s\rightarrow a \cap s\rightarrow b) \ge \mathbb{P}(s\rightarrow a) \mathbb{P}(s\rightarrow b)$.
英文摘要:
Given an undirected graph $G$, let us randomly orient $G$ by tossing independent (possibly biased) coins, one for each edge of $G$. Writing $a\rightarrow b$ for the event that there exists a directed path from a vertex $a$ to a vertex $b$ in such a random orientation, we prove that $\mathbb{P}(s\rightarrow a \cap s\rightarrow b) \ge \mathbb{P}(s\rightarrow a) \mathbb{P}(s\rightarrow b)$ for any three vertices $s$, $a$ and $b$ of $G$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。