Related papers: Convergence to equilibrium for a directed (1+d)-di…
We show how to combine Fourier analysis with coupling arguments to bound the mixing times of a variety of Markov chains. The mixing time is the number of steps a Markov chain takes to approach its equilibrium distribution. One application…
We consider paths of a one-dimensional simple random walk conditioned to come back to the origin after L steps (L an even integer). In the 'pinning model' each path \eta has a weight \lambda^{N(\eta)}, where \lambda>0 and N(\eta) is the…
Recent progress in open many-body quantum systems has highlighted the importance of the Markov length, the characteristic scale over which conditional correlations decay. It has been proposed that non-equilibrium phases of matter can be…
We establish the first polynomial upper bound for the mixing time of random edge flips on rooted quadrangulations: we show that the spectral gap of the edge flip Markov chain on quadrangulations with $n$ faces admits, up to constants, an…
We study a reversible continuous-time Markov dynamics on lozenge tilings of the plane, introduced by Luby et al. Single updates consist in concatenations of $n$ elementary lozenge rotations at adjacent vertices. The dynamics can also be…
We study a model of two polymers confined to a slit with sticky walls. More precisely, we find and analyse the exact solution of two directed friendly walks in such a geometry on the square lattice. We compare the infinite slit limit, in…
We prove an $\widetilde O(n^2)$ bound for the relaxation time and the log-Sobolev time (inverse log-Sobolev constant) of the classical triangulation flip chain on a convex $(n+2)$-gon, implying a mixing time of $\widetilde O(n^2)$. The…
We study the mixing time of two popular discrete-time Markov chains in continuous space, the Unadjusted Langevin Algorithm and the Proximal Sampler, which are discretizations of the Langevin dynamics. We extend mixing time analyses for…
Monotonic surfaces spanning finite regions of $Z^d$ arise in many contexts, including DNA-based self-assembly, card-shuffling and lozenge tilings. One method that has been used to uniformly generate these surfaces is a Markov chain that…
Dimensional reduction occurs when the critical behavior of one system can be related to that of another system in a lower dimension. We show that this occurs for directed branched polymers (DBP) by giving an exact relationship between DBP…
In this paper, we study the so-called intermediate disorder regime for a directed polymer in a random environment with heavy-tail. Consider a simple symmetric random walk $(S_n)_{n\geq 0}$ on $\mathbb{Z}^d$, with $d\geq 1$, and modify its…
We study one-dimensional lattice systems with pair-wise interactions of infinite range. We show projective convergence of Markov measures to the unique equilibrium state. For this purpose we impose a slightly stronger condition than…
We analyze a (1+1)-dimension directed random walk model of a polymer dipped in a medium constituted by two immiscible solvents separated by a flat interface. The polymer chain is heterogeneous in the sense that a single monomer may…
A polymer folding model on the square lattice is constructed with attractive contact interactions of strength 1/c^2, 0<c<1. The corresponding model on a dynamical random lattice, with freely fluctuating co-ordination number at each vertex,…
We present some promising ideas to treat the problem of making completely rigorous the development of our expression for $\lambda_d(p)$ of the monomer-dimer problem on a $d$-dimensional hypercubic lattice \begin{equation}\label{abstract1}…
We present a unifying picture of the compact, dense and dilute phases of two-dimensional polymers. The lattice dependence of the scaling exponents for compact polymers is reconciled with their universality in the dense and dilute case. In…
Using a finite size scaling form for reunion probability, we show numerically the existence of a binding-unbinding transition for Directed polymers with random interaction. The cases studied are (A1) two chains in 1+1 dimensions, (A2) two…
In this short paper, we consider discrete-time Markov chains on lattices as approximations to continuous-time diffusion processes. The approximations can be interpreted as finite difference schemes for the generator of the process. We…
We survey recent results concerning the total-variation mixing time of the simple exclusion process on the segment (symmetric and asymmetric) and a continuum analog, the simple random walk on the simplex with an emphasis on cutoff results.…
We prove that any Markov chain that performs local, reversible updates on randomly chosen vertices of a bounded-degree graph necessarily has mixing time at least $\Omega(n\log n)$, where $n$ is the number of vertices. Our bound applies to…