Related papers: A multi-orthogonal polynomials' approach to bulk q…
We consider a stationary Markovian evolution with values on a disjointly partitioned set space $I\sqcup {\cal E}$. The evolution is visible (in the sense of knowing the transition probabilities) on the states in $I$ but not for the states…
We study discrete time Markov processes with periodic or open boundary conditions and with inhomogeneous rates in the bulk. The Markov matrices are given by the inhomogeneous transfer matrices introduced previously to prove the…
We study general properties for the family of stochastic processes with polynomial regression property, that is that every conditional moment of the process is a polynomial. It turns out that then there exists a family of polynomial…
We produce the first example of bounding total variation distance to stationarity and estimating mixing times via orthogonal polynomials diagonalization of discrete reversible Markov chains, the Karlin-McGregor approach.
This paper generalizes the notion of stochastic order to a relation between probability measures over arbitrary measurable spaces. This generalization is motivated by the observation that for the stochastic ordering of two stationary Markov…
We study the existence of densities for distributions of piecewise deterministic Markov processes. We also obtain relationships between invariant densities of the continuous time process and that of the process observed at jump times. In…
The idea of a parsing of a stationary process according to a collection of words is introduced, and the basic framework required for the asymptotic analysis of these parsings is presented. We demonstrate how the pointwise ergodic theorem…
This paper presents a new condition for the existence of optimal stationary policies in average-cost continuous-time Markov decision processes with unbounded cost and transition rates, arising from controlled queueing systems. This…
In this paper, we give a sufficient condition for the existence of a quasi-ergodic distribution for absorbing Markov processes. Using an orthogonal-polynomial approach, we prove that the previous main result is valid for the birth-death…
Arguing about the equilibrium distribution of continuous-time Markov chains can be vital for showing properties about the underlying systems. For example in biological systems, bistability of a chemical reaction network can hint at its…
Quantum computing is revolutionizing various fields, including operations research and queueing theory. This study presents a quantum method for simulating single-server Markovian (M/M/1) queues, making quantum computing more accessible to…
A variety of enhanced statistical and numerical methods are now routinely used to extract comprehensible and relevant thermodynamic information from the vast amount of complex, high-dimensional data obtained from intensive molecular…
Random walks are a fundamental model in applied mathematics and are a common example of a Markov chain. The limiting stationary distribution of the Markov chain represents the fraction of the time spent in each state during the stochastic…
The aim of this paper is to study some continuous-time bivariate Markov processes arising from group representation theory. The first component (level) can be either discrete (quasi-birth-and-death processes) or continuous (switching…
Direct simulation of biomolecular dynamics in thermal equilibrium is challenging due to the metastable nature of conformation dynamics and the computational cost of molecular dynamics. Biased or enhanced sampling methods may improve the…
We present a general black box theorem that ensures convergence of a sequence of stationary Markov processes, provided a few assumptions are satisfied. This theorem relies on a control of the resolvents of the sequence of Markov processes,…
We introduce an extension of the M/M/1 queueing process with a spatial structure and excluded- volume effect. The rule of particle hopping is the same as for the totally asymmetric simple exclusion process (TASEP). A stationary-state…
Donsker Theorem is perhaps the most famous invariance principle result for Markov processes. It states that when properly normalized, a random walk behaves asymptotically like a Brownian motion. This approach can be extended to general…
We study discretizations of polynomial processes using finite state Markov processes satisfying suitable moment matching conditions. The states of these Markov processes together with their transition probabilities can be interpreted as…
Brownian motion whose infinitesimal variance changes according to a three-state continuous time Markov Chain is studied. This Markov Chain can be viewed as a telegraph process with one on state and two off states. We first derive the…