Related papers: Scaling limits of loop-erased Markov chains on res…

We use SLE(6) paths to construct a process of continuum nonsimple loops in the plane and prove that this process coincides with the full continuum scaling limit of 2D critical site percolation on the triangular lattice -- that is, the…

This paper is a variation on the uniform spanning tree theme. We use random spanning forests to solve the following problem: for a Markov process on a finite set of size $n$, find a probability law on the subsets of any given size $m \leq…

We prove the existence of limiting distributions for a large class of Markov chains on a general state space in a random environment. We assume suitable versions of the standard drift and minorization conditions. In particular, the system…

In this paper we give general criteria on tightness and weak convergence of discrete Markov chains to symmetric jump processes on metric measure spaces under mild conditions. As an application, we investigate discrete approximation for a…

Approximating the stationary probability of a state in a Markov chain through Markov chain Monte Carlo techniques is, in general, inefficient. Standard random walk approaches require $\tilde{O}(\tau/\pi(v))$ operations to approximate the…

We consider random partitions of the vertex set of a given finite graph that can be sampled by means of loop-erased random walks stopped at a random exponential time of parameter $q>0$. The related random blocks tend to cluster nodes…

A finite ergodic Markov chain exhibits cutoff if its distance to equilibrium remains close to its initial value over a certain number of iterations and then abruptly drops to near 0 on a much shorter time scale. Originally discovered in the…

Random walks are a fundamental model in applied mathematics and are a common example of a Markov chain. The limiting stationary distribution of the Markov chain represents the fraction of the time spent in each state during the stochastic…

Consider a finite irreducible Markov chain with invariant distribution $\pi$. We use the inner product induced by $\pi$ and the associated heat operator to simplify and generalize some results related to graph partitioning and the small-set…

A rescaled Markov chain converges uniformly in probability to the solution of an ordinary differential equation, under carefully specified assumptions. The presentation is much simpler than those in the outside literature. The result may be…

Motivated by various applications, we describe the scaling limits of bivariate Markov chains $(X,J)$ on $\mathbb Z_+ \times \{1,\ldots,\kappa\}$ where $X$ can be viewed as a position marginal and $\{1,\ldots,\kappa\}$ is a set of $\kappa$…

We study the random loop model with crosses and bars on sparse random graphs. Our main objective is to prove the existence of macroscopic loops, in the sense that a loop visits a positive proportion of the vertices. We develop a…

Reinforced processes are known to provide a stochastic representation for the quasi-stationary distribution of a given killed Markov process - describing the killed Markov process at fixed time instants. In this paper we shall adapt the…

We establish the scaling limit of a class of boundary random walks to the full spectrum of Brownian-type processes on the half-line. By solving the associated martingale problem and employing weak convergence techniques, we prove that under…

We provide explicit conditions, in terms of the transition kernel of its driving particle, for a Markov branching process to admit a scaling limit toward a self-similar growth-fragmentation with negative index. We also derive a scaling…

We study Markov chains on a lattice in a codimension-one stratified independent random environment, exploiting results established in [2]. First of all the random walk is transient in dimension at least three. Focusing on dimension two,…

We propose a model of random walks on weighted graphs where the weights are interval valued, and connect it to reversible imprecise Markov chains. While the theory of imprecise Markov chains is now well established, this is a first attempt…

In this paper, we study the scaling limit of a class of random walks which behave like simple random walks outside of a bounded region around the origin and which are subject to a partial reflection near the origin. If the probability of…

We consider critical percolation on the triangular lattice in a bounded simply connected domain with boundary conditions that force an interface between two prescribed boundary points. We say the interface forms a "near-loop" when it comes…

The irreducible decomposition of successive restriction and induction of irreducible representations of a symmetric group gives rise to a Markov chain on Young diagrams keeping the Plancherel measure invariant. Starting from this Res-Ind…