Searcharxiv⌕ Search

arXiv · 2611.11069

Mean-level arithmetic computation via stochastic reaction networks

Abstract

Reaction networks provide a natural model for analog computation in which inputs and outputs are encoded by molecular abundances. Much of the work on analog computation with chemical reaction networks (CRNs) has focused on deterministic mass-action systems. In DNA- and protein-based circuits, however, low copy numbers can make intrinsic fluctuations significant, motivating the use of stochastic models. In this paper, we develop a framework for computation with stochastic CRNs at the level of stationary means. Specifically, we construct elementary arithmetic modules for identification, addition, and multiplication, and analyze their mean-level correctness and convergence rates. We focus on these three modules because they are simple enough to analyze explicitly while already exhibiting the new issues raised by stochastic mean-level computation. Unlike in deterministic systems, the computed value cannot be read from a single output measurement. Instead, readout requires Monte Carlo estimation, with error arising from transient bias as the system approaches stationarity and intrinsic sampling noise that persists even at stationarity. We therefore study the convergence rates of output means, variances, and autocovariances to their stationary values, as well as the stationary fluctuations governing sampling error. We also show that this readout cost can depend strongly, and sometimes unexpectedly, on the architecture of the computation. In particular, comparing linear-chain and binary-tree implementations reveals that binary trees can greatly reduce stationary variance for addition, but can instead produce exponentially larger variance for multiplication.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

David F. Anderson, Seokhwan Moon. 2026-11-08. Mean-level arithmetic computation via stochastic reaction networks. https://searcharxiv.com/abs/2611.11069

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Approximation of the Lévy-driven stochastic heat equation on the sphere

The stochastic heat equation on the sphere driven by an additive square-integrable Lévy process is approximated by a spectral method in space and forward and backward Euler-Maruyama schemes in time. New sharp regularity results are proven for its solution. The spectral approximation is based on a truncation of the series expansion with respect to the spherical harmonic functions. For a given regularity of the initial condition and two different settings of regularity for the driving noise, strong convergence rates for the spectral approximation and for the Euler-Maruyama methods are proven. Moreover, weak rates of up to twice the strong rates are shown for Wiener noise and for Lévy noise with independent and up to a deterministic decay rate factor identically distributed components, while for general square-integrable Lévy noise the weak rate depends explicitly on the polynomial order of the test function. Numerical simulations confirm the theoretical results.

math.PR↗

A Multivariate Generalized Cox Model for Dependent and Simultaneous Default Times

We propose a framework for dependent default times where each name defaults when an increasing driver crosses an independent unit exponential threshold. As in Gueye and Jeanblanc (2022), the drivers may jump, so defaults may occur at stopping times of the reference filtration, including predictable ones, and a common jump may cause no, one or several simultaneous defaults. For general drivers, we derive the conditional joint survival law by a backward recursion; it is an explicit product of survival functions if and only if, for every set of names, the predictable reduction of the compensator of their first default time is deterministic. If, moreover, defaults avoid predictable stopping times, the law is a fatal shock law with hazards identified from the drivers; predictable default atoms can rule this out. Examples include Lévy subordinators and, with random reductions but explicit laws, Liu's model and shot-noise drivers with memory.

math.PR↗

Boundary Feller-Dynkin processes associated with Laguerre processes and Pickrell diffusions

In this paper, we construct a Feller-Dynkin boundary process by applying the method of intertwiners to the coherent family, introduced in our previous work, of Laguerre processes with a fixed parameter. The corresponding boundary process is computed explicitly, and it turns out to be a deterministic dynamical system. Since the Pickrell diffusions that leave the Pickrell measure invariant are coherent with respect to the same projective system, we also obtain the stochastic boundary process associated with the coherent family of Pickrell diffusions.

math.PR↗