SearcharxivSearch

arXiv subjects

Erin Russell

Publications and source records attributed to Erin Russell.

2 recordsLinked to original sources

Coupling Markov chains with a common image chain

Consider time-homogeneous discrete-time Markov chains $X$, $Y$, and $Z$ on countable state spaces, considered as stochastic processes with specified initial distributions. Suppose for maps $f$ and $g$ that $(f(X_t))_{t \ge 0}$ and $(g(Y_t))_{t \ge 0}$ are both equal in law to $Z$. We prove that $X$ and $Y$ can be coupled so that $(X_t, Y_t)_{t \ge 0}$ is a homogeneous Markov chain with $f(X_t) = g(Y_t)$ for all $t \ge 0$. Without the assumption that $Z$ is Markov, no such Markov coupling exists in general, even an inhomogeneous one. Moreover, we give an explicit construction of such a coupling, with the additional property that $X$ and $Y$ are conditionally independent given the entire trajectory $(f(X_t))_{t \ge 0}$. Under the further assumption that $X$ and $Y$ are stationary, we construct a coupling having the above properties that is also stationary. In this case, conditional independence holds for the corresponding two-sided chains indexed by $\mathbb{Z}$ (but not necessarily for the one-sided versions). We prove further properties of our couplings in special cases where $f$ or $g$ satisfies the strong lumping condition (also known as Dynkin's condition) or the exact lumping condition (also known as the Pitman-Rogers condition). When $f$ is a strong lumping and $g$ is an exact lumping, we show that our coupling coincides with an intertwining of Markov chains as constructed by Diaconis and Fill.

math.PR

Weak lumping of left-invariant random walks on left cosets of finite groups

Let $G$ be a finite group and let $H$ be a subgroup of $G$. The left-invariant random walk driven by a probability measure $w$ on $G$ is the Markov chain in which from any state $x \in G$, the probability of stepping to $xg \in G$ is $w(g)$. The initial state is chosen randomly according to a given distribution. The walk is said to lump weakly on left cosets if the induced process on $G/H$ is a time-homogeneous Markov chain. We characterise all the initial distributions and weights $w$ such that the walk is irreducible and lumps weakly on left cosets, and determine all the possible transition matrices of the induced Markov chain. In the case where $H$ is abelian we refine our main results to give a necessary and sufficient condition for weak lumping by an explicit system of linear equations on $w$, organized by the double cosets $HxH$. As an application we consider shuffles of a deck of $n$ cards such that repeated observations of the top card form a Markov chain. Such shuffles include the random-to-top shuffle, and also, when the deck is started in a uniform random order, the top-to-random shuffle. We give a further family of examples in which our full theory of weak lumping is needed to verify that the top card sequence is Markov.

math.PR