Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 148 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 34 tok/s Pro
GPT-5 High 40 tok/s Pro
GPT-4o 101 tok/s Pro
Kimi K2 183 tok/s Pro
GPT OSS 120B 443 tok/s Pro
Claude Sonnet 4.5 35 tok/s Pro
2000 character limit reached

Upper bound on the rate of convergence and truncation bound for nonhomogeneous birth and death processes on $\mathbb{Z}$ (2110.02191v4)

Published 5 Oct 2021 in math.PR

Abstract: We consider the well-known problem of the computation of the (limiting) time-dependent performance characteristics of one-dimensional continuous-time birth and death processes on $\mathbb{Z}$ with time varying and possible state-dependent intensities. First in the literature upper bounds on the rate of convergence along with one new concentration inequality are provided. Upper bounds for the error of truncation are also given. Condition under which a limiting (time-dependent) distribution exists is formulated but relies on the quantities that need to be guessed in each use-case. The developed theory is illustrated by two numerical examples within the queueing theory context.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.