Papers › Predicting Dynamics on Networks Hardly Depends on the Topology
Predicting Dynamics on Networks Hardly Depends on the Topology
Bastian Prasse, Piet Van Mieghem
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Processes on networks consist of two interdependent parts: the network topology, consisting of the links between nodes, and the dynamics, specified by some governing equations. This work considers the prediction of the future dynamics on an unknown network, based on past observations of the dynamics. For a general class of governing equations, we propose a prediction algorithm which infers the network as an intermediate step. Inferring the network is impossible in practice, due to a dramatically ill-conditioned linear system. Surprisingly, a highly accurate prediction of the dynamics is possible nonetheless: Even though the inferred network has no topological similarity with the true network, both networks result in practically the same future dynamics.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections