scholarly journals Renewal approximation for the absorption time of a decreasing Markov chain

2016 ◽  
Vol 53 (3) ◽  
pp. 765-782 ◽  
Author(s):  
Gerold Alsmeyer ◽  
Alexander Marynych

AbstractWe consider a Markov chain (Mn)n≥0 on the set ℕ0 of nonnegative integers which is eventually decreasing, i.e. ℙ{Mn+1<Mn  |  Mn≥a}=1 for some a∈ℕ and all n≥0. We are interested in the asymptotic behavior of the law of the stopping time T=T(a)≔inf{k∈ℕ0:  Mk<a} under ℙn≔ℙ (·  |  M0=n) as n→∞. Assuming that the decrements of (Mn)n≥0 given M0=n possess a kind of stationarity for large n, we derive sufficient conditions for the convergence in the minimal Lp-distance of ℙn(T−an)∕bn∈·) to some nondegenerate, proper law and give an explicit form of the constants an and bn.

Cybernetics ◽  
1974 ◽  
Vol 8 (2) ◽  
pp. 193-196
Author(s):  
V. S. Korolyuk ◽  
I. P. Penev ◽  
A. F. Turbin

1994 ◽  
Vol 26 (4) ◽  
pp. 988-1005 ◽  
Author(s):  
Bernard Van Cutsem ◽  
Bernard Ycart

This paper studies the absorption time of an integer-valued Markov chain with a lower-triangular transition matrix. The main results concern the asymptotic behavior of the absorption time when the starting point tends to infinity (asymptotics of moments and central limit theorem). They are obtained using stochastic comparison for Markov chains and the classical theorems of renewal theory. Applications to the description of large random chains of partitions and large random ordered partitions are given.


1994 ◽  
Vol 26 (04) ◽  
pp. 988-1005 ◽  
Author(s):  
Bernard Van Cutsem ◽  
Bernard Ycart

This paper studies the absorption time of an integer-valued Markov chain with a lower-triangular transition matrix. The main results concern the asymptotic behavior of the absorption time when the starting point tends to infinity (asymptotics of moments and central limit theorem). They are obtained using stochastic comparison for Markov chains and the classical theorems of renewal theory. Applications to the description of large random chains of partitions and large random ordered partitions are given.


2021 ◽  
Vol 58 (2) ◽  
pp. 372-393
Author(s):  
H. M. Jansen

AbstractOur aim is to find sufficient conditions for weak convergence of stochastic integrals with respect to the state occupation measure of a Markov chain. First, we study properties of the state indicator function and the state occupation measure of a Markov chain. In particular, we establish weak convergence of the state occupation measure under a scaling of the generator matrix. Then, relying on the connection between the state occupation measure and the Dynkin martingale, we provide sufficient conditions for weak convergence of stochastic integrals with respect to the state occupation measure. We apply our results to derive diffusion limits for the Markov-modulated Erlang loss model and the regime-switching Cox–Ingersoll–Ross process.


2020 ◽  
Vol 2020 (1) ◽  
Author(s):  
Limei Dai

AbstractIn this paper, we study the Monge–Ampère equations $\det D^{2}u=f$ det D 2 u = f in dimension two with f being a perturbation of $f_{0}$ f 0 at infinity. First, we obtain the necessary and sufficient conditions for the existence of radial solutions with prescribed asymptotic behavior at infinity to Monge–Ampère equations outside a unit ball. Then, using the Perron method, we get the existence of viscosity solutions with prescribed asymptotic behavior at infinity to Monge–Ampère equations outside a bounded domain.


2020 ◽  
Vol 70 (6) ◽  
pp. 1457-1468
Author(s):  
Haroon M. Barakat ◽  
M. H. Harpy

AbstractIn this paper, we investigate the asymptotic behavior of the multivariate record values by using the Reduced Ordering Principle (R-ordering). Necessary and sufficient conditions for weak convergence of the multivariate record values based on sup-norm are determined. Some illustrative examples are given.


2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Raffaela Capitanelli ◽  
Maria Agostina Vivaldi

AbstractIn this paper, we study asymptotic behavior of solutions to obstacle problems for p-Laplacians as {p\to\infty}. For the one-dimensional case and for the radial case, we give an explicit expression of the limit. In the n-dimensional case, we provide sufficient conditions to assure the uniform convergence of the whole family of the solutions of obstacle problems either for data f that change sign in Ω or for data f (that do not change sign in Ω) possibly vanishing in a set of positive measure.


Symmetry ◽  
2021 ◽  
Vol 13 (6) ◽  
pp. 934
Author(s):  
Shyam Sundar Santra ◽  
Khaled Mohamed Khedher ◽  
Kamsing Nonlaopon ◽  
Hijaz Ahmad

The oscillation of impulsive differential equations plays an important role in many applications in physics, biology and engineering. The symmetry helps to deciding the right way to study oscillatory behavior of solutions of impulsive differential equations. In this work, several sufficient conditions are established for oscillatory or asymptotic behavior of second-order neutral impulsive differential systems for various ranges of the bounded neutral coefficient under the canonical and non-canonical conditions. Here, one can see that if the differential equations is oscillatory (or converges to zero asymptotically), then the discrete equation of similar type do not disturb the oscillatory or asymptotic behavior of the impulsive system, when impulse satisfies the discrete equation. Further, some illustrative examples showing applicability of the new results are included.


1991 ◽  
Vol 28 (1) ◽  
pp. 96-103 ◽  
Author(s):  
Daniel P. Heyman

We are given a Markov chain with states 0, 1, 2, ···. We want to get a numerical approximation of the steady-state balance equations. To do this, we truncate the chain, keeping the first n states, make the resulting matrix stochastic in some convenient way, and solve the finite system. The purpose of this paper is to provide some sufficient conditions that imply that as n tends to infinity, the stationary distributions of the truncated chains converge to the stationary distribution of the given chain. Our approach is completely probabilistic, and our conditions are given in probabilistic terms. We illustrate how to verify these conditions with five examples.


2014 ◽  
Vol 51 (4) ◽  
pp. 1114-1132 ◽  
Author(s):  
Bernhard C. Geiger ◽  
Christoph Temmel

A lumping of a Markov chain is a coordinatewise projection of the chain. We characterise the entropy rate preservation of a lumping of an aperiodic and irreducible Markov chain on a finite state space by the random growth rate of the cardinality of the realisable preimage of a finite-length trajectory of the lumped chain and by the information needed to reconstruct original trajectories from their lumped images. Both are purely combinatorial criteria, depending only on the transition graph of the Markov chain and the lumping function. A lumping is strongly k-lumpable, if and only if the lumped process is a kth-order Markov chain for each starting distribution of the original Markov chain. We characterise strong k-lumpability via tightness of stationary entropic bounds. In the sparse setting, we give sufficient conditions on the lumping to both preserve the entropy rate and be strongly k-lumpable.


Sign in / Sign up

Export Citation Format

Share Document