Related papers: Path decompositions for Markov chains

We consider a multidimensional Markov Chain $X$ converging to a multidimensional Brownian Motion. We construct a positive harmonic function for $X$ killed on exiting the cone. We show that its asymptotic behavior is similar to that of to…

A discrete-time Markov chain can be transformed into a new Markov chain by looking at its states along iterations of an almost surely finite stopping time. By the optional stopping theorem, any bounded harmonic function with respect to the…

In this paper we show a decomposition of the bifractional Brownian motion with parameters H,K into the sum of a fractional Brownian motion with Hurst parameter HK plus a stochastic process with absolutely continuous trajectories. Some…

We study a decomposition of a general Markov process in a manifold invariant under a Lie group action into a radial part (transversal to orbits) and an angular part (along an orbit). We show that given a radial path, the conditioned angular…

This work is a numerical experiment of stochastic motion of conservative Hamiltonian system or weakly damped Brownian particles. The objective is to prove the existence of path probability and to compute its values. By observing a large…

We study a model for the entanglement of a two-dimensional reflecting Brownian motion in a bounded region divided into two halves by a wall with three or more small windows. We map the Brownian motion into a Markov Chain on the fundamental…

We investigate polyharmonic functions associated to Brownian motion and random walks in cones. These are functions which cancel some power of the usual Laplacian in the continuous setting and of the discrete Laplacian in the discrete…

We provide a decomposition of the trace of the Brownian motion into a simple path and an independent Brownian soup of loops that intersect the simple path. More precisely, we prove that any subsequential scaling limit of the loop erased…

Many seemingly disparate Markov chains are unified when viewed as random walks on the set of chambers of a hyperplane arrangement. These include the Tsetlin library of theoretical computer science and various shuffling schemes. If only…

It is known that after scaling a random Motzkin path converges to a Brownian excursion. We prove that the fluctuations of the counting processes of the ascent steps, the descent steps and the level steps converge jointly to linear…

In this paper, we study discrete approximation of reflected Brownian motions on domains in Euclidean space. Our approximation is given by a sequence of Markov chains on partitions of the domain, where we allow uneven or random partitions.…

A universal method for the concatenation of a sequence of Markov right processes is established. It is then applied to the continued pasting of two Markov right processes, which can be used for pathwise constructions of locally defined…

Random walks in cones have the double interest of being at the heart of many probabilistic problems and of being related to many mathematical fields, such as spectral theory, combinatorics, or discrete complex analysis. In this article, we…

We develop a general theory for Markov chains whose transition probabilities are the coefficients of descent operators on combinatorial Hopf algebras. These model the breaking-then-recombining of combinational objects. Examples include the…

Random walk is one of the most classical and well-studied model in probability theory. For two correlated random walks on lattice, every step of the random walks has only two states, moving in the same direction or moving in the opposite…

Markov chains are studied in a formulation involving forces and fluxes. First, the iso-dissipation force recently introduced in the physics literature is investigated; we show that its non-uniqueness is linked to different notions of…

We study the Langevin equation with both a white noise and a colored noise. We construct the Lagrangian as well as the Hamiltonian for the generalized Langevin equation which leads naturally to a path integral description from first…

In the Monge-Kantorovich transport problem, the transport cost is expressed in terms of transport maps or transport plans, which play crucial roles there. A variant of the Monge-Kantorovich problem is the ramified (branching) transport…

It is shown that the combinatorics of commutation relations is well suited for analyzing the convergence rate of certain Markov chains. Examples studied include random walk on irreducible representations, a local random walk on partitions…

In the literature, the spine decomposition of branching Markov processes was constructed under the assumption that each individual has at least one child. In this paper, we give a detailed construction of the spine decomposition of general…