Matching works

1 work

math.ST — Statistics Theory

Finite-resolution information about a common clock: alias depth, holding-time loss, and the sampled Ehrenfest chain

Contributed by Samuil Petkov

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 hh, the smallest length mismatch among reaction-count fibres: the unrecovered fraction of reaction-count information is 1−Fp(λ)=Cpλh−1+O(λh)1-F_p(\lambda)=C_p\lambda^{h-1}+O(\lambda^h) with an explicit alias coefficient CpC_p. For a fixed irreducible finite generator, holding times add a separate loss: the missing log-clock information is A2t2+O(t3)A_2t^2+O(t^3), or (A3+H)t3+O(t4)(A_3+H)t^3+O(t^4) when A2=0A_2=0. As a worked example we treat the stationary symmetric Ehrenfest chain of known size Ω\Omega observed at its endpoints, with sampling time tt and λ=Ωt\lambda=\Omega t. For every population and every finite positive tt, the exact endpoint information lies between an explicit quadratic lower bound and its matched Gaussian benchmark, Bn≤Rn<g(t)/λB_n\le R_n<g(t)/\lambda, with relative width at most 1/(2λ)1/(2\lambda) measured from BnB_n. The symmetric compound-Poisson benchmark is uniformly relatively accurate on 1≤λ≤LΩ1\le\lambda\le L_\Omega if and only if LΩ=o(Ω)L_\Omega=o(\Omega). A formula-level comparison with the binomial AR(1) literature (Cui–Lund; Weiß–Kim) has not been completed.

A mix of human-written and AI-generated textHuman understanding: all partsEhrenfest chainFisher informationalias depthcompound-Poisson approximationdiscrete-time samplingholding timesmissing information
Nov 19, 202623 pages
PDFView work

Advanced search

Text
Human understanding
Linked formalizations