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

weakly connected有向图的扩散与一致性

Diffusion and consensus on weakly connected directed graphs

J. J. P. Veerman, E. Kummel

摘要:

设$G$是一个弱连通有向图,它具有非对称图Laplacian ${\cal L}$ .一致性和扩散是$G$上的对偶动力学过程,其中$\dot x=-{\cal L}x$表示一致性,$\dot p=-p{\cal L}$表示扩散。我们认为这两个过程以及它们的离散时间类似物。根据$G$划分为强连通分量,定义了${\cal L}$左零空间的行向量$\{\bar γ_i\}_{i=1}^k$的基和${\cal L}$右零空间的列向量$\{γ_i\}_{i=1}^k$的基.这使得完整的表征的渐近行为的扩散和共识-离散和连续-在这些特征向量。作为这些想法的应用,我们提出了一个治疗的pagerank算法,是双重的通常的。我们进一步表明,通常包括在算法中的心灵传送功能是不严格必要的。这是一个完整的和自足的治疗的渐近的共识和扩散的有向图。这里提出的许多想法可以在文献中找到,尽管大多数都在主流数学之外,并且并不总是有完整的证明。本文试图通过提供一个紧凑和方便的调查来弥补这一点。

英文摘要:

Let $G$ be a weakly connected directed graph with asymmetric graph Laplacian ${\cal L}$. Consensus and diffusion are dual dynamical processes defined on $G$ by $\dot x=-{\cal L}x$ for consensus and $\dot p=-p{\cal L}$ for diffusion. We consider both these processes as well their discrete time analogues. We define a basis of row vectors $\{\bar γ_i\}_{i=1}^k$ of the left null-space of ${\cal L}$ and a basis of column vectors $\{γ_i\}_{i=1}^k$ of the right null-space of ${\cal L}$ in terms of the partition of $G$ into strongly connected components. This allows for complete characterization of the asymptotic behavior of both diffusion and consensus --- discrete and continuous --- in terms of these eigenvectors. As an application of these ideas, we present a treatment of the pagerank algorithm that is dual to the usual one. We further show that the teleporting feature usually included in the algorithm is not strictly necessary. This is a complete and self-contained treatment of the asymptotics of consensus and diffusion on digraphs. Many of the ideas presented here can be found scattered in the literature, though mostly outside mainstream mathematics and not always with complete proofs. This paper seeks to remedy this by providing a compact and accessible survey.

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

↑