Next Article in Journal
On the Characterizations of Some Strongly Bounded Operators on C(K, X) Spaces
Previous Article in Journal
The Characterization of the Mechanical Harmonic Oscillator Extremum Envelope Shape According to Different Friction Types
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

The Dual Processes of a Class of Downwardly Skip-Free Processes

1
School of Mathematics and Statistics, Beijing Institute of Technology, Beijing 100872, China
2
Institute of Mathematics and Physics, Beijing Union University, Beijing 100101, China
*
Author to whom correspondence should be addressed.
Axioms 2025, 14(8), 555; https://doi.org/10.3390/axioms14080555
Submission received: 27 May 2025 / Revised: 14 July 2025 / Accepted: 21 July 2025 / Published: 23 July 2025

Abstract

We show that a class of downwardly skip-free processes can be regarded as the Siegmund dual of upwardly skip-free processes, which have been extensively studied in the literature. For such downwardly skip-free processes, using the duality method and existing results on upwardly skip-free processes, we provide explicit expressions for the extinction probability, the mean occupation time, the mean explosion time, and the mean extinction time. Additionally, we provide two examples to illustrate the main contributions of this work.

1. Introduction

Consider a continuous-time homogeneous Markov chain on Z + : = { 0 , 1 , 2 , } , with the transition rate matrix Q = ( q i j : i , j Z + ) . Following Chen [1], we call the Markov chain a downwardly skip-free process (or single death process), if Q satisfies q i , i 1 > 0 for all i 1 , and q i , i j = 0 for all i j 2 . We call the Markov chain an upwardly skip-free process (or single birth process), if Q satisfies q i , i + 1 > 0 , q i , i + j = 0 for all i Z + and j 2 . In this short note, we are only interested in totally stable transition rate matrices, which means that j i q i j q i i < for all i Z + .
Downwardly skip-free processes, as an important class of Markov chains, include several models such as birth–death processes and branching processes. Based on the explicit representation of the solution to the Poisson equation, various criteria for classical problems such as uniqueness, recurrence, ergodicity, exponential ergodicity, and strong ergodicity have been established for downwardly skip-free processes in [2,3,4]. However, it appears that some valuable quantities, including mean occupation time and mean explosion time, cannot be obtained using this method. Therefore, the main purpose of this note is to explore downwardly skip-free processes using a duality method, which does not rely on the representation of the solution to the Poisson equation. This duality, now known as Siegmund duality, was introduced in Siegmund [5] for Markov chains and aims to relate the entrance law of the original chain to the exit laws of its dual chain.
In this note, we observe that a downwardly skip-free process is the Siegmund dual of an upwardly skip-free process, which has been extensively studied; see, e.g., [1,2,6]. By applying the duality method, we can transform problems related to downwardly skip-free processes into those of upwardly skip-free processes. Therefore, for a class of downwardly skip-free processes, we rederive some known results and establish new quantities that have not been addressed in the literature.
Definition 1.
Let P ( t ) = ( p i j ( t ) : i , j Z + ) be a transition function. If there exists another transition function P ˜ ( t ) = ( p ˜ i j ( t ) : i , j Z + ) satisfying
k = 0 j p ˜ i k ( t ) = k = i p j k ( t ) , i , j Z + , t 0 ,
then we call P ˜ ( t ) the Siegmund dual of P ( t ) .
In the rest of this paper, we denote the transition rate matrix of a downwardly skip-free process by Q = ( q i j : i , j Z + ) and the corresponding minimal process by P ( t ) = ( p i j : i , j Z + ) . To guarantee the existence of duality, we impose the following two conditions:
Condition 1.
k = 0 j q ˜ i k k = 0 j q ˜ i + 1 , k , j i .
Condition 2.
n = 0 m ¯ n = , where c k = q ˜ k k j k q ˜ k j ,
m ¯ 0 = 0 , a n d m ¯ n = 1 q ˜ n , n 1 1 + k = 0 n 1 ( c k + j = n q ˜ k j ) m ¯ k , n 1 .
Remark 1.
Since c k 0 for k Z + and j = n q ˜ k j 0 for 0 k n 1 , we conclude that m ¯ n ( q ˜ n , n 1 ) 1 for n 1 . Therefore, if Q ˜ satisfies
n = 1 1 q ˜ n , n 1 = ,
then Condition 2 holds.
Recall that a transition function P ( t ) is called honest if j = 0 p i j ( t ) = 1 for i Z + and a transition rate matrix Q is called conservative if j i q i j = q i i for i Z + . We say P ( t ) is stochastically monotone, if j = k p i j ( t ) is a non-decreasing function of i for fixed k Z + and t 0 . Our first main result establishes a sufficient condition for the existence of the duality between upwardly skip-free processes and downwardly skip-free processes.
Theorem 1.
Suppose that the downwardly skip-free transition rate matrix Q ˜ satisfies Conditions 1 and 2. Then,
(i) There exists a stochastically monotone upwardly skip-free transition function P ( t ) = ( p i j ( t ) : i , j Z + ) with transition rate matrix Q defined by
q j i = k = 0 j ( q ˜ i k q ˜ i + 1 , k ) , i , j Z + ,
such that P ˜ ( t ) is the Siegmund dual of P ( t ) .
(ii) If q ˜ 00 = 0 , then Q is conservative, and P ( t ) is honest.
Let ( X ˜ t ) t 0 be a downwardly skip-free process on Z + , with the transition rate matrix Q ˜ . Define the extinction time σ ˜ 0 : = inf { t 0 : X ˜ t = 0 } , the occupation time T ˜ j : = 0 1 { X ˜ t = j } d t for j 1 , and the explosion time ζ ˜ : = lim n inf { t 0 : X ˜ t n } .
When the downwardly skip-free process P ˜ ( t ) is the Siegmund dual of the upwardly skip-free process P ( t ) with transition rate matrix Q, we derive explicit expressions for several quantities related to the downwardly skip-free process using Q. To this end, we define q n ( k ) = j = 0 k q n j for 0 k < n and
m 0 = 1 q 01 , m n = 1 q n , n + 1 1 + k = 0 n 1 q n ( k ) m k , n 1 ,
F i ( i ) = 1 , F n ( i ) = 1 q n , n + 1 k = i n 1 q n ( k ) F k ( i ) , 0 i < n .
Theorem 2.
Suppose that the downwardly skip-free transition rate matrix Q ˜ satisfies Condition 1, Condition 2, and q ˜ 00 = 0 . Then:
(i) P ˜ ( t ) is not strongly ergodic.
(ii) P ˜ ( t ) is honest if and only if P ( t ) is not strongly ergodic.
(iii) For any initial state i 1 , the extinction probability of the downwardly skip-free process satisfies P i ( σ ˜ 0 < ) < 1 if and only if P ( t ) is ergodic. Indeed, the extinction probability is given by
P i ( σ 0 ˜ < ) = 1 k = 0 i 1 π k , i 1 ,
where π j : = lim t p i j ( t ) for i , j Z + .
(iv) The mean occupation time of the downwardly skip-free process is given by
E i T ˜ j = k = 0 i j 1 F j 1 ( k ) q k , k + 1 m j 1 k = 0 i 1 π k , i 1 , j 1 .
Moreover, if the extinction probability of the downwardly skip-free process is 1, then
E i T ˜ j = k = 0 i j 1 F j 1 ( k ) q k , k + 1 , i 1 , j 1 ,
where i j : = min { i , j } for i , j Z + .
(v) For the downwardly skip-free process, the conditional expectation of the explosion time is given by
E i ( ζ ˜ | σ ˜ 0 = ) = j = 1 k = 0 j 1 π k k = 0 i 1 π k k = 0 i j 1 F j 1 ( k ) q k , k + 1 m j 1 k = 0 i 1 π k , i 1 .
(vi) For the downwardly skip-free process, the conditional expectation of the extinction time is given by
E i ( σ 0 ˜ | σ ˜ 0 < ) = j = 1 1 k = 0 j 1 π k 1 k = 0 i 1 π k k = 0 i j 1 F j 1 ( k ) q k , k + 1 m j 1 k = 0 i 1 π k , i 1 .
Moreover, if the extinction probability of the downwardly skip-free process is 1, then
E i σ ˜ 0 = j = 1 k = 0 i j 1 F j 1 ( k ) q k , k + 1 , i 1 .
The paper is organized as follows: In Section 2, we recall some known properties of the Siegmund dual and then prove Theorem 1. In Section 3, we establish Theorem 2. Finally, in Section 4, we present two examples of downwardly skip-free processes to illustrate our main results.

2. Siegmund Dual

The following proposition is taken from Chen and Zhang [7], and it establishes a necessary and sufficient condition for the existence of Siegmund duality. This result is of independent interest, as it does not require the assumption that P ( t ) is an upwardly skip-free process.
Proposition 1
([7]). The transition function P ˜ ( t ) is the Siegmund dual of a stochastically monotone transition function P ( t ) if and only if the following two conditions hold:
(i)
k = 0 j p ˜ i k ( t ) is non-increasing in i for each j Z + and t 0 ;
(ii)
lim i p ˜ i j ( t ) = 0 for any j Z + and t 0 .
Proof of Proposition 1.
Suppose that P ˜ ( t ) satisfies conditions (i) and (ii). Define
p j i ( t ) = k = 0 j ( p ˜ i k ( t ) p ˜ i + 1 , k ( t ) ) , i , j Z + .
It is clear that condition (i) implies p i j ( t ) 0 for any i , j Z + . Furthermore, for any i , j Z + and t 0 , we obtain that
k = i p j k ( t ) = k = i l = 0 j ( p ˜ k l ( t ) p ˜ k + 1 , l ( t ) ) = l = 0 j k = i ( p ˜ k l ( t ) p ˜ k + 1 , l ( t ) ) = l = 0 j ( p ˜ i l ( t ) lim k p ˜ k + 1 , l ( t ) ) = l = 0 j p ˜ i l ( t ) ,
where the last equality follows from condition (ii). Therefore, the identity (1) holds and, in particular, k = 0 p j k ( t ) = l = 0 j p ˜ 0 l ( t ) 1 . It follows from (1) that k = i p j k ( t ) is non-decreasing in j for fixed i and t 0 . Thus, P ( t ) is stochastically monotone. Using the Chapman–Kolmogorov equation for P ˜ ( t ) , together with the identity (1), we have
p j i ( t + s ) = k = 0 j ( p ˜ i k ( t + s ) p ˜ i + 1 , k ( t + s ) ) = k = 0 j l = 0 p ˜ i l ( t ) p ˜ l k ( s ) l = 0 p ˜ i + 1 , l ( t ) p ˜ l k ( s ) = l = 0 ( p ˜ i l ( t ) p ˜ i + 1 , l ( t ) ) k = 0 j p ˜ l k ( s ) = l = 0 ( p ˜ i l ( t ) p ˜ i + 1 , l ( t ) ) k = l p j k ( s ) = k = 0 p j k ( s ) l = 0 k ( p ˜ i l ( t ) p ˜ i + 1 , l ( t ) ) = k = 0 p j k ( s ) l = i p k l ( t ) l = i + 1 p k l ( t ) = k = 0 p j k ( s ) p k i ( t ) .
Hence, P ( t ) satisfies the Chapman–Kolmogorov equation. Moreover, since lim t 0 p ˜ i j ( t ) = δ i j , where δ i j = 1 if i = j and δ i j = 0 otherwise, it follows that for any i , j Z + ,
lim t 0 p j i ( t ) = lim t 0 k = 0 j ( p ˜ i k ( t ) p ˜ i + 1 , k ( t ) ) = k = 0 j ( lim t 0 p ˜ i k ( t ) lim t 0 p ˜ i + 1 , k ( t ) ) = k = 0 j ( δ i k δ i + 1 , k ) = δ i j .
Therefore, P ˜ ( t ) is the Siegmund dual of the stochastically monotone transition function P ( t ) .
Conversely, suppose that P ˜ ( t ) is the Siegmund dual of a stochastically monotone transition function P ( t ) . Then, the identity (1) holds by Definition 1. It follows immediately from (1) that condition (i) is satisfied. Furthermore, from (1), we have
p ˜ i j ( t ) = k = i ( p j k ( t ) p j 1 , k ( t ) ) , i , j Z + ,
which implies that lim i p ˜ i j ( t ) = 0 for any j Z + and t 0 . Therefore, condition (ii) also holds true. □
A stochastically monotone transition function P ( t ) and its dual P ˜ ( t ) are completely determined by each other. From (1), we can derive
p ˜ i j ( t ) = k = i ( p j k ( t ) p j 1 , k ( t ) ) , i , j Z + ,
and
p j i ( t ) = k = 0 j ( p ˜ i k ( t ) p ˜ i + 1 , k ( t ) ) , i , j Z + .
We now proceed to prove Theorem 1.
Proof of Theorem 1.
(i) It follows from Condition 1 and (Zhang [8], Proposition 2.4) that
k = 0 j p ˜ i k ( t ) k = 0 j p ˜ i + 1 , k ( t ) , i , j Z + .
Since Q ˜ is a downwardly skip-free transition rate matrix, we find that
lim i q ˜ i j = 0 , j Z + .
From (Wang and Zhang [9], Theorem 1.3) and (Li [10], Proposition 2.2), we obtain that Condition 2 holds true if and only if the equation
λ y i = j = 0 y j q ˜ j i , j Z + , i = 0 y i < ,
has only the trivial solution for some (and hence for all) λ > 0 . This, together with (14) and ( Reuter and Riley [11], Theorem 8), implies that
lim i p ˜ i j ( t ) = 0 , j Z + .
Combining (13), (15) and Proposition 1, we conclude that there exists a stochastically monotone transition function P ( t ) satisfying both (1) and (12). Therefore, P ˜ ( t ) is the Siegmund dual of P ( t ) . Differentiating (12) at t = 0 yields Equation (2). Since q ˜ i , i 1 > 0 for all i 1 , and q ˜ i , i j = 0 for all i j 2 , it then follows from (2) that Q is an upwardly skip-free transition rate matrix.
  • (ii) Summing both sides of (2) over i m yields that for any i , j Z + ,
    i = m q j i = i = m k = 0 j ( q ˜ i k q ˜ i + 1 , k ) = k = 0 j i = m ( q ˜ i k q ˜ i + 1 , k ) = k = 0 j ( q ˜ m k lim i q ˜ i + 1 , k ) .
    Since Q ˜ is a downwardly skip-free transition rate matrix, it is clear that lim i q ˜ i j = 0 for any j Z + . Hence, we find that
    i = m q j i = k = 0 j q ˜ m k , m , j Z + .
    Taking m = 0 in (16) and noting that q ˜ 00 = 0 , it follows that q ˜ 0 k = 0 for any k Z + . Therefore, we obtain
    k = 0 j q ˜ 0 k = 0 = i = 0 q j i , j Z + , t 0 ,
    which implies that Q is conservative. Since q ˜ 00 = 0 , i.e., 0 is an absorbing state of P ˜ ( t ) , we have that
    p ˜ 00 ( t ) = 1 , p ˜ 0 j ( t ) = 0 , j 1 , t 0 .
    It then follows from (1) that
    k = 0 p j k ( t ) = k = 0 j p ˜ 0 k ( t ) = p ˜ 00 ( t ) = 1 , i , j Z + , t 0 .
    Thus, P ( t ) is honest. □

3. Proof of Theorem 2

Before proving Theorem 2, we first present the following useful theorem, which is taken from (Zhang et al. [12], Theorem 2.2).
Theorem 3.
Suppose P ( t ) = ( p i j ( t ) : i , j Z + ) is an ergodic and stochastically monotone transition function. Then, it is not strongly ergodic if and only if lim i p i j ( t ) = 0 for any j Z + and t 0 .
Proof of Theorem 2.
(i) By Theorem 1, there exists a stochastically monotone upwardly skip-free transition function P ( t ) , such that P ˜ ( t ) is the Siegmund dual of P ( t ) . Consequently, Equation (11) holds. Moreover, from (11), we deduce that
lim i p ˜ i j ( t ) = 0 , j Z + , t 0 .
It then follows from Theorem 3 that the downwardly skip-free process P ˜ ( t ) is not strongly ergodic.
  • (ii) Suppose that P ˜ ( t ) is honest. Since q ˜ 00 = 0 , Theorem 1 implies that P ( t ) is honest. By (1), we see
    k = 0 j p ˜ i k ( t ) = k = i p j k ( t ) = 1 k = 0 i 1 p j k ( t ) , i , j Z + , t 0 .
    Letting j in (17), and noting that P ˜ ( t ) is honest, we find that
    lim j k = 0 i 1 p j k ( t ) = 1 lim j k = 0 j p ˜ i k ( t ) = 0 , j Z + , t 0 .
    Thus, lim j p j k ( t ) = 0 for any k Z + and t 0 , and Theorem 3 then implies that P ( t ) is not strongly ergodic.
Conversely, suppose that P ( t ) is not strongly ergodic. Theorem 3 implies that lim j p j k ( t ) = 0 for k Z + and t 0 . Letting j in (17) yields
lim j k = 0 j p ˜ i k ( t ) = k = 0 p ˜ i k ( t ) = 1 lim j k = 0 i 1 p j k ( t ) = 1 , i Z + .
Then, it follows that P ˜ ( t ) is honest.
  • (iii) Letting j = 0 in (17) gives that
    p ˜ i 0 ( t ) = 1 k = 0 i 1 p 0 k ( t ) , i 1 , t 0 .
    Since π j = lim t p i j ( t ) for all i , j Z + , letting t in the above equation yields
    P i ( σ ˜ 0 < ) = 1 k = 0 i 1 π k , i 1 .
    Notice that P ( t ) is ergodic if and only if π i > 0 for some (and hence for all) i Z + . From (18), we therefore have P i ( σ ˜ 0 < ) < 1 if and only if P ( t ) is ergodic.
  • (iv) Recall that the resolvent of P ( t ) is given by
    p i j ( λ ) = 0 e λ t p i j ( t ) d t , i , j Z + , λ > 0 .
    Since q ˜ 00 = 0 , Theorem 1 implies that Q is conservative. Hence, the resolvent of P ( t ) satisfies the following backward Kolmogorov equations:
    k = 0 q i k p k j ( λ ) λ p i j ( λ ) = δ i j , i , j Z + , λ > 0 .
    Applying (Chen and Zhang [2], Theorem 1.1) gives
    p i j ( λ ) p i 1 , j ( λ ) = k = 0 i 1 F ˜ i 1 ( k ) ( δ k j + λ p 0 j ( λ ) ) q k , k + 1 = 1 { j i 1 } F ˜ i 1 ( j ) q j , j + 1 + m ˜ i 1 λ p 0 j ( λ ) , λ > 0 ,
    where
    F ˜ i ( i ) = 1 , F ˜ n ( i ) = 1 q n , n + 1 k = i n 1 q ˜ n ( k ) F ˜ k ( i ) , n > i 0 ,
    q ˜ n ( k ) = q n ( k ) + λ = j = 0 k q n j + λ , 0 k < n .
    m ˜ n = k = 0 n F ˜ n ( k ) q k , k + 1 , n 0 .
    Since for each n i 0 , F ˜ n ( i ) and m ˜ n are analytic in λ ( 0 , ) , we have
    lim λ 0 + F ˜ n ( i ) = F n ( i ) a n d lim λ 0 + m ˜ n = m n , n i 0 .
    Using the method of integration by substitution, and noting that lim t p i j ( t ) = π j for all i , j Z + , it follows that for j Z + ,
    lim λ 0 + λ p 0 j ( λ ) = lim λ 0 + λ 0 e λ t p 0 j ( t ) d t = lim λ 0 + λ 0 e x p 0 j ( x / λ ) d ( x / λ ) = lim λ 0 + 0 e t p 0 j ( t / λ ) d t = π j .
    Moreover, by the monotone convergence theorem and (17), we see that for i 1 , j 1 ,
    E i T ˜ j = E i 0 1 { X ˜ t = j } d t = 0 p ˜ i j ( t ) d t = lim λ 0 + 0 e λ t p ˜ i j ( t ) d t = lim λ 0 + 0 e λ t k = 0 i 1 ( p j 1 , k ( t ) p j k ( t ) ) d t = k = 0 i 1 lim λ 0 + 0 e λ t ( p j 1 , k ( t ) p j k ( t ) ) d t = k = 0 i 1 lim λ 0 + ( p j 1 , k ( λ ) p j k ( λ ) ) .
    Substituting (19)–(21) into (22), we obtain for i 1 , j 1 ,
    E i T ˜ j = k = 0 i 1 lim λ 0 + 1 { k j 1 } F ˜ j 1 ( k ) q k , k + 1 m ˜ j 1 λ p 0 k ( λ ) = k = 0 i 1 1 { k j 1 } F j 1 ( k ) q k , k + 1 m j 1 π k = k = 0 i j 1 F j 1 ( k ) q k , k + 1 m j 1 k = 0 i 1 π k .
    If the extinction probability satisfies P i ( σ 0 ˜ < ) = 1 , then from (5), we get π k = 0 for each k Z + . In that case, (23) reduces to
    E i T ˜ j = k = 0 i j 1 F j 1 ( k ) q k , k + 1 , i 1 , j 1 .
  • (v) We begin by proving the identity
    E i ( ζ ˜ 1 [ σ ˜ 0 = ] ) = j = 1 0 P i ( X ˜ t = j , σ ˜ 0 = ) d t , i 1 .
    Let ζ ˜ n : = inf { t 0 : X ˜ t n } for n 0 . Recall that the explosion time ζ ˜ = lim n inf { t 0 : X ˜ t n } , then we know that ζ ˜ = lim n ζ ˜ n . For each n = 1 , 2 , , define X ˜ t ( n ) = X ˜ t ζ ˜ n . Then, we get for i 1 ,
    E i ( ζ ˜ n 1 [ σ ˜ 0 = ] ) = 0 P i ( ζ ˜ n 1 [ σ ˜ 0 = ] > t ) d t = j = 1 n 1 0 P i ( X ˜ t ( n ) = j , σ ˜ 0 = ) d t .
    On the one hand, fix m > 0 . For sufficiently large n, (25) yields that
    E i ( ζ ˜ n 1 [ σ ˜ 0 = ] ) j = 1 m 0 P i ( X ˜ t ( n ) = j , σ ˜ 0 = ) d t , i 1 .
    Letting n , and applying the monotone convergence theorem on the left hand side and Fatou’s lemma on the right hand side, then we see
    E i ( ζ ˜ 1 [ σ ˜ 0 = ] ) j = 1 m 0 P i ( X ˜ t = j , σ ˜ 0 = ) d t , i 1 .
    Letting m in the above equation shows that
    E i ( ζ ˜ 1 [ σ ˜ 0 = ] ) j = 1 0 P i ( X ˜ t = j , σ ˜ 0 = ) d t , i 1 .
    On the other hand, it follows from (25) that
    E i ( ζ ˜ n 1 [ σ ˜ 0 = ] ) j = 1 n 1 0 P i ( X ˜ t = j , σ ˜ 0 = ) d t , i 1 .
    Letting n in the above equation gives
    E i ( ζ ˜ 1 [ σ ˜ 0 = ] ) j = 1 0 P i ( X ˜ t = j , σ ˜ 0 = ) d t , i 1 .
    Combining (26) and (27) immediately yields (24). When P i ( σ ˜ 0 = ) > 0 , dividing both sides by P i ( σ ˜ 0 = ) gives
    E i ( ζ ˜ | σ ˜ 0 = ) = j = 1 0 P i ( X ˜ t = j , σ ˜ 0 = ) P i ( σ ˜ 0 = ) d t , i 1 .
    Using the Markov property, we conclude that for i 1 , j 1 ,
    P i ( X ˜ t = j , σ ˜ 0 = ) = P i ( X ˜ t = j ) P i ( σ ˜ 0 = | X ˜ t = j ) = P i ( X ˜ t = j ) P j ( σ ˜ 0 = ) .
    Substituting (5), (6), and (29) into (28), we obtain for i 1 ,
    E i ( ζ ˜ | σ ˜ 0 = ) = j = 1 P j ( σ ˜ 0 = ) P i ( σ ˜ 0 = ) 0 P i ( X ˜ t = j ) d t = j = 1 P j ( σ ˜ 0 = ) P i ( σ ˜ 0 = ) E i T ˜ j = j = 1 k = 0 j 1 π k k = 0 i 1 π k k = 0 i j 1 F j 1 ( k ) q k , k + 1 m j 1 k = 0 i 1 π k .
  • (vi) For i 1 , we have
    E i ( σ ˜ 0 1 [ σ ˜ 0 < ] ) = 0 P i ( σ ˜ 0 1 [ σ ˜ 0 < ] > t ) d t = j = 1 0 P i ( X ˜ t = j , σ ˜ 0 < ) d t .
    When P i ( σ ˜ 0 < ) > 0 , dividing both sides by P i ( σ ˜ 0 < ) gives
    E i ( σ ˜ 0 | σ ˜ 0 < ) = j = 1 0 P i ( X ˜ t = j , σ ˜ 0 < ) P i ( σ ˜ 0 < ) d t , i 1 .
    By the Markov property, we can get for i 1 , j 1 ,
    P i ( X ˜ t = j , σ ˜ 0 < ) = P i ( X ˜ t = j ) P i ( σ ˜ 0 < | X ˜ t = j ) = P i ( X ˜ t = j ) P j ( σ ˜ 0 < ) .
    Substituting (5), (6), and (31) into (30), we obtain for i 1 ,
    E i ( σ ˜ 0 | σ ˜ 0 < ) = j = 1 P j ( σ ˜ 0 < ) P i ( σ ˜ 0 < ) 0 P i ( X ˜ t = j ) d t = j = 1 P j ( σ ˜ 0 < ) P i ( σ ˜ 0 < ) E i T ˜ j = j = 1 1 k = 0 j 1 π k 1 k = 0 i 1 π k k = 0 i j 1 F j 1 ( k ) q k , k + 1 m j 1 k = 0 i 1 π k .
    If the extinction probability satisfies P i ( σ 0 ˜ < ) = 1 , it then follows from (7) that for i 1 ,
    E i σ 0 ˜ = 0 P i ( σ ˜ 0 > t ) d t = j = 1 0 P i ( X ˜ t = j ) d t = j = 1 E i T ˜ j = j = 1 k = 0 i j 1 F j 1 ( k ) q k , k + 1 .

4. Examples

In this section, we consider two examples of the downwardly skip-free processes and provide the extinction probability, the mean occupation time, the mean explosion time, and the mean extinction time for the two downwardly skip-free processes.
Example 1.
Let Q ˜ be a downwardly skip-free transition rate matrix on Z + , and let P ˜ ( t ) be the corresponding minimal process. Suppose that Q ˜ = ( q ˜ i j ) is given as follows:
q ˜ i , i 1 = 1 2 i 1 , i 1 ; q ˜ i i = 3 2 i , i 1 ;
q ˜ i j = 1 2 j , j i + 1 , i 1 ; q ˜ i j = 0 , otherwise .
It is clear that k = 0 j q ˜ i k k = 0 j q ˜ i + 1 , k for j i , thus, Condition 1 holds. Since
i = 1 1 q ˜ i , i 1 = i = 1 2 i 1 = ,
Remark 1 implies that Condition 2 also holds.
Then, from Theorem 1, there exists a stochastically monotone upwardly skip-free transition function P ( t ) , such that P ˜ ( t ) is the Siegmund dual of P ( t ) . Let Q = ( q i j ) be the transition rate matrix of P ( t ) . Equation (2) then yields
q 01 = q 00 = 1 ; q i , i + 1 = q i 0 = 1 2 i , i 1 ;
q i i = 1 2 i 1 , i 1 ; q i j = 0 , otherwise .
Using q ˜ 00 = 0 and Theorem 1, we have that Q is conservative. Noting that { q i i , i Z + } is bounded, we find that Q is regular. Define
d 0 = 0 , d n = 1 q n , n + 1 1 + k = 0 n 1 q n ( k ) d k , n 1 .
From (3), (4), and (32), we can compute that
F i ( j ) = 1 , i = j , 2 i j 1 , i > j .
m n = n 2 n 1 + 2 n , n 0 .
d 0 = 0 , d n = ( n 1 ) 2 n 1 + 2 n , n 1 .
Noting that Q is regular and n = 0 F n ( 0 ) = 1 + n = 1 2 n 1 = , it follows from (Chen [1], Theorem 4.52) that P ( t ) is recurrence. Since
d = sup k Z + n = 0 k d n n = 0 k F n ( 0 ) = sup k Z + n = 1 k [ ( n 1 ) 2 n 1 + 2 n ] 1 + n = 1 k 2 n 1 = sup k Z + k = ,
([1], Theorem 4.52) implies that P ( t ) is not ergodic. Then, we find that lim t p i j ( t ) = π j = 0 for i , j Z + , and P ( t ) is not strongly ergodic. Applying Theorem 2, we conclude that P ˜ ( t ) is honest, P ˜ ( t ) is not strongly ergodic, and the extinct probability of P ˜ ( t ) is 1.
Using (7) yields
E i T ˜ j = k = 0 i j 1 F j 1 ( k ) q k , k + 1 = k = 0 i j 1 2 j k 2 1 2 k = ( i j ) 2 j 2 , i 1 , j 1 .
Substituting (33) into (10) shows
E i σ ˜ 0 = j = 1 k = 0 i j 1 F j 1 ( k ) q k , k + 1 = j = 1 ( i j ) 2 j 2 = , i 1 .
This example demonstrates how our duality-based approach efficiently computes mean occupation and extinction times for a downwardly skip-free process. The explicit expressions obtained through Theorems 2(iv) and 2(vi) would be challenging to derive using conventional methods for skip-free processes like those in Chen [1], while Zhang [3,4] established recurrence/transience criteria for similar processes, our method provides exact quantitative results for occupation and extinction times that complement these qualitative classifications. The infinite mean extinction time aligns with known results for processes with unbounded transition rates.
Example 2.
Let Q ˜ be a downwardly skip-free transition rate matrix on Z + , and let P ˜ ( t ) be the corresponding minimal process. Suppose that Q ˜ = ( q ˜ i j ) is given as follows:
q ˜ i , i 1 = 1 2 , i 1 ; q ˜ i i = 1 , i 1 ; q ˜ i j = 0 , otherwise .
It is clear that k = 0 j q ˜ i k k = 0 j q ˜ i + 1 , k for j i , thus, Condition 1 holds. Since
i = 1 1 q ˜ i , i 1 = i = 1 2 = ,
Remark 1 implies that Condition 2 also holds.
Then, from Theorem 1, there exists a stochastically monotone upwardly skip-free transition function P ( t ) , such that P ˜ ( t ) is the Siegmund dual of P ( t ) . Let Q = ( q i j ) be the transition rate matrix of P ( t ) . Equation (2) then yields
q 01 = q 00 = 1 2 ; q i , i + 1 = q i 0 = 1 2 , i 1 ;
q i i = 1 , i 1 ; q i j = 0 , otherwise .
Using q ˜ 00 = 0 and Theorem 1, we have that Q is conservative. Noting that { q i i , i Z + } is bounded, we find that Q is regular.
From (3), (4) and (32), we can compute that
F n ( k ) = 2 n k 1 , n > k 0 ; F k ( k ) = 1 .
m n = 2 n + 1 , n 0 .
d 0 = 0 , d n = 2 n , n 1 .
Since Q is regular and
d = sup k Z + n = 0 k d n n = 0 k F n ( 0 ) = sup k Z + n = 1 k 2 n 1 + n = 1 k 2 n 1 = sup k Z + 2 2 2 k = 2 < ,
([1], Theorem 4.52) implies that P ( t ) is ergodic. Let π = ( π i ) be the stationary distribution of P ( t ) . From π Q = 0 , we get π n = 2 n 1 for n 0 . Noting that
sup k Z + n = 0 k ( F n ( 0 ) d d n ) = sup k Z + n = 1 k ( 2 n 1 · 2 2 n ) + 2 = 2 < ,
it follows from ([1], Theorem 4.52) that P ( t ) is strongly ergodic. Applying Theorem 2, we conclude that P ˜ ( t ) is not honest, P ˜ ( t ) is not strongly ergodic, and the extinct probability of P ˜ ( t ) is given by
P i ( σ ˜ 0 < ) = 1 k = 0 i 1 π k = 1 2 i < 1 , i 1 .
When 1 i < j , using (6) yields
E i T ˜ j = k = 0 i 1 F j 1 ( k ) q k , k + 1 m j 1 k = 0 i 1 π k = 2 k = 0 i 1 2 j k 2 2 j k = 0 i 1 1 2 k + 1 = 0 .
When i j 1 , using (6) yields
E i T ˜ j = k = 0 j 1 F j 1 ( k ) q k , k + 1 m j 1 k = 0 i 1 π k = 2 k = 0 j 2 2 j k 2 + 1 2 j k = 0 i 1 1 2 k + 1 = 2 j i .
Substituting (34) and (35) into (8) shows
E i ( ζ ˜ | σ ˜ 0 = ) = j = 1 k = 0 j 1 π k k = 0 i 1 π k E i T ˜ j = j = 1 i 1 1 2 j 1 1 2 i 2 j i = 2 i 2 i 1 , i 1 .
Substituting (34) and (35) into (9) shows
E i ( σ 0 ˜ | σ ˜ 0 < ) = j = 1 1 k = 0 j 1 π k 1 k = 0 i 1 π k E i T ˜ j = j = 1 i 1 2 j 1 2 i 2 j i = i , i 1 .
This example illustrates how our duality framework yields closed-form expressions for conditional explosion and extinction times in a constant-rate downwardly skip-free process.

5. Conclusions

In this note, we have established that a class of downwardly skip-free processes can be viewed as the Siegmund dual of upwardly skip-free processes. By leveraging this duality relationship and existing results on upwardly skip-free processes, we derived explicit expressions for several important quantities associated with downwardly skip-free processes. Specifically, under Conditions 1 and 2, we showed the following:
1. The extinction probability of a downwardly skip-free process is given by P i ( σ ˜ 0 < ) = 1 k = 0 i 1 π k for i 1 , where π k is the stationary distribution of the dual upwardly skip-free process.
2. The mean occupation time has the following explicit form:
E i T ˜ j = k = 0 i j 1 F j 1 ( k ) q k , k + 1 m j 1 k = 0 i 1 π k
for i , j 1 , with simplified expressions when extinction is certain.
3. The conditional expectations of explosion and extinction times are provided in Theorems 2(v) and 2(vi), generalizing previous results.
Through two concrete examples, we demonstrated how these formulas can be applied to compute key quantities for specific downwardly skip-free processes. The duality approach developed in this work provides a powerful framework for analyzing downwardly skip-free processes by transferring problems to their upwardly skip-free duals, for which comprehensive theory already exists.
Future work should explore extensions to more general state spaces, applications to specific stochastic models in queueing theory and population dynamics, and connections to other duality relationships in stochastic processes.

Author Contributions

Writing—original draft preparation, P.-S.L. and P.Z.; writing—review and editing, P.-S.L. and P.Z. All authors have read and agreed to the published version of the manuscript.

Funding

This work is supported by National Natural Science Foundation of China (Nos. 12271029 and 11901570) and R&D Program of Beijing Municipal Education Commission (KM202411417001).

Data Availability Statement

Data is contained within the article.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Chen, M.F. From Markov Chains to Non-Equilibrium Particle Systems, 2nd ed.; World Scientific: Singapore, 2004. [Google Scholar]
  2. Chen, M.F.; Zhang, Y.H. Unified representation of formulas for single birth processes. Front. Math. China 2014, 9, 761–796. [Google Scholar] [CrossRef]
  3. Zhang, Y.H. Criteria on ergodicity and strong ergodicity of single death processes. Front. Math. China 2018, 13, 1215–1243. [Google Scholar] [CrossRef]
  4. Zhang, Y.H. On stability of single death processes. Sci. Sin. Math. 2020, 50, 211–230. (In Chinese) [Google Scholar] [CrossRef]
  5. Siegmund, D. The equivalence of absorbing and reflecting barrier problems for stochastically monotone Markov processes. Ann. Probab. 1976, 4, 914–924. [Google Scholar] [CrossRef]
  6. Zhang, Y.H. Process in single birth processes. Sci. Sin. Math. 2019, 49, 621–642. (In Chinese) [Google Scholar]
  7. Chen, A.Y.; Zhang, H.J. Existence and uniqueness of stochastically monotone Q-processes. Southeast Asian Bull. Math. 1999, 23, 559–583. [Google Scholar]
  8. Zhang, H.J.; Chen, A.Y. Stochastic comparability and dual Q-functions. J. Math. Anal. Appl. 1999, 234, 482–499. [Google Scholar] [CrossRef]
  9. Wang, L.D.; Zhang, Y.H. Criteria for zero-exit (-entrance) of single-birth (-death) Q-matrices. Acta. Math. Sin. (Chin. Ser.) 2014, 57, 681–692. (In Chinese) [Google Scholar]
  10. Li, Y.R. Dual and Feller-Reuter-Riley transition functions. J. Math. Anal. Appl. 2006, 313, 461–474. [Google Scholar] [CrossRef]
  11. Reuter, G.H.E.; Riley, P.W. The Feller property for Markov semigroups on a countable state space. J. London Math. Soc. 1972, 5, 267–275. [Google Scholar] [CrossRef]
  12. Zhang, H.J.; Chen, A.Y.; Lin, X.; Hou, Z. Strong ergodicity of monotone transition functions. Statist. Probab. Lett. 2001, 55, 63–69. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Li, P.-S.; Zhao, P. The Dual Processes of a Class of Downwardly Skip-Free Processes. Axioms 2025, 14, 555. https://doi.org/10.3390/axioms14080555

AMA Style

Li P-S, Zhao P. The Dual Processes of a Class of Downwardly Skip-Free Processes. Axioms. 2025; 14(8):555. https://doi.org/10.3390/axioms14080555

Chicago/Turabian Style

Li, Pei-Sen, and Pan Zhao. 2025. "The Dual Processes of a Class of Downwardly Skip-Free Processes" Axioms 14, no. 8: 555. https://doi.org/10.3390/axioms14080555

APA Style

Li, P.-S., & Zhao, P. (2025). The Dual Processes of a Class of Downwardly Skip-Free Processes. Axioms, 14(8), 555. https://doi.org/10.3390/axioms14080555

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop