Related papers: Fast mixing of a randomized shift-register Markov …

We consider Markovian models on graphs with local dynamics. We show that, under suitable conditions, such Markov chains exhibit both rapid convergence to equilibrium and strong concentration of measure in the stationary distribution. We…

We consider the piecewise-deterministic Markov process obtained by randomly switching between the flows generated by a finite set of smooth vector fields on a compact set. We obtain H\"ormander-type conditions on the vector fields…

The decreasing Markov chain on \{1,2,3, \ldots\} with transition probabilities $p(j,j-i) \propto 1/i$ arises as a key component of the analysis of the beta-splitting random tree model. We give a direct and almost self-contained…

We consider an elementary model for self-organised criticality, the activated random walk on the complete graph. We introduce a discrete time Markov chain as follows. At each time step, we add an active particle at a random vertex and let…

Variable-length Markov chains on finite quivers provide a natural framework for context-dependent stochastic growth under incidence constraints. I study quiver-valued variable-length Markov chains observed through finite boundary windows…

In this paper, we study consistent and partially exchangeable sequences of Markov chains on a finite state space. We provide a characterisation of the admissible transition rates via a decomposition into individual and coordinated motion of…

In this paper we establish a large deviations type estimate for strongly mixing Markov chains with respect to the Lp norm. As applications we derive such estimates for the iterates of a locally constant random cocycle with mixed rank, as…

The spectral gap $\gamma$ of a finite, ergodic, and reversible Markov chain is an important parameter measuring the asymptotic rate of convergence. In applications, the transition matrix $P$ may be unknown, yet one sample of the chain up to…

This paper studies Markov chains on the symmetric group $S_n$ where the transition probabilities are given by the Ewens distribution with parameter $\theta>1$. The eigenvalues are identified to be proportional to the content polynomials of…

Dealing with finite Markov chains in discrete time, the focus often lies on convergence behavior and one tries to make different copies of the chain meet as fast as possible and then stick together. There is, however, a very peculiar kind…

We study Markov chains on $\mathbb Z^m$, $m\geq 2$, that behave like a standard symmetric random walk outside of the hyperplane (membrane) $H=\{0\}\times \mathbb Z^{m-1}$. The transition probabilities on the membrane $H$ are periodic and…

We study $k$-divisible partition structures, which are families of random set partitions whose block sizes are divisible by an integer $k=1,2,\ldots$. In this setting, exchangeability corresponds to the usual invariance under relabeling by…

The $n$-dimensional random twisted hypercube $\mathbf{G}_n$ is constructed recursively by taking two instances of $\mathbf{G}_{n-1}$, with any joint distribution, and adding a random perfect matching between their vertex sets. Benjamini,…

Motivated by a derandomization of Markov chain Monte Carlo (MCMC), this paper investigates deterministic random walks, which is a deterministic process analogous to a random walk. While there are several progresses on the analysis of the…

We demonstrate an approach to the numerical solution of nonlinear stochastic differential equations with Markovian switching. Such equations describe the stochastic dynamics of processes where the drift and diffusion coefficients are…

Motivated by applications arising in networked systems, this work examines controlled regime-switching systems that stem from a mean-variance formulation. A main point is that the switching process is a hidden Markov chain. An additional…

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…

Let $\sigma$ be a permutation of $\{0,\ldots,n\}$. We consider the Markov chain $X$ which jumps from $k\neq 0,n$ to $\sigma(k+1)$ or $\sigma(k-1)$, equally likely. When $X$ is at 0 it jumps to either $\sigma(0)$ or $\sigma(1)$ equally…

We study a simple Markov chain, the switch chain, on the set of all perfect matchings in a bipartite graph. This Markov chain was proposed by Diaconis, Graham and Holmes as a possible approach to a sampling problem arising in Statistics. We…

The switch chain is a well-studied Markov chain which generates random graphs with a given degree sequence and has uniform stationary distribution. Motivated by the high number of triangles seen in some real-world networks, we study a…