Trajectory-Aware Node Contributions and the Limits of Static Controllability

• URL: http://arxiv.org/abs/2606.03067v2
• Date: Thu, 04 Jun 2026 00:13:05 GMT
• Title: Trajectory-Aware Node Contributions and the Limits of Static Controllability
• Abstract summary: "emergent contribution" is a measure of a node's dynamical leverage.<n>"EC" reduces exactly to average controllability in the linear, time-invariant limit.<n>We place five estimated real systems from several domains within this phase space.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A recurring data mining task in complex networks is to determine how individual nodes contribute to system behavior. Existing approaches rely on either static-graph centralities or control-theoretic quantities such as controllability Gramians, which assume linear, time-invariant dynamics. Estimated systems, however, are typically nonlinear and time-varying. We define "emergent contribution (EC)," a finite-horizon measure of a node's dynamical leverage: the metric-weighted energy of its impulse response accumulated along the system trajectory. Computed from the Jacobians of any differentiable model, EC is estimator-agnostic and reduces exactly to average controllability in the linear, time-invariant limit. Our contribution is a characterization of when the two measures agree and diverge. Using a controlled synthetic family with known ground-truth contribution, we construct a phase diagram spanning nonlinearity, regime structure, persistence, and perturbation amplitude. EC and average controllability agree under static or smoothly drifting dynamics and both track ground truth. Divergence emerges under persistent regime switching, is strongest under persistent sign reversal, and disappears when the sign reversal is removed. At extreme perturbation amplitudes, both measures degrade, identifying the limits of local linearization. We place five estimated real systems from several domains within this phase space. Their placement serves as a diagnostic of when EC provides information beyond static controllability and therefore justifies its additional computational cost. On one panel examined in depth, a twenty-seed retraining ensemble reveals a robust variance--leverage dissociation: nodes whose perturbations propagate widely despite low within-system variance, which is not recovered by static centralities nor variance-based summaries.

Related papers

• Self-Supervised Cardiac Phase Detection via Single-Parameter Latent Orbits [44.45620787098836]
  Accurate identification of end-diastole (ED) and end-systole (ES) in echocardiography underpins the quantification of ventricular function.<n>Recent self-supervised methods either prescribe strict periodic trajectories or learn an unconstrained low-dimensional motion subspace from reconstruction or registration objectives.<n>We learn an effective latent orbit, significantly improves upon the previous state of the art in ED localisation and matches it in ES localisation while using a more constrained representation and fewer training epochs.
  arXiv  Detail & Related papers  (2026-09-10T14:56:16Z)
• Nonlocality-induced critical-length hierarchy from non-Hermitian competition [48.9823527611878]
  In short-range systems formed by two coupled chains, competition leads to the critical-length law $N_csimln D$.<n>Here we show that long-range hoppings fundamentally reorganizes this critical behavior, producing a hierarchy of distinct scaling laws.<n>Our results offer a platform-independent framework testable in programmable topoelectrical circuits, photonic lattices and digital quantum simulators.
  arXiv  Detail & Related papers  (2026-08-03T18:00:18Z)
• Effective Covariance Dynamics in Solvable High-Dimensional GANs [2.639628765667673]
  We study a solvable high-dimensional model of generative adversarial network (GAN) training in which a linear generator learns a low-dimensional subspace from data.<n>We prove that the microscopic training process converges, in the high-dimensional limit, to deterministic ordinary differential equations governed by this effective covariance.
  arXiv  Detail & Related papers  (2026-06-25T16:33:54Z)
• Neural Control: Adjoint Learning Through Equilibrium Constraints [7.41073008855977]
  We propose a boundary-control framework that computes trajectory-dependent, memory-efficient proxy gradients.<n>We show improved performance over gradient-free baselines such as SPSA and CEM.
  arXiv  Detail & Related papers  (2026-05-05T02:19:37Z)
• Scale-Aware Adversarial Analysis: A Diagnostic for Generative AI in Multiscale Complex Systems [5.173587482427292]
  We introduce a diagnostic framework driven by Constrained Diffusion Decomposition (CDD)<n>We execute deterministic interventions directly within the continuous, CDD-based scale space.<n>We demonstrate that under moderate physical perturbations, the unconstrained generative model exhibits localized structural freezing and non-linear instability.
  arXiv  Detail & Related papers  (2026-05-01T08:36:52Z)
• Rare Event Analysis via Stochastic Optimal Control [39.211234628277744]
  We introduce a framework that casts committor estimation as an optimal control (SOC) problem.<n>We develop two complementary objectives: a direct backpropagation loss and a principled off-policy Value Matching loss.<n>On benchmark systems, the framework yields more accurate committor estimates, reaction rates, and equilibrium constants than existing methods.
  arXiv  Detail & Related papers  (2026-04-14T18:34:38Z)
• A machine learning framework for uncovering stochastic nonlinear dynamics from noisy data [35.634572760830764]
  Noise influences the inference of system parameters and ignore dynamics from data.<n>We develop a hybrid symbolic regression-probabilistic machine learning framework that recovers the symbolic form of the governing equations while simultaneously inferring uncertainty in the system parameters.<n>The framework is data-efficient, requiring as few as 100-1000 data points, and robust to noise - demonstrating its broad potential in domains where uncertainty is intrinsic and both the structure and variability of dynamical systems must be understood.
  arXiv  Detail & Related papers  (2026-04-07T16:59:40Z)
• Information-Theoretic Bounds and Task-Centric Learning Complexity for Real-World Dynamic Nonlinear Systems [0.6875312133832079]
  Dynamic nonlinear systems exhibit distortions arising from coupled static and dynamic effects.<n>This paper presents a theoretical framework grounded in structured decomposition, variance analysis, and task-centric complexity bounds.
  arXiv  Detail & Related papers  (2025-09-08T12:08:02Z)
• Entanglement and operator correlation signatures of many-body quantum Zeno phases in inefficiently monitored noisy systems [49.1574468325115]
  The interplay between information-scrambling Hamiltonians and local continuous measurements hosts platforms for exotic measurement-induced phase transition. We identify a non-monotonic dependence on the local noise strength in both the averaged entanglement and operator correlations. The analysis of scaling with the system size in a finite length chain indicates that, at finite efficiency, this effect leads to distinct MiPTs for operator correlations and entanglement.
  arXiv  Detail & Related papers  (2024-07-16T13:42:38Z)
• HarmonICA: Neural non-stationarity correction and source separation for motor neuron interfaces [37.0279893661798]
  We propose a potential solution, using an unsupervised learning algorithm to blindly correct for the effects of latent processes which drive the signal non-stationarities. The proposed design, HarmonICA, sidesteps the identifiability problems of nonlinear ICA. We test HarmonICA on both invasive and non-invasive recordings both simulated and real.
  arXiv  Detail & Related papers  (2024-06-28T00:08:13Z)
• TANGO: Time-Reversal Latent GraphODE for Multi-Agent Dynamical Systems [43.39754726042369]
  We propose a simple-yet-effective self-supervised regularization term as a soft constraint that aligns the forward and backward trajectories predicted by a continuous graph neural network-based ordinary differential equation (GraphODE) It effectively imposes time-reversal symmetry to enable more accurate model predictions across a wider range of dynamical systems under classical mechanics. Experimental results on a variety of physical systems demonstrate the effectiveness of our proposed method.
  arXiv  Detail & Related papers  (2023-10-10T08:52:16Z)
• Machine learning in and out of equilibrium [58.88325379746631]
  Our study uses a Fokker-Planck approach, adapted from statistical physics, to explore these parallels. We focus in particular on the stationary state of the system in the long-time limit, which in conventional SGD is out of equilibrium. We propose a new variation of Langevin dynamics (SGLD) that harnesses without replacement minibatching.
  arXiv  Detail & Related papers  (2023-06-06T09:12:49Z)
• Diagnosing entanglement dynamics in noisy and disordered spin chains via the measurement-induced steady-state entanglement transition [0.0]
  We analyze the interplay and competition of processes that generate and destroy entanglement in a one-dimensional quantum spin chain under a noisy Hamiltonian. Our results establish a firm connection between this entanglement growth and the steady-state behavior of the measurement-controlled systems.
  arXiv  Detail & Related papers  (2021-07-23T17:16:48Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.