在有向伯努利图中近似点间距离
Approximating inter-point distances in directed Bernoulli graphs
AI总结:
研究有向伯努利图中两点间距离的联合分布,通过三型 Bienaymé--Galton--Watson 过程的极限随机向量进行近似,误差为 O(n^{-1/2}log n)。
摘要:
在有向随机图中,边可以有单向或双向,两点间距离可沿单向路径计算。本文在有向伯努利随机图 DG(n,p,θ) 中近似两点间距离的联合分布,该图是伯努利随机图 G(n,p) 的扩展,通过独立赋向,双向概率为 θ,单向概率为 1/2(1-θ)。近似涉及两个独立的三元极限随机向量 (W^*_1,W^*_2,W_3),误差通常为 O(n^{-1/2}log n),可能最优,即使在伯努利随机图 G(n,p) 中也如此。
英文摘要:
In directed random graphs, in which edges can be assigned to have one of two directions, or perhaps both, the distance between two vertices $v$ and $v'$ can be computed along paths that are directed from $v$ to $v'$, or along paths that are directed from $v'$ to $v$. These two distances are in general dependent. Here, we approximate their joint distribution in the setting of the directed Bernoulli random graph $\mathcal{DG}(n,p,θ)$, obtained as a natural extension of the Bernoulli random graph $\mathcal{G}(n,p)$ by assigning directions to the edges independently, bidirectional with probability $θ$, and either of the two possible choices of single direction with probability $\frac12(1-θ)$. The approximation involves two independent copies of a trivariate limiting random vector $(W^*_1,W^*_2,W_3)$ associated with a $3$-type Bienaymé--Galton--Watson process. The approximation error is shown to be typically of order $O(n^{-1/2}\log n)$; this asymptotic order is likely to be optimal, even for the corresponding approximation in the Bernoulli random graph $\mathcal{G}(n,p)$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。