Tempological Control of Network Dynamics
Bibliographic record
Abstract
Feedback control is an effective strategy for stabilizing a desired state and has been widely adopted in maintaining the stability of systems such as flying birds and power grids. By default, this framework requires continuous control input to offset deviations from the desired state, which can be invasive and cost a considerable amount of energy. Here, we introduce tempological (temporal + topological) control -- a novel, noninvasive strategy that harnesses the inherent flexibility of time-varying networks to control the dynamics of a general nonlinear system. By strategically switching network topology on-the-fly based on the current states of the nodes, we show how it is possible to drive a system to a desired state or even stabilize otherwise unstable states, all in the absence of external forcing. We demonstrate the utility of our approach using networks of Kuramoto and Stuart-Landau oscillators, achieving synchronization out of sets of unsynchronizable networks. Finally, we develop a statistical theory that explains why tempological control will almost always succeed in the limit of large and diverse temporal networks, with diversity of network configurations overcoming the deficiencies of any snapshot in isolation.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".