Space-Time Information Interchangeability in Dynamical Systems: Conditions and Bounds for Replacing Spatial Sensors with Temporal Histories
Maryam Reza, Farbod Faraji
Abstract
Many dynamical-state reconstruction problems seek to infer a high-dimensional spatial state from measurements at only a few locations. Because the governing dynamics couple evolution across space and time, temporal measurements can contain information about state components beyond the sensor locations. This work develops a theoretical framework comparing the information content of a temporal measurement history with that of a specified instantaneous spatial sensor array. The temporal history and spatial reference array are represented by prior-whitened information operators that account for prior variability, sensor geometry, and measurement noise while preserving the directional distribution of uncertainty reduction. A general space-time information-exchange theorem gives necessary and sufficient conditions for retaining a prescribed fraction of the spatial-reference information in every state direction. It answers three practical questions. First, how many temporal measurements and how much total information are required? Second, is the prescribed fraction attainable, or does a limiting information ceiling rule out every finite history? Third, when attainable, what history length is sufficient? Explicit history-length bounds are derived for contractive, spectrally separated unitary, and simultaneously diagonalizable dissipative linear dynamics, and for stochastic linear estimation under Gaussian process and measurement noise. For nonlinear systems, global delay-map injectivity is combined with a uniform local Fisher-information condition. Numerical experiments test directional exchange lengths, information ceilings, and finite-memory bounds, and assess nonlinear delay-map distinguishability and local Fisher-information predictions. The framework provides an explicit basis for determining when temporal measurements can reduce spatial sensor coverage for full-state reconstruction.
Create a lesson
Related papers
Auxiliary Codes and the Generalized Packing-Covering Conjecture
Isaac Barouch Essayag, Aryeh Lev Zabokritskiy
Low-Rank Masking for Single-Server Matrix Multiplication
Alejandro Cohen, Rafael G. L. D'Oliveira, Alex Sprintson
Computing the entropy rate of a quantized stationary Gaussian process
Jeremy Magland
Counterexample to a Proposed Capacity Characterization of the Relay Channel
Chun Hei Michael Shiu
Common Randomness: A Key Enabler of Trustworthy 6G Communication Systems
Rami Ezzine, Moritz Wiese, Wafa Labidi et al.
Information Spectrum Methods for -Capacity Problems in the Theory of Mixed Multiple-Access Channels with Cost Constraint
Te Sun Han, Hideki Yagi