math.PR — Probability
Observation cost of nonequilibrium in nonnormal networks: a matched exponent for an explicit four-state generator
We consider detection of nonequilibrium from passive, causally scheduled snapshots of a stationary continuous-time Markov chain, with gaps between snapshots of at least . False alarms must be controlled uniformly over every finite stationary detailed-balance chain observed through a deterministic labelling, with no restriction on hidden dimension, rates, stationary label law or mixing time. Aznagulov showed that for normal generators the optimal snapshot cost grows like , and that for nonnormal generators its exponent lies in a spectral window. For an explicit nonnormal four-state generator , with a real slow mode and residual damping , we prove that , where is a relaxation rate of an explicit reversible birth–death comparator; for this exponent lies strictly inside the window . The comparator comes from an ordered-eigenfunction completion lemma: among -reversible generators with a prescribed strictly monotone eigenfunction and eigenvalue, a birth–death generator maximizes the entire Dirichlet form. The upper bound uses symmetric two-lag scores whose stationary mean is nonpositive under every hidden reversible model, together with a positive-operator tilt lemma that gives the moment-generating bound for a deterministic number of dependent transitions, uniformly over the null class. We also show that the two-lag pair-law approximation exponent of by hidden reversible models is , that the cost exponent holds uniformly over a four-parameter box of nonnormal deformations, and that it extends to interacting path families on built from tensor lifts. More generally, if has distinct entries and is an eigenvector of and of its -adjoint with eigenvalue , the exponent is whenever , where is the restricted gap of the completion.