Approaching of Renewal Schemes

Dmitrii Silvestrov
Additional contact information
Dmitrii Silvestrov: Stockholm University, Department of Mathematics

Chapter Chapter 6 in Coupling and Ergodic Theorems for Semi-Markov-Type Processes I, 2025, pp 229-278 from Springer

Abstract: Abstract In this chapter, we present the algorithm of approaching renewal points for two independent renewal schemes to a distance less than or equal to some H > 0 appearing as a result of alternating overjumps for renewal points of these renewal schemes. We define a renewal scheme, informally formulate and describe the coupling problem for renewal schemes, present the corresponding approaching renewal algorithm, and give explicit upper bounds for power and exponential moments of approaching times for renewal points using the method of test function. We also give explicit upper bounds for power and exponential moments of approaching times of renewal points uniform with respect to the initial distance between renewal points.

Date: 2025
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-031-89311-7_6

Ordering information: This item can be ordered from
http://www.springer.com/9783031893117

DOI: 10.1007/978-3-031-89311-7_6

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().