Descriptors for point processes based on runs: the Markovian arrival process
Summary: This paper is part of a broader investigation of properties of a point process that can be identified by imagining that the process is involved in a competition for the generation of runs of events. The general purpose of that methodology is to quantify the prevalence of gaps and bursts in realizations of the process. The Markovian arrival process (MAP) is highly versatile in qualitative behavior and its analysis is numerically tractable by matrix-analytic methods. It can therefore serve well as a benchmark process in that investigation. We consider the MAP and a regular grid competing for runs of lengths at least \(r_1\) and \(r_2\), respectively. A run of length \(r\) in one of the processes is defined as a string of \(r\) successive events occurring without an intervening event in the other process.
- Point processes competing for runs: A new tool for their investigation
- On a Markov sequence of point processes
- Marked point processes as limits of Markovian arrival streams
- Marked point processes in discrete time
- Descriptors of arrival-process burstiness with application to the discrete Markovian arrival process
- On the characterization of certain point processes
This page was built for publication: Descriptors for point processes based on runs: the Markovian arrival process
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q675259)
