Deviation matrix in denumerable Markov processes: Characterisation, rank-one perturbation and restart

We study the deviation matrix of denumerable state space, multi-chain Markov processes in continuous time. The deviation matrix is a measure of the cumulative deviation from the limiting probabilities and it plays an important role in many application domains. First, we provide several equivalent necessary and sufficient conditions for the existence of the deviation matrix. Next, we study a relation between the deviation matrix and rank-one perturbations of Markov processes. Based on a rank-one perturbation, we derive a versatile formula for the deviation matrix and apply this formula to Markov processes with restart. On the way, we needed to establish several new properties of rank-one perturbed Markov processes. We feel that those properties can be useful in their own right.

Authors

Institutions

Publication Details

Journal
The Annals of Applied Probability
Published
2025-11-24
DOI
https://doi.org/10.1214/25-aap2223
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
article

Deviation matrix in denumerable Markov processes: Characterisation, rank-one perturbation and restart

F. M. Spieksma, Konstantin Avrachenkov
The Annals of Applied Probability
Advanced Queuing Theory Analysis
article

Deviation matrix in denumerable Markov processes: Characterisation, rank-one perturbation and restart

F. M. Spieksma, Konstantin Avrachenkov
article en

Abstract

We study the deviation matrix of denumerable state space, multi-chain Markov processes in continuous time. The deviation matrix is a measure of the cumulative deviation from the limiting probabilities and it plays an important role in many application domains. First, we provide several equivalent necessary and sufficient conditions for the existence of the deviation matrix. Next, we study a relation between the deviation matrix and rank-one perturbations of Markov processes. Based on a rank-one perturbation, we derive a versatile formula for the deviation matrix and apply this formula to Markov processes with restart. On the way, we needed to establish several new properties of rank-one perturbed Markov processes. We feel that those properties can be useful in their own right.

The Annals of Applied ProbabilityVol. 35(6)
Leiden University (NL), Institut national de recherche en sciences et technologies du numérique (FR), Centre Inria d'Université Côte d'Azur (FR)
Openalex Percentile: Top 46%
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.

Deviation matrix in denumerable Markov processes: Characterisation, rank-one perturbation and restart — F. M. Spieksma, Konstantin Avrachenkov · The Annals of Applied Probability (2025) | TGRS Research Map | TGRS