Exponential Population Tails and Geometric Ergodicity in a Three-Species Stochastic Reaction Network

We prove rate-universal positive recurrence, exponential stationary molecule-count moments, and weighted geometric ergodicity for a restricted weakly reversible three-species stochastic mass-action network: reversible creation and annihilation of an A+C pair, reversible 2A↔2B exchange, and any strongly connected unary-conversion graph. An explicit exponential Foster–Lyapunov function with a quartic imbalance penalty establishes a uniformly negative drift outside a finite set; exact symbolic and independently sampled generator checks accompany the proof. The network has deficiency one, is not double-full, and generic rates are non-complex-balanced. The theorem does not settle the unrestricted weakly reversible positive-recurrence conjecture, and historical originality and peer review remain unverified.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-05
DOI
https://doi.org/10.5281/zenodo.23955202
Primary Topic
Stochastic processes and statistical mechanics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Exponential Population Tails and Geometric Ergodicity in a Three-Species Stochastic Reaction Network

Kias Henry
Zenodo (CERN European Organization for Nuclear Research)
Stochastic processes and statistical mechanics
preprint

Exponential Population Tails and Geometric Ergodicity in a Three-Species Stochastic Reaction Network

Kias Henry
preprint en

Abstract

We prove rate-universal positive recurrence, exponential stationary molecule-count moments, and weighted geometric ergodicity for a restricted weakly reversible three-species stochastic mass-action network: reversible creation and annihilation of an A+C pair, reversible 2A↔2B exchange, and any strongly connected unary-conversion graph. An explicit exponential Foster–Lyapunov function with a quartic imbalance penalty establishes a uniformly negative drift outside a finite set; exact symbolic and independently sampled generator checks accompany the proof. The network has deficiency one, is not double-full, and generic rates are non-complex-balanced. The theorem does not settle the unrestricted weakly reversible positive-recurrence conjecture, and historical originality and peer review remain unverified.

Zenodo (CERN European Organization for Nuclear Research)
Stochastic processes and statistical mechanics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon