Mechanisms for tuning clustering and degree-correlations in directed networks
arXiv:1705.01689 · doi:10.1093/comnet/cnx057
Abstract
With complex networks emerging as an effective tool to tackle multidisciplinary problems, models of network generation have gained an importance of their own. These models allow us to extensively analyze the data obtained from real-world networks, study their relevance and corroborate theoretical results. In this work, we introduce methods, based on degree preserving rewiring, that can be used to tune the clustering and degree-correlations in directed networks with random and scale-free topologies. They provide null-models to investigate the role of the mentioned properties along with their strengths and limitations. We find that in the case of clustering, structural relationships, that are independent of topology and rewiring schemes are revealed, while in the case of degree-correlations, the network topology is found to play an important role in the working of the mechanisms. We also study the effects of link-density on the efficiency of these rewiring mechanisms and find that in the case of clustering, the topology of the network plays an important role in determining how link-density affects the rewiring process, while in the case of degree-correlations, the link-density and topology, play no role for sufficiently large number of rewiring steps. Besides the intended purpose of tuning network properties, the proposed mechanisms can also be used as a tool to reveal structural relationships and topological constraints.
arXiv comment8 pages, 11 figures, submitted to Physical Review E
References in corpus (25)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Assortative mixing in networks
- Mixing patterns in networks
- Specificity and stability in topology of protein networks
- Mean-field theory for scale-free random networks
- Structure of Growing Networks: Exact Solution of the Barabasi--Albert's Model
- Connectivity of Growing Random Networks
- Organization of Growing Random Networks
- Clustering in Complex Directed Networks
- Growing networks with local rules: preferential attachment, clustering hierarchy and degree correlations
- Random graphs with clustering
- Properties of highly clustered networks
- Highly clustered scale-free networks
- Edge direction and the structure of networks
- Construction and properties of assortative random networks
- Solution for the properties of a clustered network
- Uncovering disassortativity in large scale-free networks
- Degree-degree correlations in random graphs with heavy-tailed degrees
- Structural constraints in complex networks
- Zero Pearson Coefficient for Strongly Correlated Growing Trees
- Constructing and sampling directed graphs with given degree sequences
- Degree correlations in directed scale-free networks
- Lower bound of assortativity coefficient in scale-free networks