Finite-resolution information about a common clock: alias depth, holding-time loss, and the sampled Ehrenfest chain
Version 1 / Nov 19, 2026 / CC BY 4.0
Abstract
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.
Provenance statement
Tools used
- OpenAI
- ChatGPTVersion GPT-5.6 Sol
- OpenAI
- CodexVersion GPT-5.6 Sol
- Anthropic
- Claude CodeVersion Claude Opus 5.5
References
- Duval, Céline; Hoffmann, Marc. Statistical inference across time scales. vol. 5, pp. 2004–2030. 2011DOI
- Duval, Céline. When is it no longer possible to estimate a compound Poisson process?. vol. 8, no. 1, pp. 274–301. 2014DOI
- Coca, Alberto J. Efficient nonparametric inference for discretely observed compound Poisson processes. vol. 170, pp. 475–523. 2018DOI
- Louis, Thomas A. Finding the observed information matrix when using the EM algorithm. vol. 44, no. 2, pp. 226–233. 1982DOI
- Bladt, Mogens; Sørensen, Michael. Statistical inference for discretely observed Markov jump processes. vol. 67, no. 3, pp. 395–410. 2005DOI
- Hobolth, Asger; Jensen, Jens Ledet. Statistical inference in evolutionary models of DNA sequences via the EM algorithm. vol. 4, no. 1. 2005DOI
- Hobolth, Asger; Jensen, Jens Ledet. Summary statistics for endpoint-conditioned continuous-time Markov chains. vol. 48, no. 4, pp. 911–924. 2011DOI
- Kurtz, Thomas G. Solutions of ordinary differential equations as limits of pure jump Markov processes. vol. 7, no. 1, pp. 49–58. 1970DOI
- Komorowski, Michał; Costa, Maria J.; Rand, David A.; Stumpf, Michael P. H. Sensitivity, robustness, and identifiability in stochastic chemical kinetics models. vol. 108, no. 21, pp. 8645–8650. 2011DOI
- Pantazis, Yannis; Katsoulakis, Markos A.; Vlachos, Dionisios G. Parametric sensitivity analysis for biochemical reaction networks based on pathwise information theory. vol. 14. 2013DOI
Show all 34 referencesShow fewer references
- Tataru, Paula; Hobolth, Asger. Comparison of methods for calculating conditional expectations of sufficient statistics for continuous time Markov chains. vol. 12. 2011DOI
- Radaelli, Marco; Landi, Gabriel T.; Modi, Kavan; Binder, Felix C. Fisher information of correlated stochastic processes. vol. 25. 2023DOI
- Fox, Zachary R.; Munsky, Brian. The finite state projection based Fisher information matrix approach to estimate information and optimize single-cell experiments. vol. 15, no. 1. 2019DOI
- Diaconis, Persi; Sturmfels, Bernd. Algebraic algorithms for sampling from conditional distributions. vol. 26, no. 1, pp. 363–397. 1998DOI
- Anderson, David F.; Craciun, Gheorghe; Kurtz, Thomas G. Product-form stationary distributions for deficiency zero chemical reaction networks. vol. 72, no. 8, pp. 1947–1970. 2010DOI
- Comte, Fabienne; Genon-Catalot, Valentine. Nonparametric adaptive estimation for pure jump Lévy processes. vol. 46, no. 3, pp. 595–617. 2010DOI
- Moor, Anne-Lena; Tjalma, Age; Reinhardt, Manuel; ten Wolde, Pieter Rein; Zechner, Christoph. State- versus Reaction-Based Information Processing in Biochemical Networks. vol. 136. 2026DOI
- Prech, Kacper; Landi, Gabriel T.; Meier, Florian; Nurgalieva, Nuriya; Potts, Patrick P.; Silva, Ralph; Mitchison, Mark T. Optimal Time Estimation and the Clock Uncertainty Relation for Stochastic Processes. vol. 15. 2025DOI
- Macieszczak, Katarzyna. Ultimate Kinetic Uncertainty Relation and Optimal Performance of Stochastic Clocks. 2024. PreprintDOI
- Di Terlizzi, Ivan; Baiesi, Marco. Kinetic uncertainty relation. vol. 52. 2019DOI
- Aït-Sahalia, Yacine; Jacod, Jean. Fisher's Information for Discretely Sampled Lévy Processes. vol. 76, no. 4, pp. 727–761. 2008DOI
- Diaconis, Persi; Griffiths, Robert. Exchangeable pairs of Bernoulli random variables, Krawtchouck polynomials, and Ehrenfest urns. vol. 54, no. 1, pp. 81–101. 2012DOI
- Weiß, Christian H.; Kim, Hee-Young. Parameter estimation for binomial AR(1) models with applications in finance and industry. vol. 54, pp. 563–590. 2013DOI
- Cui, Yunwei; Lund, Robert. Inference in binomial AR(1) models. vol. 80, no. 23–24, pp. 1985–1990. 2010DOI
- Pollard, David. A note on insufficiency and the preservation of Fisher information. From Probability to Statistics and Back: High-Dimensional Models and Processes–A Festschrift in Honor of Jon A. Wellner, vol. 9, pp. 266–275. 2013DOI
- Takeuchi, Kei; Takemura, Akimichi. On sum of 0–1 random variables. I. Univariate case. vol. 39, no. 1, pp. 85–102. 1987DOI
- Weiß, Christian H.; Kim, Hee-Young. Binomial AR(1) processes: moments, cumulants, and estimation. vol. 47, no. 3, pp. 494–510. 2013DOI
- Kingman, J. F. C. The imbedding problem for finite Markov chains. vol. 1, no. 1, pp. 14–24. 1962DOI
- Israel, Robert B.; Rosenthal, Jeffrey S.; Wei, Jason Z. Finding generators for Markov chains via empirical transition matrices, with applications to credit ratings. vol. 11, no. 2, pp. 245–265. 2001DOI
- Phillips, P. C. B. The problem of identification in finite parameter continuous time models. vol. 1, no. 4, pp. 351–362. 1973DOI
- Kalbfleisch, J. D.; Lawless, J. F. The analysis of panel data under a Markov assumption. vol. 80, no. 392, pp. 863–871. 1985DOI
- Becker, Gerhard; Kersting, Götz. Design problems for the pure birth process. vol. 15, no. 2, pp. 255–273. 1983DOI
- Pagendam, D. E.; Pollett, P. K. Locally optimal designs for the simple death process. vol. 140, no. 11, pp. 3096–3105. 2010DOI
- Aït-Sahalia, Yacine; Mykland, Per A. The effects of random and discrete sampling when estimating continuous-time diffusions. vol. 71, no. 2, pp. 483–549. 2003DOI
Version history
- v1 · 23 pagesSubmitted by Samuil PetkovInitial depositCurrentNov 19, 2026