arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1907.04260cond-mat.stat-mech
收藏

随机矩阵谱的仿射依赖界

Affinity-dependent bound on the spectrum of stochastic matrices

Matthias Uhl, Udo Seifert

摘要:

亲和力已被证明是一个有用的工具,量化的非平衡性质的时间连续马尔可夫过程,因为它作为一个措施,打破时间反演对称性。最近已经证实,相干振荡的数量,这是由相应的主矩阵的第一个非平凡特征值的虚部和实部的比例,是由网络中存在的最大圈亲和度约束。在本文中,我们猜想这些主矩阵,约束所有特征值的方式类似于著名的Perron Frobenius定理,是有效的任何随机矩阵的整个频谱上的一个界。与其他基于亲和力依赖边界的研究一样,使边界饱和的限制过程由非对称随机游走给出。对于单圈网络,我们证明了不对称随机游动的小扰动是不可能违反该界的,并提供了数值证据证明其在随机生成网络中的有效性。结果被扩展到多循环网络,由随机构造的拓扑结构和过渡率的网络提供的数值证据支持。

英文摘要:

Affinity has proven to be a useful tool for quantifying the non-equilibrium character of time continuous Markov processes since it serves as a measure for the breaking of time reversal symmetry. It has recently been conjectured that the number of coherent oscillations, which is given by the ratio of imaginary and real part of the first non-trivial eigenvalue of the corresponding master matrix, is constrained by the maximum cycle affinity present in the network. In this paper, we conjecture a bound on the whole spectrum of these master matrices that constrains all eigenvalues in a fashion similar to the well known Perron-Frobenius theorem that is valid for any stochastic matrix. As in other studies that are based on affinity-dependent bounds, the limiting process that saturates the bound is given by the asymmetric random walk. For unicyclic networks, we prove that it is not possible to violate the bound by small perturbation of the asymmetric random walk and provide numerical evidence for its validity in randomly generated networks. The results are extended to multicyclic networks, backed up by numerical evidence provided by networks with randomly constructed topology and transition rates.

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

↑