English
Related papers

Related papers: Quasi-limiting estimates for periodic absorbed Mar…

200 papers

In this brief paper we find computable exponential convergence rates for a large class of stochastically ordered Markov processes. We extend the result of Lund, Meyn, and Tweedie (1996), who found exponential convergence rates for…

Probability · Mathematics 2018-10-19 Julia Gaudio , Saurabh Amin , Patrick Jaillet

Exponential stability of the nonlinear filtering equation is revisited, when the signal is a finite state Markov chain. An asymptotic upper bound for the filtering error due to incorrect initial condition is derived in the case of slowly…

Probability · Mathematics 2007-05-23 P. Chigansky

An algorithm for estimating quasi-stationary distribution of finite state space Markov chains has been proven in a previous paper. Now this paper proves a similar algorithm that works for general state space Markov chains under very general…

Probability · Mathematics 2015-03-04 Jose H. Blanchet , Peter Glynn , Shuheng Zheng

Asymptotic expansions with explicit upper bounds for remainders are given for stationary distributions of nonlinearly perturbed semi-Markov processes with finite phase spaces. The corresponding algorithms are based on a special technique of…

Probability · Mathematics 2016-03-16 Dmitrii Silvestrov , Sergei Silvestrov

When the initial and transition probabilities of a finite Markov chain in discrete time are not well known, we should perform a sensitivity analysis. This can be done by considering as basic uncertainty models the so-called credal sets that…

Probability · Mathematics 2009-11-24 Gert de Cooman , Filip Hermans , Erik Quaeghebeur

In this work, we study a natural nonparametric estimator of the transition probability matrices of a finite controlled Markov chain. We consider an offline setting with a fixed dataset, collected using a so-called logging policy. We develop…

Machine Learning · Statistics 2026-03-17 Imon Banerjee , Harsha Honnappa , Vinayak Rao

In this paper we investigate the continuum limits of a class of Markov chains. The investigation of such limits is motivated by the desire to model very large networks. We show that under some conditions, a sequence of Markov chains…

Networking and Internet Architecture · Computer Science 2011-06-22 Yang Zhang , Edwin K. P. Chong , Jan Hannig , Donald Estep

The long time behavior of an absorbed Markov process is well described by the limiting distribution of the process conditioned to not be killed when it is observed. Our aim is to give an approximation's method of this limit, when the…

Probability · Mathematics 2009-05-25 Denis Villemonais

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…

Probability · Mathematics 2012-01-06 Bénédicte Haas , Grégory Miermont

In this paper it is shown that adaptive importance sampling algorithms converge at exponential rate for Markov chain expectation problems that admit a combination of a filtered estimator and a Markov zero-variance measure. It extends a…

Probability · Mathematics 2018-07-11 Ludolf E. Meester

We are interested in the asymptotic behavior of Markov chains on the set of positive integers for which, loosely speaking, large jumps are rare and occur at a rate that behaves like a negative power of the current state, and such that small…

Probability · Mathematics 2018-02-19 Jean Bertoin , Igor Kortchemski

We provide explicit expressions for the constants involved in the characterisation of ergodicity of sub-geometric Markov chains. The constants are determined in terms of those appearing in the assumed drift and one-step minorisation…

Probability · Mathematics 2014-03-18 Christophe Andrieu , Gersende Fort , Matti Vihola

Let $(X,\p_x)$ be a continuous time Markov chain with finite or countable state space $S$ and let $T$ be its first passage time in a subset $D$ of $S$. It is well known that if $\mu$ is a quasi-stationary distribution relatively to $T$,…

Probability · Mathematics 2013-10-25 Romain Bourget , Loïc Chaumont , Natalia Sapoukhina

We give computable bounds on the rate of convergence of the transition probabilities to the stationary distribution for a certain class of geometrically ergodic Markov chains. Our results are different from earlier estimates of Meyn and…

Probability · Mathematics 2007-05-23 Peter H. Baxendale

The correspondence between the cross-entropy method and the zero-variance approximation to simulate a rare event problem in Markov chains is shown. This leads to a sufficient condition that the cross-entropy estimator is asymptotically…

Probability · Mathematics 2010-03-10 Ad Ridder

We present two data-driven procedures to estimate the transition density of an homogeneous Markov chain. The first yields to a piecewise constant estimator on a suitable random partition. By using an Hellinger-type loss, we establish…

Statistics Theory · Mathematics 2012-10-19 Mathieu Sart

We introduce the concept of a Markov influence system (MIS) and analyze its dynamics. An MIS models a random walk in a graph whose edges and transition probabilities change endogenously as a function of the current distribution. This…

Multiagent Systems · Computer Science 2019-03-28 Bernard Chazelle

This paper investigates the Gaussian quasi-likelihood estimation of an exponentially ergodic multidimensional Markov process, which is expressed as a solution to a L\'{e}vy driven stochastic differential equation whose coefficients are…

Statistics Theory · Mathematics 2013-08-14 Hiroki Masuda

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…

Neurons and Cognition · Quantitative Biology 2024-03-18 Christophe Pouzat , Morgan André

We study convergence properties of pseudo-marginal Markov chain Monte Carlo algorithms (Andrieu and Roberts [Ann. Statist. 37 (2009) 697-725]). We find that the asymptotic variance of the pseudo-marginal algorithm is always at least as…

Probability · Mathematics 2015-03-31 Christophe Andrieu , Matti Vihola
‹ Prev 1 3 4 5 6 7 10 Next ›