Pith. sign in

REVIEW 2 major objections 7 minor 36 references

Multi-time Markov renewal chains and stratified renewal theorems

T0 review · 2 major / 7 minor · reviewed 2026-07-09 · glm-5.2

Pith's one-line read Multi-time renewal theory partitions directions into Gaussian and non-Gaussian cells

desk verdict Stratified inverse-renewal limits for Markov-modulated multi-time chains: genuine new theory, well-proved, one notational glitch read the letter →

arxiv 2607.07283 v1 pith:4HQIIPRV submitted 2026-07-08 math.PR

classification math.PR
keywords markovrenewallimitsaugmentationcellsgaussianinverselocal
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Classical Markov renewal theory attaches a single scalar waiting time to each transition of an embedded Markov chain. This paper generalizes that picture to vector-valued waiting times on a d-dimensional lattice, where the observation geometry changes from an interval on the line to a lower rectangle in a partially ordered lattice. The central discovery is that this change of geometry stratifies the inverse renewal problem. When one asks how many renewals have occurred before a vector boundary is reached, the answer depends on which coordinate of the boundary is binding. The direction simplex decomposes into cells: on each cell where a single coordinate determines the rate, the inverse fluctuation is Gaussian; on interfaces where several coordinates simultaneously bind, the limit is the minimum of correlated Gaussian processes. The paper builds the full apparatus—kernel-valued convolution potentials, killed potentials, first-passage laws, reward functionals, and a Dynkin martingale—on a general Borel state space, then proves a functional inverse theorem giving convergence in the uniform norm over compact sets of directions, a critical-interface theorem for the boundary layer between cells, and logarithmic large-deviation bounds for rare inverse events. An operator-theoretic local theorem for Fourier-Laplace perturbations of Markov-additive kernels provides exact-time asymptotics, while a regenerative splitting argument supplies the arithmetic lattice-class corrections. Separately, the paper identifies the backward recurrence vector as the canonical Markovian augmentation of the observed semi-Markov field and gives a lumpability criterion for when that augmentation can be projected away.

What carries the argument

The kernel-valued convolution potential psi = sum of q^{(n)} on the partially ordered lattice (Nd, <=d), with the multi-time convolution (A*B)_k = sum_{r<=k} A_r B_{k-r}; the Nummelin splitting of the joint state-increment kernel Q (not just the embedded chain P) to create a regenerative atom that simultaneously regenerates state and vector increment; the backward recurrence vector U_k = k - S_{N(k)} as the canonical Markovian augmentation; and the Fourier-Laplace kernel Q_z f = sum_k e^{z.k} integral f(y) q_k(x,dy) for the operator-theoretic local theorem.

What would settle it

If a concrete finite-state two-clock semi-Markov model were found where the direction simplex has an interface with |I| >= 2 and the empirical inverse renewal count along directions approaching that interface does not converge to a minimum of correlated Gaussians but instead to a single Gaussian or to a different functional form, the stratified limit theory would fail.

Watch

Extended reading notes

Core claim

The rate-determining partition of the direction simplex is the load-bearing structure. For each direction lambda in the simplex, the set of coordinates achieving the minimum of lambda_r/mu_r determines the renewal rate. When this set has one element, the centered inverse renewal count has a Gaussian limit. When it has several elements, the limit is the minimum of correlated Gaussian coordinates—a non-Gaussian distribution that cannot be obtained by picking one of the adjacent Gaussian cells. The critical-interface theorem shows that on the square-root-of-t neighborhood of a boundary between cells, the limit is a drifted minimum of correlated Gaussians, interpolating between the Gaussian str~

Load-bearing premise

The joint minorization condition requires a small set that simultaneously regenerates the next state and the following vector-valued time increment—not just the state alone. If no such set exists, the Nummelin splitting that underpins the regenerative cycles, and hence the entire functional inverse theorem and its stratified limits, cannot be constructed.

Editorial extensions

If this is right

  • The stratified limit structure means that any system modeled by multi-dimensional semi-Markov renewal—reliability with age-usage warranties, queueing with multiple resources, biological exposure models—will exhibit non-Gaussian inverse fluctuations when the operating point sits near a direction where multiple resource constraints bind simultaneously.
  • The lumpability criterion for suppressing the backward recurrence vector provides a testable condition: the physical state process alone is Markov if and only if the transition probabilities from all admissible ages in the same state fiber coincide, which in dimension one reduces to geometric sojourn times but in higher dimensions has no direct multivariate-geometric analogue.
  • The operator-theoretic local theorem and the regenerative periodic theorem give two independent routes to exact-time asymptotics, with the regenerative route making lattice-class corrections explicit—useful for finite-state computational models where the period structure matters.
  • The killed-potential and crossing-kernel decomposition separates first-failure reliability from repeated-failure availability in a single algebraic framework, directly applicable to warranty cost analysis with rectangular coverage regions.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 7 minor

Summary. This paper develops a discrete Markov renewal theory on a standard Borel state space with vector-valued sojourn times and lower-rectangle observation on N^d. The core objects are a kernel-valued convolution resolvent (the Markov renewal potential) and a semi-Markov field observed on the partially ordered lattice. The paper establishes: (1) unified potential representations for semi-Markov transitions, first-passage laws, occupation measures, and rewards; (2) a Markovian augmentation of the semi-Markov field via the backward recurrence vector, with a strong lumpability criterion for projecting back to the original state space; (3) a stratified inverse-renewal theory decomposing the direction simplex into rate-determining cells, with Gaussian limits on single-coordinate cells and minima of correlated Gaussian fields on interfaces, including functional inverse limits (Theorem 5.6), critical-interface limits (Theorem 5.7), and logarithmic large-deviation estimates (Theorem 5.3); (4) an operator-theoretic local theorem for exact-time potentials via Fourier-Laplace perturbations of Markov-additive kernels (Theorem 6.5), with a regenerative periodic form (Theorem 6.7); and (5) finite-state specializations and reliability/warranty applications. The proofs use Nummelin splitting for regeneration, the Nagaev-Guivarc'h spectral method for local limits, and a subsequence/Skorokhod representation argument for the functional inverse theorems.

Significance. The paper makes a substantial contribution by extending classical Markov renewal theory to a genuinely multidimensional observation geometry. The stratification of the inverse-renewal problem—where the limit is Gaussian on single-coordinate cells but a minimum of correlated Gaussians on interfaces—is the central new structural insight and is rigorously established. The functional inverse theorem (Theorem 5.6) and critical-interface theorem (Theorem 5.7) are the principal results and are proved with explicit uniform bounds over compact directional sets. The operator-theoretic local theorem (Theorem 6.5) and its regenerative counterpart (Theorem 6.7) provide two independent routes to exact-time asymptotics, with the latter making arithmetic lattice classes explicit. The lumpability criterion (Theorem 7.2) and the memorylessness obstruction (Proposition 7.5) correctly identify why the backward recurrence vector is structural in dimensions d >= 2. The connection to reliability and warranty applications in Section 9 gives concrete finite-state formulas. The paper is largely self-contained, with complete proofs in the supplementary material for all deferred results.

major comments (2)
  1. Notational overload of N(k): In Section 2.2, N(k) = sup{n >= 0 : S_n <=_d k} is defined as the renewal count for the original Markov renewal chain. In Section 5, the same symbol N(k) = sup{n >= 0 : C_n <=_d k} is used for the count of complete regenerative cycles. These are different random variables (the latter counts cycles, not individual transitions), and the transition between the two uses is not explicitly flagged. While the proofs in Section 5 are internally consistent under the regenerative interpretation, a reader attempting to connect the asymptotic results of Section 5 back to the semi-Markov field quantities of Sections 2 and 4 may be confused. The authors should clarify the relationship, e.g., by noting that the regenerative cycle count governs the asymptotics and that the transition count D_{N(k)} differs from N(k) by the incomplete-cycle term controlled in Lemma 5.1.
  2. Assumption 3.3 (joint minorization on Q rather than on P alone) is the load-bearing hypothesis for the entire regenerative framework: the split atom must regenerate the next state AND the following vector increment simultaneously. The paper states this is stronger than minorizing the embedded chain and provides the multiplicative drift criterion (Theorem 3.11) as verification. However, Theorem 3.11 is stated and proved only for the case where the minorization holds at one step. The remark that 'if the minorization holds for the m_0-step joint kernel... the construction is applied to the m_0-skeleton' is brief. Since the applicability of the stratified inverse theorems to concrete models depends on this assumption being verifiable, the authors should briefly indicate which standard model classes (e.g., finite-state irreducible, geometrically ergodic with exponential increments) satisfy it
minor comments (7)
  1. Section 2.2: The notation X_{N(k)+1} is used for the next renewal increment after the observation point, but X_n was not previously defined as the increment variable (S_{n+1} - S_n is used in Definition 2.5). Clarify that X_{n+1} = S_{n+1} - S_n.
  2. Section 3.3: The directional rate rho_lambda and the rate-determining set I(lambda) are defined using mu (stationary mean per embedded transition), while in Section 5 the corresponding quantities kappa(lambda) and I(lambda) use m (mean cycle displacement). The equivalence m/ell = mu is noted, but the switch in notation between sections could be made more explicit.
  3. Section 5, Theorem 5.6: The Brownian motion W = (W^Y, W^L, W^R) is said to have covariance equal to that of (Y_1, L_1, R_1(g)) under P_a. It would help to state that this is a (d+2)-dimensional Brownian motion and that W^Y is d-dimensional, W^L and W^R are scalar.
  4. Section 6, Assumption 6.1 (S4): The notation |varrho(zeta)| is used for the modulus of the analytic continuation of the dominant eigenvalue, but varrho was defined as the eigenvalue itself (complex-valued). Clarify that |varrho(zeta)| denotes its modulus.
  5. Section 7.2: The active-set decomposition uses W_B(u)(x) for the probability that the active set equals B, but W also denotes the Brownian motion in Section 5. This is a minor notational collision across sections.
  6. Section 8.2: The finite-state periodic structure is defined via return increments to a fixed state i, and Proposition 8.3 shows L_i is independent of i. It would be useful to note that this coincides with the regenerative lattice L* of Section 3.3 when the atom is taken as a singleton state.
  7. References: The companion works Kordalis and Trevezas (2025, 2026a, 2026b, 2026c) are cited extensively. Since 2026a and 2026b appear to be manuscripts/submissions, their availability should be noted for the reader.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity identified

full rationale

The paper's central results—the functional inverse theorem (Theorem 5.6), the critical-interface theorem (Theorem 5.7), the operator-theoretic local theorem (Theorem 6.5), and the lumpability criterion (Theorem 7.2)—are proved from first principles within the manuscript. The proofs rely on standard external tools (invariance principle for i.i.d. cycle vectors, Nummelin splitting, Fourier-analytic saddle-point methods, Cramér's theorem) applied to the regenerative structure established in Section 3. The companion works (Kordalis and Trevezas 2025, 2026a, 2026b, 2026c) are cited for algebraic antecedents, the unmodulated scalar case, and supplementary proofs, but none of these citations are load-bearing for the main theorems: the stratified inverse limits are derived directly from the Brownian limit of the cycle partial sums via the inverse comparison argument (sandwiching N(k_t) between n_t^+ and n_t^-), and the lumpability criterion follows from the semigroup identity (5) and the projection formula (6). The regenerative periodic local theorem (Theorem 6.7) is proved independently in the supplementary material via Fourier inversion on the lattice, not by importing a result from prior work. No definition or fitted parameter is re-presented as a prediction. The derivation chain is self-contained against external mathematical benchmarks.

Assumptions & free parameters 0 free parameters · 8 assumptions · 3 invented entities

No free parameters are fitted to data; this is a pure theory paper. The axioms are standard domain assumptions for Markov renewal theory (Harris recurrence, minorization, moment conditions) plus the spectral-gap/aperiodicity hypotheses for the operator-theoretic local theorem, which are standard in the Nagaev–Guivarc'h method. The invented entities (backward recurrence vector, rate-determining cells, active-set mixture) are all derived from the model structure and proven to have the stated properties.

assumptions (8)
  • domain assumption Positive Harris recurrence of the embedded chain P with invariant π and finite mean increments μ_r (Assumption 3.1)
    Standard in Markov renewal theory; invoked throughout Section 3 and all asymptotic results.
  • domain assumption Joint minorization of Q on a small set C with atom a (Assumption 3.3)
    Required for Nummelin splitting and regenerative cycles; stronger than minorizing P alone. Invoked in Section 3.2 and all regenerative proofs.
  • domain assumption Finite second moments of cycle length and displacement, positive mean vector (Assumption 3.9)
    Required for the functional CLT and inverse theorems of Section 5.
  • domain assumption Non-degeneracy of transverse covariance (Assumption 3.10): θ^T Σθ > 0 for θ ⊥ m in V_L
    Excludes degeneracy in transverse directions for the local Gaussian profile; invoked implicitly in the CLT arguments.
  • domain assumption Spectral gap and aperiodicity of Fourier–Laplace kernels (Assumption 6.1, conditions S1–S5)
    The operator-theoretic local theorem (Theorem 6.5) depends on these spectral hypotheses. Sufficient conditions are given in Propositions 6.2–6.3.
  • domain assumption Exponential moment of regenerative cycle (Theorem 3.11 hypothesis, equation (1))
    Multiplicative Foster–Lyapunov drift condition; sufficient for exponential moments needed in local theorem and large-deviation estimates.
  • standard math Ionescu–Tulcea extension theorem for existence of the chain
    Invoked in Definition 2.5 for existence and uniqueness of the Markov renewal chain law.
  • standard math Keller–Liverani spectral perturbation stability (Keller and Liverani 1999)
    External result providing the approach to spectral hypotheses for Assumption 6.1.
invented entities (3)
  • Backward recurrence vector U_k = k - S_{N(k)} independent evidence
    purpose: Canonical Markovian augmentation of the semi-Markov field Z_k
    Theorem 7.1 proves the augmented field is Markov; Theorem 7.2 gives the lumpability criterion for suppressing it. Proposition 7.5 shows the obstruction to rectangular memorylessness in d≥2, providing independent structural justification.
  • Rate-determining coordinate set I(λ) and directional cells Δ_I independent evidence
    purpose: Stratification of the direction simplex for inverse-renewal asymptotics
    The set I(λ) is defined deterministically from the mean vector m and direction λ; its role is verified by the functional inverse theorem (Theorem 5.6) and the critical-interface theorem (Theorem 5.7).
  • Active-set mixture for residual survival (Section 7.2) independent evidence
    purpose: Explains why the backward recurrence vector is structural in d≥2
    The decomposition H_x(u+h)/H_x(u) = Σ ω_B(u) η_B(u,h) is derived from the kernel, not postulated. Proposition 7.5 provides the obstruction proof.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Multi-time Markov renewal chains and stratified renewal theorems." pith.science (2026). https://pith.science/paper/4HQIIPRV

@misc{pith2026260707283,
  author       = {Pith},
  title        = {Pith review of: Multi-time Markov renewal chains and stratified renewal theorems},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/4HQIIPRV}},
  note         = {Machine review of arXiv:2607.07283}
}
abstract

We develop a discrete Markov renewal theory on a standard Borel state space, with vector-valued sojourn times and lower-rectangle observation on $\N^d$. The Markov renewal potential is a kernel-valued convolution resolvent and yields unified representations for semi-Markov transitions, first-passage laws, occupation measures and rewards. The semi-Markov field observed on the partially ordered lattice is generally not Markov. We identify its canonical Markovian augmentation through the backward recurrence vector and give a lumpability criterion for the exceptional cases in which the augmentation can be projected back to the original state space. The lower-rectangle order leads to a stratified inverse-renewal theory: the direction simplex is decomposed into rate-determining cells, with Gaussian limits on cells having a unique active coordinate and minima of correlated Gaussian fields on their interfaces. We establish functional inverse limits, critical-interface limits and logarithmic estimates for inverse deviations. Exact-time potentials are obtained from an operator-theoretic local theorem for Fourier--Laplace perturbations of Markov-additive kernels, while a regenerative theorem gives the corresponding arithmetic lattice-class form. The results connect Markov renewal equations, multiparameter Markov structure and the local asymptotic geometry induced by rectangular observation.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

36 extracted references · 36 canonical work pages

  1. [1]

    On the Markov Renewal Theorem.Stochastic Processes and their Applications 50(1)37–56

    Alsmeyer, G.(1994). On the Markov Renewal Theorem.Stochastic Processes and their Applications 50(1)37–56. doi: 10.1016/0304-4149(94)90146-5

  2. [2]

    Kuelbs,A strong convergence theorem for Banach space valued random variables, Ann

    Athreya, K. B.,McDonald, D.andNey, P.(1978). Limit Theorems for Semi-Markov Processes and Renewal Theory for Markov Chains on General State Spaces.The Annals of Probability6(5) 788–797. doi: 10.1214/aop/1176995429

  3. [3]

    S.andLimnios, N.(2008).Semi-Markov Chains and Hidden Semi-Markov Models toward Applications: Their Use in Reliability and DNA Analysis.Lecture Notes in Statistics191

    Barbu, V. S.andLimnios, N.(2008).Semi-Markov Chains and Hidden Semi-Markov Models toward Applications: Their Use in Reliability and DNA Analysis.Lecture Notes in Statistics191

  4. [4]

    doi: 10.1007/978-0-387-73173-5

    Springer, New York. doi: 10.1007/978-0-387-73173-5

  5. [5]

    Billingsley,Convergence of Probability Measures, 2nd ed., Wiley Series in Probability and Statistics, John Wiley & Sons, New York, 1999

    Billingsley, P.(1999).Convergence of Probability Measures, second ed.Wiley Series in Probability and Statistics. John Wiley & Sons, New York. doi: 10.1002/9780470316962 C ¸inlar, E.(1969). Markov Renewal Theory.Advances in Applied Probability1(2)123–187. doi: 10.2307/1426216

  6. [6]

    B.(1975)

    Cairoli, R.andWalsh, J. B.(1975). Stochastic Integrals in the Plane.Acta Mathematica134(1) 111–183. doi: 10.1007/BF02392100 L. Kordalis and S. Trevezas/Multi-time Markov renewal chains44

  7. [7]

    Springer, New York

    Dembo, A.andZeitouni, O.(1998).Large Deviations Techniques and Applications, 2 ed. Springer, New York. doi: 10.1007/978-1-4612-5320-4 D¨oring, L.andTrottner, L.(2023). Stability of Overshoots of Markov Additive Processes.The Annals of Applied Probability33(6B)5413–5458. doi: 10.1214/23-AAP1951

  8. [8]

    Springer, Cham

    Douc, R.,Moulines, E.,Priouret, P.andSoulier, P.(2018).Markov Chains.Springer Series in Operations Research and Financial Engineering. Springer, Cham. doi: 10.1007/978-3-319-97704-1

Show all 36 references
  1. [9]

    Uniform Markov Renewal Theory and Ruin Probabilities in Markov Random Walks.The Annals of Applied Probability14(3)1202–1241

    Fuh, C.-D.(2004). Uniform Markov Renewal Theory and Ruin Probabilities in Markov Random Walks.The Annals of Applied Probability14(3)1202–1241. doi: 10.1214/105051604000000260

  2. [10]

    L.(2001)

    Fuh, C.-D.andLai, T. L.(2001). Asymptotic Expansions in Multidimensional Markov Renewal Theory and First Passage Times for Markov Random Walks.Advances in Applied Probability 33(3)652–673. doi: 10.1239/aap/1005091358 Guivarc’h, Y.andHardy, J.(1988). Th´ eor` emes limites pour ...

  3. [11]

    Springer, Berlin

    Hennion, H.andHerv ´e, L.(2001).Limit Theorems for Markov Chains and Stochastic Properties of Dynamical Systems by Quasi-Compactness.Lecture Notes in Mathematics1766. Springer, Berlin. doi: 10.1007/b87874 Herv´e, L.andP `ene, F.(2010). The Nagaev–Guivarc’h method via the Kelle...

  4. [12]

    J.(1974a)

    Hunter, J. J.(1974a). Renewal Theory in Two Dimensions: Basic Results.Advances in Applied Probability6(2)376–391. doi: 10.2307/1426299

  5. [13]

    J.(1974b)

    Hunter, J. J.(1974b). Renewal Theory in Two Dimensions: Asymptotic Results.Advances in Applied Probability6(3)546–562. doi: 10.2307/1426233

  6. [14]

    Springer, New York

    Kallenberg, O.(2002).Foundations of Modern Probability, Second ed. Springer, New York. doi: 10.1007/978-1-4757-4015-8

  7. [15]

    Stability of the spectrum for transfer operators.Annali della Scuola Normale Superiore di Pisa

    Keller, G.andLiverani, C.(1999). Stability of the spectrum for transfer operators.Annali della Scuola Normale Superiore di Pisa. Classe di Scienze28(1)141–152

  8. [16]

    Renewal Theory for Functionals of a Markov Chain with General State Space

    Kesten, H.(1974). Renewal Theory for Functionals of a Markov Chain with General State Space. The Annals of Probability2(3)355–386. doi: 10.1214/aop/1176996654

  9. [17]

    Springer, New York

    Khoshnevisan, D.(2002).Multiparameter Processes: An Introduction to Random Fields.Springer Monographs in Mathematics. Springer, New York. doi: 10.1007/b97363

  10. [18]

    I.(1991)

    Klesov, O. I.(1991). Renewal Theorems for Random Walk with Multidimensional Time.Ukrainian Mathematical Journal43(9)1089–1094. doi: 10.1007/BF01089207

  11. [19]

    Time multidimensional Markov renewal chains – An algebraic approach

    Kordalis, L.andTrevezas, S.(2025). Time multidimensional Markov renewal chains – An algebraic approach. doi: 10.48550/arXiv.2508.01891

  12. [20]

    Discrete time-multidimensional renewal theory and applications

    Kordalis, L.andTrevezas, S.(2026a). Discrete time-multidimensional renewal theory and applications. Manuscript submitted for publication. doi: 10.48550/arXiv.2606.31455

  13. [21]

    Algebraic and FFT-Based Methods for Discrete-Time Matrix Convolutions with Applications to Semi-Markov Models

    Kordalis, L.andTrevezas, S.(2026b). Algebraic and FFT-Based Methods for Discrete-Time Matrix Convolutions with Applications to Semi-Markov Models. doi: 10.48550/arXiv.2605.30379

  14. [22]

    Birkh¨ auser, Boston

    Limnios, N.andOpri s ¸an, G.(2001).Semi-Markov Processes and Reliability. Birkh¨ auser, Boston. doi: 10.1007/978-1-4612-0161-8

  15. [23]

    Some Renewal Theorems for Random Walks in Multidimensional Time.Mathematical Proceedings of the Cambridge Philosophical Society95(1)149–154

    Maejima, M.andMori, T.(1984). Some Renewal Theorems for Random Walks in Multidimensional Time.Mathematical Proceedings of the Cambridge Philosophical Society95(1)149–154. doi: 10.1017/S0305004100061372

  16. [24]

    Multivariate Geometric Distributions, (Logarithmically) Monotone Sequences, and Infinitely Divisible Laws.Journal of Multivariate Analysis115(C)457–480

    Mai, J.-F.,Scherer, M.andShenkman, N.(2013). Multivariate Geometric Distributions, (Logarithmically) Monotone Sequences, and Infinitely Divisible Laws.Journal of Multivariate Analysis115(C)457–480. doi: 10.1016/j.jmva.2012.11.012

  17. [25]

    W.andOlkin, I.(1995)

    Marshall, A. W.andOlkin, I.(1995). Multivariate Exponential and Geometric Distributions with Limited Memory.Journal of Multivariate Analysis53(1)110–125. doi: 10.1006/jmva.1995.1027

  18. [26]

    P.andTweedie, R

    Meyn, S. P.andTweedie, R. L.(1993).Markov Chains and Stochastic Stability. Springer, London. doi: 10.1007/978-1-4471-3267-7

  19. [27]

    Hitting Probabilities in a Markov Additive Process with Linear Movements and Upward Jumps.The Annals of Applied Probability14(2)1029–1054

    Miyazawa, M.(2004). Hitting Probabilities in a Markov Additive Process with Linear Movements and Upward Jumps.The Annals of Applied Probability14(2)1029–1054. doi: 10.1214/105051604000000206 L. Kordalis and S. Trevezas/Multi-time Markov renewal chains45 Muraleedharan Nair, K. ...

  20. [28]

    Murthy, D. N. P.,Iskandar, B. P.andWilson, R. J.(1995). Two-Dimensional Failure-Free Warranty Policies: Two-Dimensional Point Process Models.Operations Research43(2)356–366. doi: 10.1287/opre.43.2.356

  21. [29]

    The Renewal Theorem for Random Walk in Two-Dimensional Time.Studia Mathematica44(1)71–85

    Ney, P.andWainger, S.(1972). The Renewal Theorem for Random Walk in Two-Dimensional Time.Studia Mathematica44(1)71–85. doi: 10.4064/sm-44-1-71-85

  22. [30]

    Uniform and Ratio Limit Theorems for Markov Renewal and Semi- Regenerative Processes on a General State Space.Annales de l’Institut Henri Poincar´ e, Section B 14(2)119–143

    Nummelin, E.(1978). Uniform and Ratio Limit Theorems for Markov Renewal and Semi- Regenerative Processes on a General State Space.Annales de l’Institut Henri Poincar´ e, Section B 14(2)119–143

  23. [31]

    Cambridge Tracts in Mathematics83

    Nummelin, E.(1984).General Irreducible Markov Chains and Non-Negative Operators. Cambridge Tracts in Mathematics83. Cambridge University Press, Cambridge. doi: 10.1017/CBO9780511526237

  24. [32]

    Markov Renewal Processes: Definitions and Preliminary Properties.The Annals of Mathematical Statistics32(4)1231–1242

    Pyke, R.(1961). Markov Renewal Processes: Definitions and Preliminary Properties.The Annals of Mathematical Statistics32(4)1231–1242. doi: 10.1214/aoms/1177704863

  25. [33]

    Limit Theorems for Markov Renewal Processes.The Annals of Mathematical Statistics35(4)1746–1764

    Pyke, R.andSchaufele, R.(1964). Limit Theorems for Markov Renewal Processes.The Annals of Mathematical Statistics35(4)1746–1764. doi: 10.1214/aoms/1177700397

  26. [34]

    On Bivariate Lack of Memory Property and a New Definition.Annals of the Institute of Statistical Mathematics54(2)404–410

    Roy, D.(2002). On Bivariate Lack of Memory Property and a New Definition.Annals of the Institute of Statistical Mathematics54(2)404–410. doi: 10.1023/A:1022486321702

  27. [35]

    Shenkman, N.(2023). Characterizations of Multivariate Distributions with Limited Memory Revis- ited: An Analytical Approach.ALEA, Latin American Journal of Probability and Mathematical Statistics20(2)1077–1089. doi: 10.30757/ALEA.v20-39

  28. [36]

    T1−1X n=T0 g(Jn, Jn+1, Xn+1)1{Sn−ST0=u} # , u∈N d, L. Kordalis and S. Trevezas/Multi-time Markov renewal chains56 we have, for 0< θ 2 < θ3 < θ1, X u∈Nd eθ2|u|1 |rg|(u)≤E a

    Trevezas, S.andLimnios, N.(2011). Exact MLE and Asymptotic Properties for Non- parametric Semi-Markov Models.Journal of Nonparametric Statistics23(3)719–739. doi: 10.1080/10485252.2011.555543 L. Kordalis and S. Trevezas/Multi-time Markov renewal chains46 Supplementary Material...

Pith tools

Reviewed July 9, 2026 · model on record in the stance chip above.