相关论文: Path decompositions for Markov chains

We develop a general theory of Markov chains realizable as random walks on $\mathscr R$-trivial monoids. It provides explicit and simple formulas for the eigenvalues of the transition matrix, for multiplicities of the eigenvalues via…

The study of Markov chains on discrete spaces, such as digraphs, has captivated mathematicians in recent decades due to its interconnectedness with topology, geometry, dynamics, spectral theory, and differential equations. Furthermore,…

We study a class of multitype branching L\'evy processes, where particles move according to type-dependent L\'evy processes, switch types via an irreducible Markov chain, and branch according to type-dependent laws. This framework…

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…

A function on the state space of a Markov chain is a "lumping" if observing only the function values gives a Markov chain. We give very general conditions for lumpings of a large class of algebraically-defined Markov chains, which include…

In this paper, it is shown that every polynomial function is mixed monotone globally with a polynomial decomposition function. For univariate polynomials, the decomposition functions can be constructed from the Gram matrix representation of…

We consider the problem of stochastic flow of multiple particles traveling on a closed loop, with a constraint that particles move without passing. We use a Markov chain description that reduces the problem to a generalized random walk on a…

We consider Markov chains which are polynomially mixing, in a weak sense expressed in terms of the space of functions on which the mixing speed is controlled. In this context, we prove polynomial large and moderate deviations inequalities.…

A constructive proof is given to the fact that any ergodic Markov chain can be realized as a random walk subject to a synchronizing road coloring. Redundancy (ratio of extra entropy) in such a realization is also studied.

The two-parameter Macdonald polynomials are a central object of algebraic combinatorics and representation theory. We give a Markov chain on partitions of k with eigenfunctions the coefficients of the Macdonald polynomials when expanded in…

We show that the convergence of finite state space Markov chains to stationarity can often be considerably speeded up by alternating every step of the chain with a deterministic move. Under fairly general conditions, we show that not only…

This paper develops a systematic treatment of monotonicity-based pathwise dualities for Markov processes taking values in partially ordered sets. We show that every Markov process that takes values in a finite partially ordered set and…

Locally Markov walks are natural generalizations of classical Markov chains, where instead of a particle moving independently of the past, it decides where to move next depending on the last action performed at the current location. We…

We ask if it is possible to find some particular continuous paths of unit length in linear Brownian motion. Beginning with a discrete version of the problem, we derive the asymptotics of the expected waiting time for several interesting…

In this work we generalize Polya urn schemes with possibly infinitely many colors and extend the earlier models described in [4, 5, 7]. We provide a novel and unique approach of representing the observed sequence of colors in terms a…

We consider certain questions pertaining to noncommutative generalized Brownian motions with multiple processes. We establish a framework for generalized Brownian motion with multiple processes similar to that defined by Guta and prove…

Let X and Y be independent transient Markov chains on the same state space that have the same transition probabilities. Let L denote the ``loop-erased path'' obtained from the path of X by erasing cycles when they are created. We prove that…

A careful look at rough path topology applied to Brownian motion reveals new possible properties of the well-known L\'evy area, in particular the presence of an intrinsic drift of this area. Using renormalization limit of Markov chains on…

We consider a Markov-modulated Brownian motion reflected to stay in a strip [0,B]. The stationary distribution of this process is known to have a simple form under some assumptions. We provide a short probabilistic argument leading to this…

For Markov chains with a partially ordered finite state space we show strong stationary duality under the condition of M\"obius monotonicity of the chain. We show relations of M\"obius monotonicity to other definitions of monotone chains.…