Metraipolis › archive › dc_deb1e6fcc930
Mathematical modelling of a multicluster open system: transfer-operator recovery from aggregate data under a least-action prior — arXiv:2609.29628
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.29628
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T06:07:21.453Z
- SHA-256 of the archived text
f9c85e5d185b3f759cc2896e7ed7c07da590042a80ce1cb6f996b8b3fadb9f79- Stable URL of this page
https://metraipolis.com/documento/dc_deb1e6fcc930
How to cite
Mathematical modelling of a multicluster open system: transfer-operator recovery from aggregate data under a least-action prior — arXiv:2609.29628 — arXiv (en), https://arxiv.org/abs/2609.29628 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_deb1e6fcc930 (Metraipolis archive dc_deb1e6fcc930, sha256 f9c85e5d185b3f759cc2896e7ed7c07da590042a80ce1cb6f996b8b3fadb9f79)
BibTeX
@misc{dcdeb1e6fcc930,
title = {Mathematical modelling of a multicluster open system: transfer-operator recovery from aggregate data under a least-action prior — arXiv:2609.29628},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.29628},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_deb1e6fcc930; sha256 f9c85e5d185b3f759cc2896e7ed7c07da590042a80ce1cb6f996b8b3fadb9f79},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.29628. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Many open systems are observed only through aggregate snapshots, while the rule that moves objects between states stays hidden. This paper studies the inverse problem of recovering the transfer operator of a multicluster open system from two adjacent snapshots. The consistent operators fill an affine manifold: the data fix the aggregate flows and leave the internal routing free, so every recovery method commits to a prior that selects one operator. Tikhonov regularisation with a zero reference gives the uniform outflow on each source simplex, which underestimates retention in an inertial system. We propose least action on the operator trajectory, under which the rule changes as little as the data permit. In discrete time this is exact as a probability statement: the action prices a trajectory by its likelihood under a Gaussian reference drawn toward full retention, so least action selects the most probable trajectory consistent with the balance. A causal construction keeps the balance exact by moving the operator only inside the null space of the constraints, and we relate it to optimal transport, to Perron-Frobenius coarse-graining, and to the Schrödinger bridge. Two instantiations carry it: the Russian labour market and a radiation-damped relativistic electron ensemble. The construction holds the balance to machine precision where temporal smoothing corrupts it by twelve percent on the labour series and sixty percent in the physical one. The spectral gap is non-identifiable from aggregate snapshots but available from micro-trajectories, where Ulam's method reproduces the Landau-Lifshitz rate to within six percent. On the short labour series no method beats the naive forecast in point accuracy at conventional significance levels. The value is structural: an interpretable operator, an exactly preserved balance, and an explicit information limit of aggregate observation. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-25 in math.OC). Categorie arXiv: Dynamical Systems (math.DS) ; Numerical Analysis (math.NA); Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2609.29628 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-08T05:31:31.184Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).