A Consistent Estimate of the Deterministic Dead Time from Observations of the MAP Flow

In this paper, recurrent MAP flows are constructed using a Markov modulated Poisson process. Given the deterministic dead time for these flows, recurrent observation flows are determined. Dead times are estimated as the minimum distances between adjacent observation times. The validity of these estimates is proved using an upper bound for the jump size of the random walk defined by the recurrent MAP flow. This upper bound is investigated using the continuity theorem for uniformly convergent series of continuous functions and the Weierstrass theorem on the maximum of a continuous function on a segment and has a form of geometric progression. Denominator of this geometric progression is also estimated.

Authors

Publication Details

Journal
Mathematics
Published
2026-11-19
DOI
https://doi.org/10.3390/math14224253
Primary Topic
Advanced Queuing Theory Analysis
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

A Consistent Estimate of the Deterministic Dead Time from Observations of the MAP Flow

Gurami Sh. Tsitsiashvili
Mathematics
Advanced Queuing Theory Analysis
article

A Consistent Estimate of the Deterministic Dead Time from Observations of the MAP Flow

Gurami Sh. Tsitsiashvili
article en

Abstract

In this paper, recurrent MAP flows are constructed using a Markov modulated Poisson process. Given the deterministic dead time for these flows, recurrent observation flows are determined. Dead times are estimated as the minimum distances between adjacent observation times. The validity of these estimates is proved using an upper bound for the jump size of the random walk defined by the recurrent MAP flow. This upper bound is investigated using the continuity theorem for uniformly convergent series of continuous functions and the Weierstrass theorem on the maximum of a continuous function on a segment and has a form of geometric progression. Denominator of this geometric progression is also estimated.

MathematicsVol. 14(22)
Advanced Queuing Theory Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon