arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1809.05654cond-mat.dis-nn
收藏

转移概率矩阵的图形结构的变化表明最慢的动力学弛豫

Changes of graph structure of transition probability matrices indicate the slowest kinetic relaxations

Teruaki Okushima, Tomoaki Niiyama, Kensuke S. Ikeda, Yasushi Shimizu

摘要:

转移概率矩阵$e^{τK}$的最可能转移的图,即,转移率矩阵$K$在有限时间间隔$τ$上的时间演化矩阵。我们研究了最可能的转变的图形结构如何作为$τ$的函数而变化,从而阐明了图形结构存在动力学阈值$τ_g$。也就是说,对于$τ<τ_g$,连通图分量的数目是恒定的。相比之下,对于$τ\geq τ_g$,连接的图组件上的最可能的转换的重组发生多次,这将剧烈的变化引入到图结构中。使用一个说明性的多漏斗模型,我们表明,重组模式表明存在的最慢的弛豫模式的本征值和本征向量相当精确。我们还设计了一个评估公式,使我们能够校正的本征值与高精度的合并过程的数据。我们表明,基于图形的方法是有效的,广泛的动力学系统退化,以及非退化,松弛速率。

英文摘要:

Graphs of the most probable transitions for a transition probability matrix, $e^{τK}$, i.e., the time evolution matrix of the transition rate matrix $K$ over a finite time interval $τ$, are considered. We study how the graph structures of the most probable transitions change as functions of $τ$, thereby elucidating that a kinetic threshold $τ_g$ for the graph structures exists. Namely, for $τ<τ_g$, the number of connected graph components are constant. In contrast, for $τ\geq τ_g$, recombinations of most probable transitions over the connected graph components occur multiple times, which introduce drastic changes into the graph structures. Using an illustrative multi-funnel model, we show that the recombination patterns indicate the existence of the eigenvalues and eigenvectors of slowest relaxation modes quite precisely. We also devise an evaluation formula that enables us to correct the values of eigenvalues with high accuracy from the data of merging processes. We show that the graph-based method is valid for a wide range of kinetic systems with degenerate, as well as non-degenerate, relaxation rates.

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

↑