One bit of timing for irreversibility detection on a noisy trajectory

We sample a stationary finite-state Markov jump process with an independent Poisson clock and observe each sampled state through a noisy readout. At low clock rates, only a small fraction of consecutive reads are close enough to preserve appreciable time asymmetry. We test equilibrium against alternatives with entropy production rate at least ε. For small clock rate γ and separation ε, the optimal worst-case deadline is of order γ⁻³ε⁻¹ if the test sees only the ordered labels and the read count. Recording one bit to identify gaps at or below a sufficiently small fixed threshold reduces the deadline to order γ⁻²ε⁻¹, the same order as with exact gap durations. These bounds hold on fixed reciprocal networks with at least one cycle and unknown, well-conditioned memoryless readout. If each report depends only on its true short-gap bit and the reports are conditionally independent, a fixed discrimination margin gives a worst-case gap count of order (p+u)/(p²ε), where p is the probability of a short gap and u is the false-positive rate cap on long gaps. The ideal order is retained in the worst case if u=O(p). Likelihood tests on the same synthetic trajectories illustrate the gain at equal marginal false-positive probabilities.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-20
DOI
https://doi.org/10.5281/zenodo.24375761
Primary Topic
Advanced Thermodynamics and Statistical Mechanics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

One bit of timing for irreversibility detection on a noisy trajectory

Weiqi Jiang
Zenodo (CERN European Organization for Nuclear Research)
Advanced Thermodynamics and Statistical Mechanics
preprint

One bit of timing for irreversibility detection on a noisy trajectory

Weiqi Jiang
preprint en

Abstract

We sample a stationary finite-state Markov jump process with an independent Poisson clock and observe each sampled state through a noisy readout. At low clock rates, only a small fraction of consecutive reads are close enough to preserve appreciable time asymmetry. We test equilibrium against alternatives with entropy production rate at least ε. For small clock rate γ and separation ε, the optimal worst-case deadline is of order γ⁻³ε⁻¹ if the test sees only the ordered labels and the read count. Recording one bit to identify gaps at or below a sufficiently small fixed threshold reduces the deadline to order γ⁻²ε⁻¹, the same order as with exact gap durations. These bounds hold on fixed reciprocal networks with at least one cycle and unknown, well-conditioned memoryless readout. If each report depends only on its true short-gap bit and the reports are conditionally independent, a fixed discrimination margin gives a worst-case gap count of order (p+u)/(p²ε), where p is the probability of a short gap and u is the false-positive rate cap on long gaps. The ideal order is retained in the worst case if u=O(p). Likelihood tests on the same synthetic trajectories illustrate the gain at equal marginal false-positive probabilities.

Zenodo (CERN European Organization for Nuclear Research)
Chinese Academy of Sciences (CN), Institute of Theoretical Physics (CN)
Advanced Thermodynamics and Statistical Mechanics
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.

Laika access coming soon