An exact Jordan signature in cumulative-count first-passage statistics
arXiv:2609.20148
Abstract
For cumulative-count first-passage problems, the Laplace transform of the time of the th count is naturally expressed through powers of a one-count kernel. A Jordan defect of that kernel does not, however, automatically survive the complete sum over terminal phases. We give an exact three-state Markov-renewal example in which it does. At , the one-count kernel has spectrum , with a one-dimensional eigenspace at , and for initial phase , \[ \mathbb E_1[e^{-\mathcal T_N}] =\frac56\,2^{-N}+\frac{N+1}{6}\,8^{-N}. \] Thus the ordinary, unconditioned cumulative-count transform contains the explicit Jordan contribution at every threshold . For the same fixed stochastic process, the two eigenvalues meeting at unfold as \[ λ_\pm(s)=\frac18\pm\frac1{96}\sqrt{s-1} -\frac{131}{2304}(s-1)+O((s-1)^{3/2}), \] and the characteristic discriminant has a simple zero at . We place the example beside two structures that suppress such a marginal signature: fixed post-count reset, which gives scalar renewal, and a common total holding rate, for which terminal summation scalarizes the matrix power. The model also admits a monitored-Lindblad realization, but the mechanism is entirely classical. The result provides a small exact benchmark for how generalized spectral modes can remain visible in finite-threshold first-passage statistics.
arXiv commentSubstantially revised and narrowed. Corrects the earlier exceptional-point interpretation, clarifies counted self-transitions and terminal-summed visibility, and adds an exact three-state Markov-renewal example with a nonzero N8^{-N} Jordan term and square-root eigenvalue ramification. The mechanism is classical; the Lindblad model is an embedding