Rong Yang
ABSTRACT
Assortativity has been widely studied for understanding the structure and function of complex networks. Assortative is defined as an association of items with other items having similar characteristics. The research has shown that assortativity has a significant impact on many processes on networks, including information cascades, spreading, congestion relief, longevity, and epidemic thresholds. The degree distribution is also an important factor that affects some of these results. In this paper, we introduce a simple but effective method for adjusting a given network while preserving the degree distribution of the network and, if desired, the connectivity of the network. The algorithm is tested on both theoretical and real-world networks and is supported by detailed empirical results. We illustrate how changing assortativity affects some network properties. The method can be useful for researchers interested in the relationship of assortativity to network structures and the dynamics of processes on networks.
- Jennifer Badham and Rob Stocker. The impact of network clustering and assortativity on epidemic behaviour. Theoretical population biology, 77(1):71--75, 2010.Google Scholar
- Albert-László Barabási and Réka Albert. Emergence of scaling in random networks. science, 286(5439):509--512, 1999.Google Scholar
- Marc Barthélemy, Alain Barrat, Romualdo Pastor-Satorras, and Alessandro Vespignani. Velocity and hierarchical spread of epidemic outbreaks in scale-free networks. Physical Review Letters, 92(17):178701, 2004.Google ScholarCross Ref
- Paolo Crucitti, Vito Latora, Massimo Marchiori, and Andrea Rapisarda. Efficiency of scale-free networks: error and attack tolerance. Physica A: Statistical Mechanics and its Applications, 320:622--642, 2003.Google ScholarCross Ref
- Gregorio D'Agostino, Antonio Scala, Vinko Zlatić, and Guido Caldarelli. Robustness and assortativity for diffusion-like processes in scale-free networks. EPL (Europhysics Letters), 97(6):68006, 2012.Google Scholar
- Zoltán Dezső and Albert-László Barabási. Halting viruses in scale-free networks. Physical Review E, 65(5):055103, 2002.Google ScholarCross Ref
- Holger Ebel, Lutz-Ingo Mielsch, and Stefan Bornholdt. Scale-free topology of e-mail networks. arXiv preprint cond-mat/0201476, 2002.Google Scholar
- Hawoong Jeong, Bálint Tombor, Réka Albert, Zoltan N Oltvai, and A-L Barabási. The large-scale organization of metabolic networks. Nature, 407(6804):651--654, 2000.Google ScholarCross Ref
- Robert M May and Alun L Lloyd. Infection dynamics on scale-free networks. Physical Review E, 64(6):066112, 2001.Google ScholarCross Ref
- Joel C Miller. Percolation and epidemics in random clustered networks. Physical Review E, 80(2):020901, 2009.Google ScholarCross Ref
- Yamir Moreno, Javier B Gómez, and Amalio F Pacheco. Epidemic incidence in correlated complex networks. Physical Review E, 68(3):035103, 2003.Google ScholarCross Ref
- Newman. http://www-personal.umich.edu/mejn/netdata/.Google Scholar
- Mark EJ Newman. Finding community structure in networks using the eigenvectors of matrices. Physical review E, 74(3):036104, 2006.Google Scholar
- M. E. J. Newman. Assortative mixing in networks. Physical Review Letters, 89(20):208701, 2002.Google ScholarCross Ref
- Pajek. http://pajek.imfm.si.Google Scholar
- Romualdo Pastor-Satorras and Alessandro Vespignani. Epidemic spreading in scale-free networks. Physical review letters, 86(14):3200, 2001.Google Scholar
- Romualdo Pastor-Satorras and Alessandro Vespignani. Epidemic dynamics in finite size scale-free networks. Physical Review E, 65(3):035108, 2002.Google ScholarCross Ref
- Joshua L Payne, Peter Sheridan Dodds, and Margaret J Eppstein. Information cascades on degree-correlated random networks. Physical Review E, 80(2):026125, 2009.Google ScholarCross Ref
- Sidney Redner. How popular is your paper? an empirical study of the citation distribution. The European Physical Journal B-Condensed Matter and Complex Systems, 4(2):131--134, 1998.Google ScholarCross Ref
- Francisco C Santos and Jorge M Pacheco. Scale-free networks provide a unifying framework for the emergence of cooperation. Physical Review Letters, 95(9):098104, 2005.Google ScholarCross Ref
- Brajendra K Singh and Neelima Gupte. Congestion and decongestion in a communication network. Physical Review E, 71(5):055103, 2005.Google ScholarCross Ref
- Zoltán Toroczkai and Kevin E Bassler. Network dynamics: Jamming is limited in scale-free systems. Nature, 428(6984):716--716, 2004.Google ScholarCross Ref
- Alexei Vazquez. Spreading dynamics on small-world networks with connectivity fluctuations and correlations. Physical Review E, 74(5):056101, 2006.Google ScholarCross Ref
- Xiao Fan Wang and Guanrong Chen. Synchronization in scale-free dynamical networks: robustness and fragility. Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on, 49(1):54--62, 2002.Google ScholarDigital Library
- Duncan J Watts and Steven H Strogatz. Collective dynamics of small-world networks. nature, 393(6684):440--442, 1998.Google Scholar
- YI Wolf, G Karev, and EV Koonin. Scale-free networks in biology: new insights into the fundamentals of evolution? BioEssays: news and reviews in molecular, cellular and developmental biology, 24(2):105, 2002.Google Scholar
- Liang Zhao, Kwangho Park, and Ying-Cheng Lai. Attack vulnerability of scale-free networks due to cascading breakdown. Physical review E, 70(3):035101, 2004.Google Scholar
Index Terms
- Adjusting assortativity in complex networks
Recommendations
Assortifying Networks
AbstractSince its introduction, the concept of assortativity has proved to be a fundamental metric for understanding the structure and function of complex networks. It has been shown to have a significant impact on many processes on networks, including ...
A new form of assortativity in online social networks
The term assortativity indicates the tendency, for a network node, to be directly connected to other nodes that are someway similar. In more technical terms, a given feature is assortative in a network if the probability that an arc exists between two ...
A simple and generic paradigm for creating complex networks using the strategy of vertex selecting-and-pairing
AbstractIn many networks, the link between any pair of vertices conforms to a specific probability, such as the link probability proposed in the Barabási–Albert scale-free model. Here, we demonstrate how distributions of link probabilities can ...
Highlights- A generic paradigm for creating complex networks using vertex selecting-and-pairing.
Comments