2019
DOI: 10.1017/s0269964818000578
|View full text |Cite
|
Sign up to set email alerts
|

Diffusion Limits for a Markov Modulated Binomial Counting Process

Abstract: In this paper we study limit behavior for a Markov-modulated (MM) binomial counting process, also called a binomial counting process under regime switching. Such a process naturally appears in the context of credit risk when multiple obligors are present. Markovmodulation takes place when the failure/default rate of each individual obligor depends on an underlying Markov chain. The limit behavior under consideration occurs when the number of obligors increases unboundedly, and/or by accelerating the modulating… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
1
1

Relationship

2
0

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 57 publications
0
3
0
Order By: Relevance
“…a network of Markov-modulated infinite-server queues). In other contexts, a similar methodology has been used, in, for example, Huang et al (2016) and Spreij and Storm (2019).…”
Section: Generalized Transition Ratesmentioning
confidence: 99%
See 1 more Smart Citation
“…a network of Markov-modulated infinite-server queues). In other contexts, a similar methodology has been used, in, for example, Huang et al (2016) and Spreij and Storm (2019).…”
Section: Generalized Transition Ratesmentioning
confidence: 99%
“…However, these models come with new complications, in that they do not automatically satisfy the anisotropic (informally meaning that information travels slower than the fastest class of vehicles) and even hyperbolic (informally meaning that any single vehicle has only local influence on the system dynamics) properties of conservation laws. As discussed in Daganzo (1995b) and van Wageningen-Kessels et al (2015), realistic traffic flow models should obey these properties.…”
Section: Introductionmentioning
confidence: 99%
“…a network of Markov-modulated infinite-server queues. In other contexts, a similar methodology has been used, in e.g., [12,30].…”
Section: Extensions Generalizations Ramificationsmentioning
confidence: 99%