Malleability of complex networks
arXiv:1810.09602 · doi:10.1088/1742-5468/ab2ad1
Abstract
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.
arXiv comment8 pages, 6 figures
References in corpus (22)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- Network robustness and fragility: Percolation on random graphs
- Spatial Networks
- Characterization of complex networks: A survey of measurements
- Cascade-based attacks on complex networks
- Dynamic reconfiguration of human brain networks during learning
- A model for cascading failures in complex networks
- Analyzing and Modeling Real-World Phenomena with Complex Networks: A Survey of Applications
- Random Geometric Graphs
- Entropy measures for complex networks: Toward an information theory of complex topologies
- Graph Evolution: Densification and Shrinking Diameters
- Optimal routing on complex networks
- Transport optimization on complex networks
- Smart Rewiring for Network Robustness
- Knowledge Acquisition: A Complex Networks Approach
- How Many Nodes are Effectively Accessed in Complex Networks?
- Long-Range Connections in Transportation Networks
- Topological characterization of world cities
- Complex Grid Computing
- A framework for evaluating complex networks measurements
- A diffusion-based approach to obtaining the borders of urban areas