Related papers: A note on faithful coupling of Markov chains
We define the spectral gap of a Markov chain on a finite state space as the second-smallest singular value of the generator of the chain, generalizing the usual definition of spectral gap for reversible chains. We then define the relaxation…
The theory of ``Markov-up'' processes is being developed. This is a new class of stochastic processes with ``partial'' markovian features; it could also be called ``one-sided Markov''. Such a behavior may be found in the real world and in…
We consider local alignments without gaps of two independent Markov chains from a finite alphabet, and we derive sufficient conditions for the number of essentially different local alignments with a score exceeding a high threshold to be…
We consider the irreducibility of switch-based Markov chains for the approximate uniform sampling of Hamiltonian cycles in a given undirected dense graph on $n$ vertices. As our main result, we show that every pair of Hamiltonian cycles in…
The Alexander theorem (1923) and the Markov theorem (1936) are two classical results in knot theory that show respectively that every link is the closure of a braid and that braids that have the same closure are related by a finite number…
Computational topology is a vibrant contemporary subfield and this article integrates knot theory and mathematical visualization. Previous work on computer graphics developed a sequence of smooth knots that were shown to converge point wise…
For general spin systems, we prove that a contractive coupling for any local Markov chain implies optimal bounds on the mixing time and the modified log-Sobolev constant for a large class of Markov chains including the Glauber dynamics,…
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 consider a random walk on a discrete connected graph having some infinite branches plus finitely many vertices with finite degrees. We find the generator of a strong stationary dual in the sense of Fill, and use it to find some…
While measures of concordance -- such as Spearman's rho, Kendall's tau, and Blomqvist's beta -- are continuous with respect to weak convergence, Chatterjee's rank correlation xi recently introduced in Azadkia and Chatterjee (2021) does not…
There has been a recent surge of interest in coupling methods for Markov chain Monte Carlo algorithms: they facilitate convergence quantification and unbiased estimation, while exploiting embarrassingly parallel computing capabilities.…
We prove that for a so-called sticky process $S$ there exists an equivalent probability $Q$ and a $Q$-martingale $\tilde{S}$ that is arbitrarily close to $S$ in $L^p(Q)$ norm. For continuous $S$, $\tilde{S}$ can be chosen arbitrarily close…
A mixing Markov chain is proved to be realized as a random walk in a directed graph subject to a synchronizing road coloring. The result ensures existence of appropriate random mappings in Propp--Wilson's coupling from the past. The proof…
The fidelity susceptibility and entanglement entropy in a system of two-leg $XXZ$ spin ladder with rung coupling is investigated by using exact diagonalization of the system. The effects of rung coupling on fidelity susceptibility,…
This paper formulates a notion of high-dimensional random dynamical systems that couple to another system, like an embedding environment, in such a way that each system engages in controlled exchange with the other system. Using the…
The well-known reflection coupling gives a maximal coupling of two one-dimensional Brownian motions with different starting points. Nevertheless, the reflection coupling does not generalize to more than two Brownian motions. In this paper,…
For a Coupled Map Lattice with a specific strong coupling emulating Stavskaya's probabilistic cellular automata, we prove the existence of a phase transition using a Peierls argument, and exponential convergence to the invariant measures…
In this letter we announce rigorous results that elucidate the relation between metastable states and low-lying eigenvalues in Markov chains in a much more general setting and with considerable greater precision as was so far available.…
Strong typicality and the Markov lemma have been used in the proofs of several multiterminal source coding theorems. Since these two tools can be applied to finite alphabets only, the results proved by them are subject to the same…
Consider a compact metric space $S$ and a pair $(j,k)$ with $k \ge 2$ and $1 \le j \le k$. For any probability distribution $\theta \in P(S)$, define a Markov chain on $S$ by: from state $s$, take $k$ i.i.d. ($\theta$) samples, and jump to…