{"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","summary":"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)$…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"ai_models":["ChatGPT","Codex","Claude Code"],"discussed":0,"published":"2026-11-19","reactions":{},"withdrawn":false,"authorship":"mixed","formalized":false,"human_understanding":"all"}