Reducible Markov modulation, pole order, and tail behavior in random growth models

Alexis Akira Toda; Brendan K. Beare

arxiv: 2405.13556 · v3 · submitted 2024-05-22 · 🧮 math.PR

Reducible Markov modulation, pole order, and tail behavior in random growth models

Brendan K. Beare , Alexis Akira Toda This is my paper

Pith reviewed 2026-05-24 00:51 UTC · model grok-4.3

classification 🧮 math.PR

keywords Markov modulationrandom growthtail asymptoticsErlang distributionpole orderMetzler structureTauberian theorem

0 comments

The pith

Reducible Markov modulation produces Erlang-like tail behavior in random growth models

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper aims to show that reducible Markov modulation in random growth models leads to tail behavior resembling an Erlang distribution, as opposed to the exponential distribution under irreducible modulation. The key is a theorem that determines the order of a real pole in the inverse of a holomorphic matrix-valued function with reducible Metzler structure. This pole order, combined with a Tauberian theorem, gives the Erlang shape parameter for two models. Readers would care because it provides a more general understanding of tail asymptotics in stochastic growth processes with regime switching.

Core claim

We show that with reducible modulation the tail behavior more generally resembles an Erlang distribution. Our main technical contribution is a theorem on the order of a real pole of the inverse of a holomorphic matrix-valued function with reducible Metzler structure. In a special affine case, the theorem recovers the Rothblum index theorem. Applying this result together with a Tauberian theorem, we characterize the Erlang shape parameter in two models of Markov-modulated random growth.

What carries the argument

The theorem on the order of a real pole of the inverse of a holomorphic matrix-valued function with reducible Metzler structure, which determines the Erlang shape parameter via Tauberian theorems.

Load-bearing premise

The modulation must satisfy the reducible Metzler structure, and the Tauberian theorem must be applicable to translate the pole order to the tail shape.

What would settle it

A counterexample where a model with reducible Metzler Markov modulation has tail behavior not matching an Erlang distribution with the predicted shape parameter from the pole order.

read the original abstract

Recent work on random growth models with light-tailed Markov-modulated additive shocks has shown that irreducible modulation yields tail behavior resembling an exponential distribution. We show that with reducible modulation the tail behavior more generally resembles an Erlang distribution. Our main technical contribution is a theorem on the order of a real pole of the inverse of a holomorphic matrix-valued function with reducible Metzler structure. In a special affine case, the theorem recovers the Rothblum index theorem. Applying this result together with a Tauberian theorem, we characterize the Erlang shape parameter in two models of Markov-modulated random growth.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper gives a pole-order theorem for reducible Metzler matrices that produces Erlang tails under reducible Markov modulation.

read the letter

The punchline is that reducible Markov modulation in random growth models produces tails resembling an Erlang distribution rather than exponential, via a theorem on the order of a real pole in the inverse of a holomorphic matrix-valued function with reducible Metzler structure. They recover the Rothblum index theorem as a special affine case and apply the result with a Tauberian theorem to two concrete models to characterize the shape parameter. This is the actual new piece: the extension of pole-order control beyond the irreducible setting that prior work covered. The derivation is presented as direct, without circular fitting of the Erlang parameter from the target tail. The paper does well by keeping the technical step narrow and linking it to standard Tauberian methods, which organizes the asymptotics for the reducible case in a clean way. Soft spots are minor and mostly about verification. The applications must confirm that the modulation satisfies the exact reducible Metzler conditions required for the theorem, and that the Tauberian conditions hold so the pole order maps to the Erlang shape without extra terms. The abstract gives no sign of gaps here, but a referee would need to check the proof details and the two model applications for those conditions. Nothing indicates an internal contradiction or unstated assumption that breaks the argument. This is for researchers working on Markov-modulated processes, tail asymptotics, or matrix-analytic methods in probability and risk. A reader already up on the irreducible results would get the most out of the extension. It deserves peer review because the contribution is focused, the method is standard but extended usefully, and the claim is falsifiable once the proof is examined.

Referee Report

2 major / 2 minor

Summary. The manuscript develops a theorem characterizing the order of a real pole of the inverse of a holomorphic matrix-valued function possessing reducible Metzler structure. Combined with a Tauberian theorem, this yields that the tail asymptotics of certain Markov-modulated random growth processes with reducible modulation are of Erlang type (shape parameter equal to the pole order) rather than pure exponential. The result recovers the Rothblum index theorem in a special affine case and is applied to two concrete growth models.

Significance. If the pole-order theorem is correct, the work supplies a precise matrix-analytic tool for tail analysis in reducible modulated systems, extending the irreducible case treated in prior literature. The recovery of a classical index theorem and the explicit computation of the Erlang shape parameter in two models constitute verifiable strengths; the approach is parameter-free once the modulation structure is given.

major comments (2)

[§3, Theorem 3.1] §3, Theorem 3.1: the proof that the pole is necessarily real and that its order equals the dimension of the terminal communicating class under the reducible Metzler hypothesis is only sketched; the argument appears to rely on an implicit block-triangular reduction whose validity for general holomorphic perturbations is not fully verified in the text.
[§4.1] §4.1, application to first growth model: the verification that the resolvent satisfies the exact reducible Metzler condition required by the theorem is stated but not accompanied by an explicit check that the off-diagonal blocks remain non-positive after the modulation is embedded; a counter-example with a single sign violation would collapse the claimed pole order.

minor comments (2)

[§2] The notation for the matrix-valued function F(z) and its inverse is introduced without a standing assumption list; a short paragraph listing the domain, holomorphy, and Metzler sign pattern would improve readability.
Reference to the original Rothblum (1975) paper is missing; only the recovery statement appears.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful review and constructive comments on our manuscript. The suggestions identify opportunities to strengthen the exposition of the main theorem and its application. We address each major comment below and will incorporate the requested clarifications in a revised version.

read point-by-point responses

Referee: [§3, Theorem 3.1] §3, Theorem 3.1: the proof that the pole is necessarily real and that its order equals the dimension of the terminal communicating class under the reducible Metzler hypothesis is only sketched; the argument appears to rely on an implicit block-triangular reduction whose validity for general holomorphic perturbations is not fully verified in the text.

Authors: The block-triangular reduction is justified by the definition of reducible Metzler matrices, which admit a permutation similarity to block-upper-triangular form with irreducible diagonal blocks; the holomorphic perturbation is required only to preserve the non-positive off-diagonal sign pattern, which follows directly from the Metzler hypothesis and does not depend on affinity. Nevertheless, we agree that the sketch leaves the preservation step implicit. In the revision we will insert an auxiliary lemma that explicitly constructs the permutation, verifies the sign pattern under holomorphic perturbation, and confirms that the pole order equals the dimension of the terminal class, thereby making the argument self-contained. revision: yes
Referee: [§4.1] §4.1, application to first growth model: the verification that the resolvent satisfies the exact reducible Metzler condition required by the theorem is stated but not accompanied by an explicit check that the off-diagonal blocks remain non-positive after the modulation is embedded; a counter-example with a single sign violation would collapse the claimed pole order.

Authors: Section 4.1 asserts that the embedded resolvent inherits the reducible Metzler structure from the underlying intensity matrix and the growth rates, but we concede that an explicit entry-wise sign check is absent. In the revision we will add a short computation displaying the off-diagonal blocks of the resolvent and confirming that all entries remain non-positive, thereby ruling out sign violations for the specific parameter ranges of the model. revision: yes

Circularity Check

0 steps flagged

Derivation self-contained via new pole-order theorem plus standard Tauberian application

full rationale

The central contribution is a theorem establishing the order of a real pole for the inverse of a holomorphic matrix-valued function under reducible Metzler structure. This is applied, together with an off-the-shelf Tauberian theorem, to obtain Erlang-shaped tails in two concrete Markov-modulated growth models. The result recovers the Rothblum index theorem only in a special affine case and does not define the Erlang shape parameter from the target tail, fit any parameter to the outcome distribution, or rest on a load-bearing self-citation chain. All load-bearing steps are therefore independent of the final claim.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The paper relies on standard results from holomorphic matrix functions and Tauberian theorems; no free parameters or invented entities are indicated in the abstract.

axioms (2)

standard math Tauberian theorem linking pole order of the resolvent to tail asymptotics of the distribution
Invoked to translate the pole-order result into Erlang shape parameter for the growth models.
domain assumption Holomorphic matrix-valued function with reducible Metzler structure admits a real pole whose order is given by the new theorem
Central assumption enabling the main technical contribution.

pith-pipeline@v0.9.0 · 5622 in / 1371 out tokens · 17891 ms · 2026-05-24T00:51:29.184415+00:00 · methodology

Reducible Markov modulation, pole order, and tail behavior in random growth models

Core claim

What carries the argument

Load-bearing premise

What would settle it

discussion (0)