Academia.edu no longer supports Internet Explorer.
To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to upgrade your browser.
1996, The Annals of Probability
…
17 pages
1 file
Suppose that X is a positive recurrent Harris chain with invariant measure 't. We develop a Lyapunov function criterion that permits one to bound the solution g to Poisson's equation for X. This bound is then applied to obtain sufficient conditions that guarantee that the solution be an element of LP(ir). When p = 2, the square integrability of g implies the validity of a functional central limit theorem for the Markov chain. We illustrate the technique with applications to the w-ting time sequence of the single-server queue and autoregressive sequences.
In this paper we consider-irreducible Markov processes evolving in discrete or continuous time, on a general state space. We develop a Lyapunov function criterion that permits one to obtain explicit bounds on the solution to Poisson's equation and, in particular, obtain conditions under which the solution is square integrable. These results are applied to obtain su cient conditions that guarantee the validity of a functional central limit theorem for the Markov process. As a second consequence of the bounds obtained, a perturbation theory for Markov processes is developed which gives conditions under which both the solution to Poisson's equation and the invariant probability for the process are continuous functions of its transition kernel. The techniques are illustrated with applications to queueing theory and autoregressive processes.
Journal of Applied Probability, 2012
In this paper we study the functional central limit theorem (CLT) for stationary Markov chains with a self-adjoint operator and general state space. We investigate the case when the variance of the partial sum is not asymptotically linear in n, and establish that conditional convergence in distribution of partial sums implies the functional CLT. The main tools are maximal inequalities that are further exploited to derive conditions for tightness and convergence to the Brownian motion.
Probability Theory and Related Fields, 1988
We study uniform limit theorems for regenerative processes and get strong law of large numbers and central limit theorem of this type. Then we apply those results to Harris recurrent Markov chains based on some ideas of K. Athreya, P. Ney and E. Nummelin.
2003
In this paper we prove the Poisson Hypothesis for the limiting behavior of the large queueing systems in some simple cases. We show in particular that the corresponding dynamical systems, defined by the non-linear Markov processes, have a line of fixed points which are global attractors. To do this we derive the corresponding nonlinear integral equation and we explore its self-averaging properties.
Applied Mathematics and Computation, 2021
Poisson's equation has a lot of applications in various areas. Usually it is hard to derive the explicit expression of the solution of Poisson's equation for a Markov chain on an infinitely many state space. We will present a computational framework for the solution for both discretetime Markov chains (DTMCs) and continuous-time Markov chains (CTMCs), by developing the technique of augmented truncation approximations. The convergence to the solution is investigated in terms of the assumption about the monotonicity of the first return times, and is further established for two types of truncation approximation schemes: the censored chain and the linear augmented truncation. Moreover, truncation approximations to the variance constant in central limit theorems (CLTs) are also considered. The results obtained are applied to discrete-time single-birth processes and continuous-time single-death processes.
Communications in Computer and Information Science, 2020
Generalization of the Lorden's inequality is an excellent tool for obtaining strong upper bounds for the convergence rate for various complicated stochastic models. This paper demonstrates a method for obtaining such bounds for some generalization of the Markov modulated Poisson process (MMPP). The proposed method can be applied in the reliability and queuing theory.
2003
Using elementary methods, we prove that for a countable Markov chain $P$ of ergodic degree $d > 0$ the rate of convergence towards the stationary distribution is subgeometric of order $n^{-d}$, provided the initial distribution satisfies certain conditions of asymptotic decay. An example, modelling a renewal process and providing a markovian approximation scheme in dynamical system theory, is worked out in detail, illustrating the relationships between convergence behaviour, analytic properties of the generating functions associated to transition probabilities and spectral properties of the Markov operator $P$ on the Banach space $\ell_1$. Explicit conditions allowing to obtain the actual asymptotics for the rate of convergence are also discussed.
Probability Theory and Related Fields, 2003
The aim of this paper is to prove a central limit theorem and an invariance principle for an additive functional of an ergodic Markov chain on a general state space, with respect to the law of the chain started at a point. No irreducibility assumption nor mixing conditions are imposed; the only assumption bears on the growth of the L 2-norms of the ergodic sums for the function generating the additive functional, which must be O(n α) with α < 1 2. The result holds almost surely with respect to the invariant probability of the chain.
The Annals of Applied Probability, 2003
Consider the partial sums {S t } of a real-valued functional F (Φ(t)) of a Markov chain {Φ(t)} with values in a general state space. Assuming only that the Markov chain is geometrically ergodic and that the functional F is bounded, the following conclusions are obtained:
arXiv: Probability, 2020
Generalization of the Lorden's inequality is an excellent tool for obtaining strong upper bounds for the convergence rate for various complicated stochastic models. This paper demonstrates a method for obtaining such bounds for some generalization of the Markov modulated Poisson process (MMPP). The proposed method can be applied in the reliability and queuing theory.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.
Arxiv preprint arXiv:1112.2751, 2011
Electronic Journal of Probability, 2005
Stochastic Processes and their Applications, 2000
ESAIM: Probability and Statistics, 2019
Publications of the Research Institute for Mathematical Sciences, 1976
Lecture Notes in Computer Science, 2012
J. Math. Anal. Appl., 2016
Colloquium Mathematicum, 2010
The Annals of Applied Probability, 2009
Zeitschrift für Analysis und ihre Anwendungen
Cornell University - arXiv, 2022
Journal of Applied Probability, 2011
Stochastic Processes and their Applications, 1985
Queueing Systems, 2009
Nagoya mathematical journal