Papers › Malleability of complex networks
Malleability of complex networks
Filipi N. Silva, Cesar H. Comin, Luciano da F. Costa
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.
Most complex networks are not static, but evolve along time. Given a specific configuration of one such changing network, it becomes a particularly interesting issue to quantify the diversity of possible unfoldings of its topology. In this work, we suggest the concept of malleability of a network, which is defined as the exponential of the entropy of the probabilities of each possible unfolding with respect to a given configuration. We calculate the malleability with respect to specific measurements of the involved topologies. More specifically, we identify the possible topologies derivable from a given configuration and calculate some topological measurement of them (e.g. clustering coefficient, shortest path length, assortativity, etc.), leading to respective probabilities being associated to each possible measurement value. Though this approach implies some level of degeneracy in the mapping from topology to measurement space, it still paves the way to inferring the malleability of specific network types with respect to given topological measurements. We report that the malleability, in general, depends on each specific measurement, with the average shortest path length and degree assortativity typically leading to large malleability values. The maximum malleability was observed for the Wikipedia network and the minimum for the Watts-Strogatz model.
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