论文标题
摆的安排：最大化异质随机步行的逃生时间
The Pendulum Arrangement: Maximizing the Escape Time of Heterogeneous Random Walks
论文作者
论文摘要
我们确定了异质一维随机步行的基本现象：当过渡概率中的异质性形成类似金字塔的潜在势垒时，逃生时间（遍历）时间最大化。该障碍对应于过渡概率的独特布置，有时称为摆的排列。我们将这个问题减少到产品，组合优化问题上，证明这种独特的结构始终使逃生时间最大化。这种一般特性可能会影响流行病学，生物学和计算机科学的研究，以更好地了解逃生时间行为并构建入侵者 - 弹性网络。
We identify a fundamental phenomenon of heterogeneous one dimensional random walks: the escape (traversal) time is maximized when the heterogeneity in transition probabilities forms a pyramid-like potential barrier. This barrier corresponds to a distinct arrangement of transition probabilities, sometimes referred to as the pendulum arrangement. We reduce this problem to a sum over products, combinatorial optimization problem, proving that this unique structure always maximizes the escape time. This general property may influence studies in epidemiology, biology, and computer science to better understand escape time behavior and construct intruder-resilient networks.
