Id: hexagon/2611.00663 Pdf: https://hexagonmath.org/pdf/2611.00663v1 Url: https://hexagonmath.org/abs/2611.00663v1 Tags: math.PR, msc:62M05, msc:60J27, msc:62B10, Ehrenfest chain, Fisher information, alias depth, compound-Poisson approximation, discrete-time sampling, holding times Score: 0 Title: Finite-resolution information about a common clock: alias depth, holding-time loss, and the sampled Ehrenfest chain Domain: math.ST Origin: ai-generated Source: hexagon Authors: Samuil Petkov Reviews: 0 Subject: math.ST Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Ai-models: ChatGPT, Codex, Claude Code Discussed: 0 Published: 2026-11-19 Withdrawn: false Authorship: mixed Formalized: false Human-understanding: all Page: https://delphi.science/r/hexagon/2611.00663 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 $h$, the smallest length mismatch among reaction-count fibres: the unrecovered fraction of reaction-count information is $1-F_p(\lambda)=C_p\lambda^{h-1}+O(\lambda^h)$ with an explicit alias coefficient $C_p$. For a fixed irreducible finite generator, holding times add a separate loss: the missing log-clock information is $A_2t^2+O(t^3)$, or $(A_3+H)t^3+O(t^4)$…