相关论文: Computing the Yaglom limit of Markov chains with a…

In this paper we provide the analysis of the limiting conditional distribution (Yaglom limit) for stochastic fluid models (SFMs), a key class of models in the theory of matrix-analytic methods. So far, transient and stationary analyses of…

After reviewing the behavioral studies of working memory and of the cellular substrate of the latter, we argue that metastable states constitute candidates for the type of transient information storage required by working memory. We then…

We establish the existence and uniqueness of quasi-stationary and quasi-ergodic measures for almost surely absorbed discrete-time Markov chains under weak conditions. We obtain our results by exploiting Banach lattice properties of…

For a Markov chain $Y$ with values in a Polish space, consider the entrance Markov chain obtained by sampling $Y$ at the moments when it enters a fixed set $A$ from its complement $A^c$. Similarly, consider the exit Markov chain, obtained…

We present a new statistical test to detect that a presented state of a reversible Markov chain was not chosen from a stationary distribution. In particular, given a value function for the states of the Markov chain, we would like to…

We study the approximation of a Markov chain on a reduced state space, for both discrete- and continuous-time Markov chains. In this context, we extend the existing theory of formal error bounds for the approximated transient distributions.…

By proving a local limit theorem for higher-order transitions, we determine the time required for necklace chains to be close to stationarity. Because necklace chains, built by arranging identical smaller chains around a directed cycle, are…

We consider a slightly subcritical branching Brownian motion with absorption, where particles move as Brownian motions with drift $-\sqrt{2+2\varepsilon}$, undergo dyadic fission at rate $1$, and are killed when they reach the origin. We…

We investigate the problem of quantifying contraction coefficients of Markov transition kernels in Kantorovich ($L^1$ Wasserstein) distances. For diffusion processes, relatively precise quantitative bounds on contraction rates have recently…

We study scaling limits of non-increasing Markov chains with values in the set of non-negative integers, under the assumption that the large jump events are rare and happen at rates that behave like a negative power of the current state. We…

A Galton-Watson process in a varying environment is a discrete time branching process where the offspring distributions vary among generations. It is known that in the critical case, these processes have a Yaglom limit, that is, a suitable…

This work provides complete description of Quasistationary Distributions (QSDs) for Markov chains with a unique absorbing state and an irreducible set of non-absorbing states. As is well-known, every QSD has an associated absorption…

We obtain non-Gaussian limit laws for one-dimensional random walk in a random environment assuming that the environment is a function of a stationary Markov process. This is an extension of the work of Kesten, M. Kozlov and Spitzer for…

A Galton-Watson process in varying environment is a discrete time branching process where the offspring distributions vary among generations. Based on a two-spine decomposition technique, we provide a probabilistic argument of a Yaglom-type…

General characterizations of ergodic Markov chains have been developed in considerable detail. In this paper, we study the transience for discrete-time Markov chains on general state spaces, including the geometric transience and algebraic…

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…

We show how to map the states of an ergodic Markov chain to Euclidean space so that the squared distance between states is the expected commuting time. We find a minimax characterization of commuting times, and from this we get monotonicity…

We are interested in the connection between a metastable continuous state space Markov process (satisfying e.g. the Langevin or overdamped Langevin equation) and a jump Markov process in a discrete state space. More precisely, we use the…

We study a limit behavior of a sequence of Markov processes (or Markov chains) such that their distributions outside of any neighborhood of a "singular" point attract to some probability law. In any neighborhood of this point the behavior…

The time at which a one-dimensional continuous strong Markov process attains a boundary point of its state space is a discontinuous path functional and it is, therefore, unclear whether the exit time can be approximated by hitting times of…