Growing Scale-free Small-world Networks with Tunable Assortative Coefficient

Abstract

In this paper, we propose a simple rule that generates scale-free small-world networks with tunable assortative coefficient. These networks are constructed by two-stage adding process for each new node. The model can reproduce scale-free degree distributions and small-world effect. The simulation results are consistent with the theoretical predictions approximately. Interestingly, we obtain the nontrivial clustering coefficient $C$ and tunable degree assortativity $r$ by adjusting the parameter: the preferential exponent $\beta$. The model can unify the characterization of both assortative and disassortative networks.

13 pages, and 5 figures

References in corpus (35)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• The structure and function of complex networks
• Assortative mixing in networks
• The architecture of complex weighted networks
• Evolution of networks
• Mixing patterns in networks
• Hierarchical Organization in Complex Networks
• Cascade-based attacks on complex networks
• Growing Scale-Free Networks with Tunable Clustering
• Growing networks with local rules: preferential attachment, clustering hierarchy and degree correlations
• Pseudofractal Scale-free Web
• Statistical Analysis of Airport Network of China
• Generic scale of the "scale-free" growing networks
• Maximal planar networks with large clustering coefficient and power-law degree distribution
• Sandpile on Scale-Free Networks
• General Dynamics of Topology and Traffic on Weighted Technological Networks
• Construction and properties of assortative random networks
• Entropy Optimization of Scale-Free Networks Robustness to Random Failures
• Assortative model for social networks
• Structural transitions in scale-free networks
• Recursive graphs with small-world scale-free properties
• Enhance synchronizability by structural perturbations
• Deterministic Small-World Networks
• A Mutual Selection Model for Weighted Networks
• Perturbation: the Catastrophe Causer in Scale-Free Networks
• Optimization of robustness of scale-free network to random and targeted attacks
• Scaling in directed dynamical small-world networks with random responses
• Temporal Series Analysis Approach to Spectra of Complex Networks
• Optimization of network structure to random failures
• Self-organized Boolean game on networks
• Scaling Invariance in Spectra of Complex Networks: A Diffusion Factorial Moment Approach
• Optimization of scale-free network for random failures
• Multistage Random Growing Small-World Networks with Power-law degree Distribution
• Tuning degree distributions of scale-free networks

Cited by in corpus (6)

• Tuning the average path length of complex networks and its influence to the emergent dynamics of the majority-rule model
• Tuning degree distributions of scale-free networks
• On the effect of the path length and transitivity of small-world networks on epidemic dynamics
• Designing Networks: A Mixed-Integer Linear Optimization Approach
• New methods to generate massive synthetic networks
• Generalized individual-based epidemic model for vulnerability assessment of correlated scale-free complex networks