Related papers: Irreversible local Markov chains with rapid conver…
Computing optimal conditional reachability probabilities in Markov decision processes (MDPs) is tractable by a reduction to reachability probabilities. Yet, this reduction yields cyclic, challenging MDPs that are often notoriously hard to…
We investigate a rich new class of exactly solvable particle systems generalizing the Totally Asymmetric Simple Exclusion Process (TASEP). Our particle systems can be thought of as new exactly solvable examples of tandem queues, directed…
We study the approximation of a Markov chain on a reduced state space, for both discrete- and continuous-time Markov chains. In this context, we extend the existing theory of formal error bounds for the approximated transient distributions.…
In this paper, we study a biased version of the nearest-neighbor transposition Markov chain on the set of permutations where neighboring elements $i$ and $j$ are placed in order $(i,j)$ with probability $p_{i,j}$. Our goal is to identify…
We investigate whether the dynamical lattice supersymmetry discussed for various Hamiltonians, including one-dimensional quantum spin chains, by Fendley et.al. and Hagendorf et.al. might also exist for the Markov matrices of any…
There has been considerable interest in designing Markov chain Monte Carlo algorithms by exploiting numerical methods for Langevin dynamics, which includes Hamiltonian dynamics as a deterministic case. A prominent approach is Hamiltonian…
The efficient calculation of rare-event kinetics in complex dynamical systems, such as the rate and pathways of ligand dissociation from a protein, is a generally unsolved problem. Markov state models can systematically integrate ensembles…
The partially asymmetric exclusion process (PASEP) is an important model from statistical mechanics which describes a system of interacting particles hopping left and right on a one-dimensional lattice of N sites. It is partially asymmetric…
Equilibrium systems evolve according to Detailed Balance (DB). This principe guided development of the Monte-Carlo sampling techniques, of which Metropolis-Hastings (MH) algorithm is the famous representative. It is also known that DB is…
We study the SIRS (Susceptible-Infected-Recovered-Susceptible) spreading processes over complex networks, by considering its exact $3^n$-state Markov chain model. The Markov chain model exhibits an interesting connection with its $2n$-state…
In this paper it is shown that adaptive importance sampling algorithms converge at exponential rate for Markov chain expectation problems that admit a combination of a filtered estimator and a Markov zero-variance measure. It extends a…
We consider spin systems with nearest-neighbor interactions on an $n$-vertex $d$-dimensional cube of the integer lattice graph $\mathbb{Z}^d$. We study the effects that exponential decay with distance of spin correlations, specifically the…
The first paper in this series introduced a \emph{short-to-long mixing} condition that captures mean-field GOE/GUE edge universality in the supercritical sparsity regime, for symmetric/Hermitian random matrices with independent entries and…
Markov Chain Monte Carlo methods are widely used in signal processing and communications for statistical inference and stochastic optimization. In this work, we introduce an efficient adaptive Metropolis-Hastings algorithm to draw samples…
We prove a central limit theorem for a class of additive processes that arise naturally in the theory of finite horizon Markov decision problems. The main theorem generalizes a classic result of Dobrushin (1956) for temporally…
Convergence rate analyses of random walk Metropolis-Hastings Markov chains on general state spaces have largely focused on establishing sufficient conditions for geometric ergodicity or on analysis of mixing times. Geometric ergodicity is a…
We study the Markov chain on $\mathbf{F}_p$ obtained by applying a function $f$ and adding $\pm\gamma$ with equal probability. When $f$ is a linear function, this is the well-studied Chung--Diaconis--Graham process. We consider two cases:…
One of the most widely used samplers in practice is the component-wise Metropolis-Hastings (CMH) sampler that updates in turn the components of a vector valued Markov chain using accept-reject moves generated from a proposal distribution.…
Motivated by the physics of strings and branes, we develop a class of Markov chain Monte Carlo (MCMC) algorithms involving extended objects. Starting from a collection of parallel Metropolis-Hastings (MH) samplers, we place them on an…
\emph{Sampling} constitutes an important tool in a variety of areas: from machine learning and combinatorial optimization to computational physics and biology. A central class of sampling algorithms is the \emph{Markov Chain Monte Carlo}…