On Strong Bounds of Rate of Convergence for Regenerative Processes
From MaRDI portal
Publication:4567985
DOI10.1007/978-3-319-51917-3_34zbMath1391.60218arXiv1608.02243OpenAlexW2963398804MaRDI QIDQ4567985
Publication date: 20 June 2018
Published in: Communications in Computer and Information Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.02243
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the rate of convergence to the stationary distribution in the single-server queuing systems
- On the rate of convergence for infinite server Erlang-Sevastyanov's problem
- On maximal and distributional coupling
- Coupling for Markov renewal processes and the rate of convergence in ergodic theorems for processes with semi-Markov switchings
- Exponential and uniform ergodicity of Markov processes
- Quantitative bounds for convergence rates of continuous time Markov processes
- Computable exponential convergence rates for stochastically ordered Markov processes
- Simple proof of Dynkin's formula for single-server systems and polynomial convergence rates
- On Coupling of continuous-time renewal processes
- A maximal coupling for Markov chains
- Uniform Estimation of the Convergence Rate in a Renewal Theorem for the Case of Discrete Time
- On Polynomial Bounds of Convergence for the Availability Factor
This page was built for publication: On Strong Bounds of Rate of Convergence for Regenerative Processes