PreprintarXiv licencearXiv
The Spectral Cost of Detecting Nonequilibrium at Finite Temporal Resolution
Abstract
A detector that cannot take two snapshots closer than a time τ0 still identifies a fully observed finite Markov generator exactly, provided its gaps are randomized by two clocks. Identification is not detection. For a normal nonequilibrium network, the number of snapshots needed to reject every hidden equilibrium explanation grows as e2γirrτ0, where γirr is the slowest damping of rotating modes. No adaptive schedule beats this rate, and a test on one dependent trajectory attains it.
Related
- A theory for detecting the Turing instability on static and temporal multiplex networks
- Dynamic calibration method for the system constant of high-spectral-resolution lidar with airborne experimental verification
- Understanding the high-resolution spectral signatures of Ar-D2O in the 3OD stretch region measured by cavity ringdown absorption spectroscopy
- The optical high-resolution spectral archive of the HERMES spectrograph mounted on the 1.2m Mercator telescope
- Nonlinear spectral back transfer limits the temporal coherency of zonal modes
BibTeX
@misc{aznagulov2026spectral,
title = {{The Spectral Cost of Detecting Nonequilibrium at Finite Temporal Resolution}},
author = {Murad Aznagulov},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.37205},
eprint = {2609.37205},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.37205},
}
RIS
TY - UNPB
TI - The Spectral Cost of Detecting Nonequilibrium at Finite Temporal Resolution
AU - Murad Aznagulov
PY - 2026
DA - 2026/09/29
PB - arXiv
DO - 10.48550/arxiv.2609.37205
UR - https://arxiv.org/abs/2609.37205
AB - A detector that cannot take two snapshots closer than a time τ_0 still identifies a fully observed finite Markov generator exactly, provided its gaps are randomized by two clocks. Identification is not detection. For a normal nonequilibrium network, the number of snapshots needed to reject every hidden equilibrium explanation grows as e^2γ_irrτ_0, where γ_irr is the slowest damping of rotating modes. No adaptive schedule beats this rate, and a test on one dependent trajectory attains it.
ER -