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

关于平稳边马尔可夫图的渐进$u_0$ -期望泛洪时间

On the Asymptotic $u_0$-Expected Flooding Time of Stationary Edge-Markovian Graphs

Kevin Topley

摘要:

考虑$u_0$节点知道$d_0$的某个数据片段。当节点之间的通信根据具有概率参数$\hat{p}$的图形马尔可夫模型$\overline{ \mathcal{G}}_{n,\hat{p}}$演进时,本说明推导出数据$d_0$通过$n$节点的网络传播所需的预期时间。在该模型中,两个节点之间的边在离散时间$k \in \mathbb{N}^+$存在,如果该边存在于$k-1$,则概率为$\hat{p}$,如果该边不存在于$k-1$,则概率为$(1-\hat{p})$。每个边缘被解释为一个双向通信链路,通过该链路,邻居之间的数据被共享。假设初始通信图是一个带有参数$(n,\hat{p})$的Erdos-Renyi随机图,因此我们考虑一个\emph{stationary}马尔可夫模型$\overline{\mathcal{G}}_{n,\hat{p}}$ . $\overline{\mathcal{G}}_{n,\hat{p}}$的渐近“$u_0$ -预期洪泛时间”被定义为在$n$接近无穷大的极限中,将数据$d_0$从$u_0$节点传输到$n$节点所需的预期迭代次数。虽然大多数关于图马尔可夫模型中渐近洪泛时间的结果要么是\emph{almost sure}要么是\emph{with high probability},但这里得到的边界是\emph{in expectation}。然而,我们的边界更紧,可以比以前的结果更完整。

英文摘要:

Consider that $u_0$ nodes are aware of some piece of data $d_0$. This note derives the expected time required for the data $d_0$ to be disseminated through-out a network of $n$ nodes, when communication between nodes evolves according to a graphical Markov model $\overline{ \mathcal{G}}_{n,\hat{p}}$ with probability parameter $\hat{p}$. In this model, an edge between two nodes exists at discrete time $k \in \mathbb{N}^+$ with probability $\hat{p}$ if this edge existed at $k-1$, and with probability $(1-\hat{p})$ if this edge did not exist at $k-1$. Each edge is interpreted as a bidirectional communication link over which data between neighbors is shared. The initial communication graph is assumed to be an Erdos-Renyi random graph with parameters $(n,\hat{p})$, hence we consider a \emph{stationary} Markov model $\overline{\mathcal{G}}_{n,\hat{p}}$. The asymptotic "$u_0$-expected flooding time" of $\overline{\mathcal{G}}_{n,\hat{p}}$ is defined as the expected number of iterations required to transmit the data $d_0$ from $u_0$ nodes to $n$ nodes, in the limit as $n$ approaches infinity. Although most previous results on the asymptotic flooding time in graphical Markov models are either \emph{almost sure} or \emph{with high probability}, the bounds obtained here are \emph{in expectation}. However, our bounds are tighter and can be more complete than previous results.

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

↑