Pith. sign in

REVIEW 1 cited by

Metastable Distributions of Semi-Markov Processes

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2411.04795 v1 pith:4IWGKOR7 submitted 2024-11-07 math.PR

classification math.PR
keywords varepsilonprocessessemi-markovtransitionasymptoticbehaviormetastableparameter-dependent
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

In this paper, we consider semi-Markov processes whose transition times and transition probabilities depend on a small parameter $\varepsilon$. Understanding the asymptotic behavior of such processes is needed in order to study the asymptotics of various randomly perturbed dynamical and stochastic systems. The long-time behavior of a semi-Markov process $X^\varepsilon_t$ depends on how the point $(1/\varepsilon, t(\varepsilon))$ approaches infinity. We introduce the notion of complete asymptotic regularity (a certain asymptotic condition on transition probabilities and transition times), originally developed for parameter-dependent Markov chains, which ensures the existence of the metastable distribution for each initial point and a given time scale $t(\varepsilon)$. The result may be viewed as a generalization of the ergodic theorem to the case of parameter-dependent semi-Markov processes.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Asymptotic analysis on narrow tubes: narrow escape problems and diffusion processes

    math.PR 2025-08 conditional novelty 8.0 of 10

    Reflected Brownian motion in a narrow tube around a graph converges to a diffusion on the graph, with vertex gluing conditions that are pass-through, sticky, or absorbing depending on the junction-size scaling regime.

Pith tools