Searcharxiv⌕ Search

arXiv subjects

Yong-Hua Mao

Publications and source records attributed to Yong-Hua Mao.

15 recordsLinked to original sources

Quasi-stationary distributions for single death processes with killing

This paper studies the quasi-stationary distributions for a single death process (or downwardly skip-free process) with killing defined on the non-negative integers, corresponding to a non-conservative transition rate matrix. The set $\{1,2,3,\cdots\}$ constitutes an irreducible class and $0$ is an absorbing state. For the single death process with three kinds of killing term, we obtain the existence and uniqueness of the quasi-stationary distribution. Moreover, we derive the conditions for exponential convergence to the quasi-stationary distribution in the total variation norm. Our main approach is based on the Doob's $h$-transform, potential theory and probabilistic methods.

math.PR↗

Quasi-stationary distributions for continuous-time $λ$-recurrent jump processes

For the continuous-time $λ$-recurrent jump process, the $λ$-recurrence assures the existence of quasi-stationary distribution when it has finite exit states (the states that have positive killing rates). And we give an explicit representation for this quasi-stationary distribution through $Q$-matrix, where the components of the quasi-stationary distribution outside the set $H$ of exit states can be represented by those within $H$. Sufficient condition is also provided for quasi-stationary distribution when the exit states are infinite.

math.PR↗

Nonstandard limit theorems and large deviation for beta -Jacobi ensembles with a different scaling

We consider $β$-Jacobi ensembles with parameters $p_1, p_2\geq n.$ We prove that the empirical measure of the rescaled Jacobi ensembles converges weakly to a modified Watcher law via the spectral measure method, which revisits the weak limits obtained in \cite{MaLDPJ} while replacing the condition $βn\!>\!> \log n$ by $βn\!>\!>1.$ We also provide the central limit theorem and the large deviation for the corresponding rescaled spectral measure.

math.PR↗

Averaging principle for two time-scale regime-switching processes

This work studies the averaging principle for a fully coupled two time-scale system, whose slow process is a diffusion process and fast process is a purely jumping process on an infinitely countable state space. The ergodicity of the fast process has important impact on the limit system and the averaging principle. We showed that under strongly ergodic condition, the limit system admits a unique solution, and the slow process converges in the L1-norm to the limit system. However, under certain weaker ergodicity condition, the limit system admits a solution, but not necessarily unique, and the slow process can be proved to converge weakly to a solution of the limit system.

math.PR↗

Convergence Rates in Uniform Ergodicity by Hitting Times and $L^2$-exponential Convergence Rates

Generally the convergence rate in exponential ergodicity $λ$ is an upper bound for the convergence rate $κ$ in uniform ergodicity for a Markov process, that is $λ\geqslantκ$. In this paper, we prove that $κ\geqslant \inf \{lambda,1/M_H\}$, where $M_H$ is a uniform bound on the moment of the hitting time to a "compact" set $H$. In the case where $M_H$ can be made arbitrarily small for $H$ large enough, we obtain that $λ=κ$. The general results are applied to Markov chains, diffusion processes and solutions to SDEs driven by symmetric stable processes.

math.PR↗

Variational formulas for the exit time of Hunt processes generated by semi-Dirichlet forms

Variational formulas for the Laplace transform of the exit time from an open set of a Hunt process generated by a regular lower bounded semi-Dirichlet form are established. While for symmetric Markov processes, variational formulas are derived for the exponential moments of the exit time. As applications, we provide some comparison theorems and quantitative relations of the exponential moments and Poincaré inequalities.

math.PR↗

Variational Formulas of Asymptotic Variance for General Discrete-time Markov Chains

The asymptotic variance is an important criterion to evaluate the performance of Markov chains, especially for the central limit theorems. We give the variational formulas for the asymptotic variance of discrete-time (non-reversible) Markov chains on general state space. The variational formulas provide many applications, extending the classical Peskun's comparison theorem to non-reversible Markov chains, and obtaining several comparison theorems between Markov chains with various perturbations.

math.PR↗

Lyapunov-type Conditions for Non-strong Ergodicity of Markov Processes

We present Lyapunov-type conditions for non-strong ergodicity of Markov processes. Some concrete models are discussed including diffusion processes on Riemannian manifolds and Ornstein-Uhlenbeck processes driven by symmetric $α$-stable processes. For SDE driven by $α$-stable process ($α\in (0,2]$) with polynomial drift, the strong ergodicity or not is independent on $α$.

math.PR↗

On geometric and algebraic transience for discrete-time Markov chains

General characterizations of ergodic Markov chains have been developed in considerable detail. In this paper, we study the transience for discrete-time Markov chains on general state spaces, including the geometric transience and algebraic transience. Criteria are presented through establishing the drift condition and considering the first return time. As an application, we give explicit criteria for the random walk on the half line and the skip-free chain on nonnegative integers.

math.PR↗

Hitting Time Distributions for Denumerable Birth and Death Processes

We proved the explicit formulas in Laplace transform of the hitting times for the birth and death processes on a denumerable state space with $\ift$ the exit or entrance boundary. This extends the well known Keilson's theorem from finite state space to infinite state space. We also apply these formulas to the fastest strong stationary time for strongly ergodic birth and death processes, and obtain the explicit convergence rate in separation.

math.PR↗