arXiv math/05061292005-06math.PRmath.GR

Rate of Escape of the Mixer Chain

Ariel Yadin

英文摘要：

The mixer chain on a graph G is the following Markov chain. Place tiles on the vertices of G, each tile labeled by its corresponding vertex. A "mixer" moves randomly on the graph, at each step either moving to a randomly chosen neighbor, or swapping the tile at its current position with some randomly chosen adjacent tile. We study the mixer chain on Z, and show that at time t the expected distance to the origin is t^{3/4}, up to constants. This is a new example of a random walk on a group with rate of escape strictly between t^{1/2} and t.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

Topics in Markov chains: mixing and escape rate

These are the notes for the minicourse on Markov chains delivered at the Saint Petersburg Summer School, June 2012. The main emphasis is on methods for estimating mixing times (for finite chains) and escape rates (for infinite chains). Lamplighter groups are key examples in both topics and the Varopolous-Carne long range estimate is useful in both settings.

2015-06-16math.PR

Upper escape rate of Markov chains on weighted graphs

We obtain an upper escape rate function for a continuous time minimal symmetric Markov chain, defined on a locally finite weighted graph. This upper rate function is given in terms of volume growth with respect to an adapted path metric and has the same form as the manifold setting. Our approach also gives a slightly more restrictive form of Folz's theorem on conservativeness as a consequence.

2013-04-23math.PR

Cut-off and Escape Behaviors for Birth and Death Chains on Trees

We consider families of discrete time birth and death chains on trees, and show that in presence of a drift towards the root of the tree, the chains exhibit cut-off behavior along the drift and escape behavior in the opposite direction.

2011-02-10math-phmath.MPmath.PR

Metastability for general dynamics with rare transitions: escape time and critical configurations

Metastability is a physical phenomenon ubiquitous in first order phase transitions. A fruitful mathematical way to approach this phenomenon is the study of rare transitions Markov chains. For Metropolis chains associated with Statistical Mechanics systems, this phenomenon has been described in an elegant way in terms of the energy landscape associated to the Hamiltonian of the system. In this paper, we provide a similar description in the general rare transitions setup. Beside their theoretical content, we believe that our results are a useful tool to approach metastability for non--Metropolis…

2014-12-26math.PR

关于具有无界转移密度的吸收马尔可夫链的准遍历性，包括带逃逸的随机逻辑斯蒂映射

On the quasi-ergodicity of absorbing Markov chains with unbounded transition densities, including random logistic maps with escape

本文研究具有无界转移密度的吸收马尔可夫链的准遍历性，给出准遍历测度存在及Yaglom极限收敛的条件，并将其应用于带逃逸的随机逻辑斯蒂映射。

2024-03-26math.DSmath.PR

Multi-scale metastable dynamics and the asymptotic stationary distribution of perturbed Markov chains

We consider a simple but important class of metastable discrete time Markov chains, which we call perturbed Markov chains. Basically, we assume that the transition matrices depend on a parameter $\varepsilon$, and converge as $\varepsilon$. We further assume that the chain is irreducible for $\varepsilon$ but may have several essential communicating classes when $\varepsilon$. This leads to metastable behavior, possibly on multiple time scales. For each of the relevant time scales, we derive two effective chains. The first one describes the (possibly irreversible) metastable dynamics, while th…

2014-12-22math.PR

更多相关论文收起更多论文

Anomalous threshold behavior of long range random walks

We consider weighted graphs satisfying sub-Gaussian estimate for the natural random walk. On such graphs, we study symmetric Markov chains with heavy tailed jumps. We establish a threshold behavior of such Markov chains when the index governing the tail heaviness (or jump index) equals the escape time exponent (or walk dimension) of the sub-Gaussian estimate. In a certain sense, this generalizes the classical threshold corresponding to the second moment condition.

2015-09-01math.PR

高熵初始化下的平均场Potts模型与随机簇动力学

Mean-field Potts and random-cluster dynamics from high-entropy initializations

针对高维多模态分布下马尔可夫链最坏情况初始化混合慢的问题，研究完全图上随机簇与Potts模型三类动力学的高熵初始化收敛性，刻画快速混合的乘积测度初始化集并给出基于一维过程近似的证明。

2025-09-03cs.DSmath.PR

Long term behaviour of two interacting birth-and-death processes

In this paper we study the long term evolution of a continuous time Markov chain formed by two interacting birth-and-death processes. The interaction between the processes is modelled by transition rates which are functions with suitable monotonicity properties. This is in line with the approach proposed by Gauss G.F. and Kolmogorov A.N. for modelling interaction between species in ecology. We obtain conditions for transience/recurrence of the Markov chain and describe in detail its asymptotic behaviour in special transient cases. In particular, we find that in some of these cases the Markov c…

2017-03-22math.PRq-bio.PE

Rate of escape and central limit theorem for the supercritical Lamperti problem

The study of discrete-time stochastic processes on the half-line with mean drift at $x$ given by $μ_1 (x) \to 0$ as $x \to \infty$ is known as Lamperti's problem. We give sharp almost-sure bounds for processes of this type in the case where $μ_1 (x)$ is of order $x^{-β}$ for some $β\in (0,1)$. The bounds are of order $t^{1/(1+β)}$, so the process is super-diffusive but sub-ballistic (has zero speed). We make minimal assumptions on the moments of the increments of the process (finiteness of $(2+2β+\varepsilon)$-moments for our main results, so 4th moments certainly suffice) and do not assume th…

2010-07-30math.PR

Electric network for non-reversible Markov chains

We give an analogy between non-reversible Markov chains and electric networks much in the flavour of the classical reversible results originating from Kakutani, and later Kemény-Snell-Knapp and Kelly. Non-reversibility is made possible by a voltage multiplier -- a new electronic component. We prove that absorption probabilities, escape probabilities, expected number of jumps over edges and commute times can be computed from electrical properties of the network as in the classical case. The central quantity is still the effective resistance, which we do have in our networks despite the fact tha…

2014-05-29cond-mat.stat-mechmath.PR

大规模随机矩阵对局部扰动的鲁棒性

Robustness of large-scale stochastic matrices to localized perturbations

Lund University（隆德大学）；Politecnico di Torino（都灵理工大学）

本文研究了两个差异在部分行上的随机矩阵的不变分布总变差距离上界，探讨了其在大规模网络问题中的应用，包括PageRank算法、分布式平均与共识算法及粒子系统。

2015-05-16cs.DMcs.SIcs.SY

Metastability of the Potts ferromagnet on random regular graphs

We study the performance of Markov chains for the $q$-state ferromagnetic Potts model on random regular graphs. It is conjectured that their performance is dictated by metastability phenomena, i.e., the presence of "phases" (clusters) in the sample space where Markov chains with local update rules, such as the Glauber dynamics, are bound to take exponential time to escape. The phases that are believed to drive these metastability phenomena in the case of the Potts model emerge as local, rather than global, maxima of the so-called Bethe functional, and previous approaches of analysing these pha…

2023-01-10cs.DMmath.PR