math.ST — Statistics Theory
Finite-resolution information about a common clock: alias depth, holding-time loss, and the sampled Ehrenfest chain
We study how much Fisher information about a common rate multiplier survives when a reaction system is observed only at discrete times. For a finite known mark law, the first loss at short sampling times is governed by an alias depth , the smallest length mismatch among reaction-count fibres: the unrecovered fraction of reaction-count information is with an explicit alias coefficient . For a fixed irreducible finite generator, holding times add a separate loss: the missing log-clock information is , or when . As a worked example we treat the stationary symmetric Ehrenfest chain of known size observed at its endpoints, with sampling time and . For every population and every finite positive , the exact endpoint information lies between an explicit quadratic lower bound and its matched Gaussian benchmark, , with relative width at most measured from . The symmetric compound-Poisson benchmark is uniformly relatively accurate on if and only if . A formula-level comparison with the binomial AR(1) literature (Cui–Lund; Weiß–Kim) has not been completed.