Subgeometric Rates of Convergence for Discrete Time Markov Chains under Discrete Time Subordination
Chang-Song Deng

TL;DR
This paper investigates how certain subgeometric convergence rates of Markov chains are preserved under discrete time subordination, providing new insights into their invariant measure convergence behavior.
Contribution
It establishes conditions under which subgeometric convergence rates are inherited in discrete time Markov chains via subordination, extending continuous-time results.
Findings
Identifies three typical subgeometric convergence rates.
Provides moment estimates for discrete time subordinators.
Shows inheritance of convergence rates under specific conditions.
Abstract
In this note, we are concerned with the subgeometric rate of convergence of a Markov chain with discrete time parameter to its invariant measure in the -norm. We clarify how three typical subgeometric rates of convergence are inherited under a discrete time version of Bochner's subordination. The crucial point is to establish the corresponding moment estimates for discrete time subordinators under some reasonable conditions on the underlying Bernstein function.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMarkov Chains and Monte Carlo Methods · Point processes and geometric inequalities · Geometric Analysis and Curvature Flows
Subgeometric Rates
of Convergence for Discrete Time Markov Chains under Discrete Time Subordination
Chang-Song Deng
School of Mathematics and Statistics
Wuhan University
Wuhan 430072, China
Abstract.
In this paper, we are concerned with the subgeometric rate of convergence of a Markov chain with discrete time parameter to its invariant measure in the -norm. We clarify how three typical subgeometric rates of convergence are inherited under a discrete time version of Bochner’s subordination. The crucial point is to establish the corresponding moment estimates for discrete time subordinators under some reasonable conditions on the underlying Bernstein function.
Key words and phrases:
rate of convergence, subordination, Bernstein function, moment estimate, Markov chain
2010 Mathematics Subject Classification:
Primary: 60J05. Secondary: 60G50.
Financial support through the National Natural Science Foundation of China (11401442, 11831015) is gratefully acknowledged.
1. Introduction
This article is a continuation of the very recent work [10], where subgeometric rates of convergence are established for continuous time Markov processes under subordination in the sense of Bochner, and it aims to derive the analogous result when the time parameter is discrete. Readers are urged to refer to [7, Chapter 5] and [18, Chapters 13 and 15] for some background on the topic of convergence rates of Markov processes. For recent developments on subgeometric ergodicity, see e.g. [6, 11, 12, 13, 14, 22].
First, we recall the notion of discrete time subordinator, which is a discrete time counterpart of the classical continuous time subordinator (i.e. nondecreasing Lévy process on ) and was initialed in [5]; see also [1, 2, 3, 19, 20] for further developments on random walks under discrete time subordination. A function is a Bernstein function if is a -function satisfying for all (here denotes the -th derivative of ). It is well known, see e.g. [23, Theorem 3.2], that every Bernstein function has a unique Lévy–Khintchine representation
[TABLE]
where is the killing term, is the drift term and is a Radon measure on such that . As usual, we make the convention that . For our purpose, we will assume that has no killing term (i.e. ); that is, is of the form
[TABLE]
where and are as above. Without loss of generality, we also assume that ; otherwise, we replace by .
For , we set
[TABLE]
Since
[TABLE]
we know that gives rise to a probability measure on , and hence we can define a random walk on by , where is a sequence of independent and identically distributed random variables with for . As a strictly increasing process, the random walk is called a discrete time subordinator associated with the Bernstein function . Obviously, , and for with ,
[TABLE]
Let be a Markov chain on a general measurable state space , and denote by the -step transition kernel. Throughout this paper, we always assume that and are independent, and that has an invariant measure :
[TABLE]
The subordinate process is given by the random time-change . The process is again a Markov chain, and it follows easily from the independence of and that the -step transition kernel of is
[TABLE]
This implies that is also invariant for the time-changed chain .
For a (measurable) control function , the -norm (cf. [18, Chapter 14]) of a signed measure on is defined as , where the supremum ranges over all measurable functions with , and . If , then the -norm reduces to the total variation norm ; since , we always have ; if furthermore is bounded then these two norms are equivalent.
It is said that the process has subgeometric convergence in the -norm if
[TABLE]
where is a positive constant depending on and is a nonincreasing function with and as . Here, is called the subgeometric rate. In many specific models, the convergence rate can be explicitly given and typical examples contain
[TABLE]
where , and are some constants. Let and be a sequence such that , for all , and . Consider the backward recurrence time chain (cf. [18, Section 3.3.1]) on the countable state space with one-step transition kernel given by for all . Then this chain admits the convergence rates in (1.4) under some assumptions, see [12, Section 3.1] for details.
In recent years, there has been an increasing interest in the stability of properties of continuous time Markov processes and their semigroups under Bochner’s subordination. See [16] for the dimension-free Harnack inequality for subordinate semigroups, [8] for shift Harnack inequality for subordinate semigroups, [9] for the quasi-invariance property of Brownian motion under random time-change, and [10] for subgeometric rates of convergence for continuous time Markov processes under continuous time subordination. Subordinate functional inequalities can be found in [4, 15, 24].
It is a natural question whether subgeometric rates of convergence can be preserved under discrete time subordination. If is subgeometrically convergent to in the -norm, is it possible to derive quantitative bounds on the convergence rates of the subordinate Markov chain ? What we are going to do is to find some function such that and
[TABLE]
for some constant depending only on . As in [10], it turns out that if the convergence rates of the original chain are of the three typical forms in (1.4), then we are able to obtain convergence rates for the subordinate Markov chain under some reasonable assumptions on the underlying Bernstein function.
The main result of this note is the following. As usual, denote by the inverse function of the (strictly increasing) Bernstein function .
Theorem 1.1**.**
Let be a discrete time Markov chain and an independent discrete time subordinator associated with Bernstein function given by (1.1) such that .
- a)
Assume that (1.3) holds with rate for some constants and . If
[TABLE]
for some constants and , then (1.5) holds with rate
[TABLE]
where . 2. b)
Assume that (1.3) holds with rate for some constant . If
[TABLE]
then (1.5) holds with rate
[TABLE] 3. c)
Assume that (1.3) holds with rate for some constant . Then (1.5) holds with rate
[TABLE]
Remark 1.2**.**
a) According to [10, Lemma 2.2 (ii)], the second condition in (1.7) is equivalent to
[TABLE]
b) Let and with . In this case, it is clear that (1.6) holds, and by the formula [23, p. vii]
[TABLE]
we know that the corresponding Bernstein function (1.1) is given by the fractional power function . One can construct more examples for (1.6) by choosing , where , , and is another Lévy measure on such that
[TABLE]
c) As pointed out in [10, Remark 1.1], typical examples for Bernstein function satisfying (1.7) are
- •
;
- •
with and ;
- •
with ;
- •
with .
See [23, Chapter 16] for more examples of such Bernstein functions.
The rest of this paper is organized as follows. Section 2 is devoted to three types of moment estimates for discrete time subordinators, which will be crucial for the proof of Theorem 1.1; we stress that this part is of some interest on its own. In Section 3, we present the proof of Theorem 1.1. Finally, we give in the Appendix an elementary inequality, which has been used in Section 2.
2. Moment estimates for
discrete time subordinators
Recall that a continuous time subordinator associated with Bernstein function is a nondecreasing Lévy process taking values in and with Laplace transform
[TABLE]
The following result concerning moment estimates for continuous time subordinators is taken from [10, Theorem 2.1].
Lemma 2.1**.**
Let be a continuous time subordinator associated with Bernstein function given by (1.1).
- a)
Let and . If (1.6) holds for some constants and , then there exists a constant such that
[TABLE] 2. b)
Let . If the Bernstein function satisfies (1.7), then there exists a constant such that
[TABLE]
Analogous to Lemma 2.1, we shall establish the corresponding results for discrete time subordinators. For related moment estimates for general Lévy(-type) processes, we refer to [8, 17].
Our main contribution in this section is the following result.
Theorem 2.2**.**
Let be a discrete time subordinator associated with Bernstein function given by (1.1) such that .
- a)
Let and . If (1.6) holds for some constants and , then there exists a constant such that
[TABLE] 2. b)
Let . If the Bernstein function satisfies (1.7), then there exists a constant such that
[TABLE]
In order to prove Theorem 2.2, we first present a general result to bound the completely monotone moment of a discrete time subordinator by that of a continuous time subordinator.
A function is called a completely monotone function if is of class and for all , see [23, Chapter 1]. By the celebrated theorem of Bernstein (cf. [23, Theorem 1.4]), every completely monotone function is the Laplace transform of a unique measure on . More precisely, if is a completely monotone function, then there exists a unique measure on such that
[TABLE]
Since the function () is a (complete) Bernstein function, it follows easily from [23, Theorem 3.7] that the following functions
[TABLE]
are completely monotone functions, where , , and . Indeed, one has for and (see [21]),
[TABLE]
where
[TABLE]
moreover, for ,
[TABLE]
Lemma 2.3**.**
Let be a discrete time subordinator with Bernstein function given by (1.1) such that . Let be a continuous time subordinator with the same Bernstein function . If is a completely monotone function, then
[TABLE]
Proof.
By the representation formula (2.1) and Tonelli’s theorem,
[TABLE]
Note that for ,
[TABLE]
which does not exceed according to Lemma 4.1 in the Appendix. Then we have for all ,
[TABLE]
which was to be proved. ∎
Proof of Theorem 2.2.
Since the functions given in (2.2) are completely monotone functions, we only need to combine Lemma 2.3 with Lemma 2.1 to get the desired estimates. ∎
Since , the following lemma is clear.
Lemma 2.4**.**
Let be a discrete time subordinator associated with Bernstein function given by (1.1) such that . For any and ,
[TABLE]
3. Proof of Theorem 1.1
Lemma 3.1**.**
If (1.3) holds with some rate , then so does (1.5) with rate .
Proof.
It holds from (1.2) and (1.3) that
[TABLE]
and hence the claim follows. ∎
Proof of Theorem 1.1.
The assertion follows immediately by combining Lemma 3.1 with the moment estimates for discrete time subordinators derived in Theorem 2.2 and Lemma 2.4. ∎
4. Appendix
If is a concave function, then it is easy to see that
[TABLE]
Lemma 4.1**.**
Let be a concave function such that and is differentiable on with . Then
[TABLE]
In particular, the above inequality holds if is a Bernstein function (not necessarily with ).
Proof.
Let
[TABLE]
It follows from (4.1) that for ,
[TABLE]
whence
[TABLE]
Now we obtain from (4.1) and (4.2) that for ,
[TABLE]
It remains to consider the case that . Since is concave and differentiable on , we know that is nonincreasing on . For , by the elementary inequality that , we obtain
[TABLE]
Moreover, by (4.1) one has for ,
[TABLE]
which yields that
[TABLE]
Combining this with (4.3), we find for ,
[TABLE]
This implies that is nondecreasing on and thus for all ,
[TABLE]
which completes the proof. ∎
Acknowledgements**.**
The author would like to thank an anonymous referee for careful reading and useful suggestions.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Bendikov, A. and Cygan, W. (2015). Alpha-stable random walk has massive thorns. Colloq. Math. 138, 105–129.
- 2[2] Bendikov, A. and Cygan, W. (2015). On massive sets for subordinated random walks. Math. Nachr. 288, 841–853.
- 3[3] Bendikov, A., Cygan, W. and Trojan, B. (2017). Limit theorems for random walks. Stoch. Proc. Appl. 127, 3268–3290.
- 4[4] Bendikov, A. and Maheux, P. (2007). Nash-type inequalities for fractional powers of non-negative self-adjoint operators. Trans. Amer. Math. Soc. 359, 3085–3097.
- 5[5] Bendikov, A. and Saloff-Coste, L. (2012). Random walks on groups and discrete subordination. Math. Nachr. 285, 580–605.
- 6[6] Butkovsky, O. (2014). Subgeometric rates of convergence of Markov processes in the Wasserstein metric. Ann. Appl. Probab. 24, 526–552.
- 7[7] Chen, M.-F. (2005). Eigenvalues, Inequalities and Ergodicity . Springer, Singapore.
- 8[8] Deng, C.-S. and Schilling, R. L. (2015). On shift Harnack inequalities for subordinate semigroups and moment estimates for Lévy processes. Stoch. Proc. Appl. 125, 3851–3878.
