Related papers: Mixing on Generalized Associahedra

Let $X$ be a weighted graph and $M$ be its adjacency, Laplacian or signless Laplacian matrix. In a continuous quantum walk on $X$, local $\epsilon$-uniform mixing occurs at vertex $u$ if the $u$th column of the matrix $U(t)=e^{itM}$ can be…

We consider two random walks evolving synchronously on a random out-regular graph of $n$ vertices with bounded out-degree $r\ge 2$, also known as a random Deterministic Finite Automaton (DFA). We show that, with high probability with…

We develop a method for analyzing the mixing times for a quite general class of Markov chains on the complete monomial group G \wr S_n (the wreath product of a group G with the permutation group S_n) and a quite general class of Markov…

We consider a recurrent random walk in random environment on a regular tree. Under suitable general assumptions upon the distribution of the environment, we show that the walk exhibits an unusual slow movement: the order of magnitude of the…

Lawler and Trujillo Ferreras constructed a well-known coupling between the Brownian loop soups in $\mathbb{R}^2$ and the random walk loop soups on $\mathbb{Z}^2$ (one rescales the random walk loops by $1/N$, their time parametrizations by…

In a coalescing random walk, a set of particles make independent random walks on a graph. Whenever one or more particles meet at a vertex, they unite to form a single particle, which then continues the random walk through the graph.…

We prove a law of large numbers for a class of multidimensional random walks in random environments where the environment satisfies appropriate mixing conditions, which hold when the environment is a weak mixing field in the sense of…

We prove a theorem that reduces bounding the mixing time of a card shuffle to verifying a condition that involves only pairs of cards, then we use it to obtain improved bounds for two previously studied models. E. Thorp introduced the…

In this paper we find an upper bound for the probability that a $3$ dimensional simple random walk covers each point in a nearest neighbor path connecting 0 and the boundary of an $L_1$ ball of radius $N$. For $d\ge 4$, it has been shown in…

The hardcore model is a fundamental probabilistic model extensively studied in statistical physics, probability theory, and computer science. For graphs of maximum degree $\Delta$, a well-known computational phase transition occurs at the…

We analyze the $L^1$-mixing of a generalization of the Averaging process introduced by Aldous. The process takes place on a growing sequence of graphs which we assume to be finite-dimensional, in the sense that the random walk on those…

Consider an arbitrary transient random walk on $\Z^d$ with $d\in\N$. Pick $\alpha\in[0,\infty)$ and let $L_n(\alpha)$ be the spatial sum of the $\alpha$-th power of the $n$-step local times of the walk. Hence, $L_n(0)$ is the range,…

Let $M_n$ be the number of steps of the loop-erasure of a simple random walk on $\mathbb{Z}^2$ from the origin to the circle of radius $n$. We relate the moments of $M_n$ to $Es(n)$, the probability that a random walk and an independent…

In this paper we consider a class of one-dimensional interacting particle systems in equilibrium, constituting a dynamic random environment, together with a nearest-neighbor random walk that on occupied/vacant sites has a local drift to the…

We study the Glauber dynamics for the random cluster (FK) model on the torus $(\mathbb{Z}/n\mathbb{Z})^2$ with parameters $(p,q)$, for $q \in (1,4]$ and $p$ the critical point $p_c$. The dynamics is believed to undergo a critical slowdown,…

Let $A_n= \varepsilon_n \cdots \varepsilon_1$, where $(\varepsilon_n)_{n \geq 1}$ is a sequence of independent random matrices taking values in $ GL_d(\mathbb R)$, $d \geq 2$, with common distribution $\mu$. In this paper, under standard…

We prove that the mixing time of driven-dissipative activated random walk on an interval of length $n$ with uniform or central driving exhibits cutoff at $n$ times the critical density for activated random walk on the integers. The proof…

We consider random walks with independent but not necessarily identical distributed increments. Assuming that the increments satisfy the well-known Lindeberg condition, we investigate the asymptotic behaviour of first-passage times over…

We study the mixing time of the single-site update Markov chain, known as the Glauber dynamics, for generating a random independent set of a tree. Our focus is obtaining optimal convergence results for arbitrary trees. We consider the more…

This paper focuses on the problem of modeling for small world effect on complex networks. Let's consider the supercritical Poisson continuous percolation on $d$-dimensional torus $T^d_n$ with volume $n^d$. By adding "long edges (short…