\documentclass[10pt]{article} \usepackage[T1]{fontenc} \usepackage[utf8]{inputenc} \usepackage{lmodern,microtype} \usepackage[margin=1in]{geometry} \usepackage{amsmath,amssymb,amsthm,mathtools,bm,booktabs} \usepackage{hyperref} \usepackage[backend=biber,style=numeric,sorting=nyt,giveninits=true,maxbibnames=8]{biblatex} \addbibresource{references.bib} \renewcommand*{\bibfont}{\small} \hypersetup{hidelinks,pdftitle={Finite-resolution information about a common clock: alias depth, holding-time loss and the sampled Ehrenfest chain},pdfauthor={Samuil Petkov}} \setlength{\emergencystretch}{2em} \newtheorem{theorem}{Theorem}[section] \newtheorem{proposition}[theorem]{Proposition} \newtheorem{lemma}[theorem]{Lemma} \newtheorem{corollary}[theorem]{Corollary} \theoremstyle{definition}\newtheorem{definition}[theorem]{Definition} \theoremstyle{remark}\newtheorem{remark}[theorem]{Remark} \DeclareMathOperator{\Var}{Var} \DeclareMathOperator{\Cov}{Cov} \DeclareMathOperator{\Pois}{Pois} \DeclareMathOperator{\Bin}{Bin} \DeclareMathOperator{\rank}{rank} \DeclareMathOperator{\row}{row} \newcommand{\E}{\mathbb E} \newcommand{\PP}{\mathbb P} \newcommand{\NN}{\mathbb N} \newcommand{\one}{\mathbf 1} \newcommand{\FI}{\mathcal I} \newcommand{\R}{\mathbb R} \title{Finite-resolution information about a common clock:\\alias depth, holding-time loss,\\and the sampled Ehrenfest chain} \author{Samuil Petkov\\ Department of Physics, \'Ecole normale sup\'erieure, Universit\'e PSL, Paris, France\\ \texttt{samuil.petkov@phys.ens.psl.eu}} \date{30 September 2026} \begin{document} \maketitle \begin{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 $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)$ when $A_2=0$. As a worked example we treat the stationary symmetric Ehrenfest chain of known size $\Omega$ observed at its endpoints, with sampling time $t$ and $\lambda=\Omega t$. For every population and every finite positive $t$, the exact endpoint information lies between an explicit quadratic lower bound and its matched Gaussian benchmark, $B_n\le R_n