Metraipolis › archive › dc_5d71e668f4e0

Identifying Probability Localization Dynamics via Structured Stochastic Liftings — arXiv:2608.22686

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.22686
License (as archived)
CC0-1.0
Archived
2026-10-18T10:09:34.407Z
SHA-256 of the archived text
e61e35ecc37ec8a1ad91a385fd407a3b7a564252754dcb6d9b05ed3b2c4b2797
Stable URL of this page
https://metraipolis.com/documento/dc_5d71e668f4e0

How to cite

Identifying Probability Localization Dynamics via Structured Stochastic Liftings — arXiv:2608.22686 — arXiv (en), https://arxiv.org/abs/2608.22686 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_5d71e668f4e0 (Metraipolis archive dc_5d71e668f4e0, sha256 e61e35ecc37ec8a1ad91a385fd407a3b7a564252754dcb6d9b05ed3b2c4b2797)
BibTeX
@misc{dc5d71e668f4e0,
  title = {Identifying Probability Localization Dynamics via Structured Stochastic Liftings — arXiv:2608.22686},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.22686},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_5d71e668f4e0; sha256 e61e35ecc37ec8a1ad91a385fd407a3b7a564252754dcb6d9b05ed3b2c4b2797},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.22686. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

This work develops a discrete-time framework for identifying probability localization dynamics through finite stochastic representations adapted in space, time, memory, and state information. A compact dynamically relevant set is localized by a finite measurable partition, producing an observable probability state and a relational graph of admissible transitions. Structured stochastic liftings derived from Stochastically Structured Reservoir Computing (SSRC) give lossless polynomial representations of the observable state, while stochastic delay liftings add finite observable memory. These are distinguished from dynamically informed state-space enrichment: refinement of observational fibers containing states with the same present observation but different observable futures, yielding an exact obstruction-to-closure criterion. A route-network toy problem gives a minimal obstruction example, while four numerical laboratories (rotational phase dynamics, the chaotic logistic map, the Van der Pol oscillator, and a synthetic cyclic inventory system) show how spatial scale, temporal scale, polynomial degree, and delay depth interact. The logistic map isolates representation-induced memory in an otherwise Markovian chaotic system, using its exact invariant law as an ergodic benchmark and its zero-mass pseudospectrum to separate relaxation from transient amplification. An exact rotational cycle calibrates pseudospectra as a robustness diagnostic rather than a closure certificate. The inventory example gives a closure-driven enrichment procedure: residence-age hazards trigger age-refined states that improve predictive scores. These results motivate a minimal adequate representation: the least complex representation meeting predictive, structural, and identifiability requirements.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-08-25 in eess.SY).
Categorie arXiv: Dynamical Systems (math.DS) ; Systems and Control (eess.SY); Chaotic Dynamics (nlin.CD).
Pagina del lavoro: https://arxiv.org/abs/2608.22686 — 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-18T10:08:09.918Z dalla pagina https://arxiv.org/catchup/eess.SY/2026-08-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).