Reshuffling scale-free networks: From random to assortative
Open accessThe DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
To analyze the role of assortativity in networks we introduce an algorithm which produces assortative mixing to a desired degree. This degree is governed by one parameter p . Changing this parameter one can construct networks ranging from fully random (p=0) to totally assortative (p=1) . We apply the algorithm to a Barabási-Albert scale-free network and show that the degree of assortativity is an important parameter governing the geometrical and transport properties of networks. Thus, the average path length of the network increases dramatically with the degree of assortativity. Moreover, the concentration dependences of the size of the giant component in the node percolation problem for uncorrelated and assortative networks are strongly different. The behavior of the clustering coefficient is also discussed.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Specificity and Stability in Topology of Protein Networks
Maslov, S., & Sneppen, K. (2002) · Science · doi:10.1126/science.1065103 · Cited by 3,051
Cited by
Complex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
The Kuramoto model in complex networks
Rodrigues, F. A., Peron, T. K. D., Ji, P., & Kurths, J. (2016) · Physics Reports · doi:10.1016/j.physrep.2015.10.008 · Cited by 1,040
Epidemic Dynamics on an Adaptive Network
Gross, T., D’Lima, C. J. D., & Blasius, B. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.208701 · Cited by 895
Evolutionary games on multilayer networks: a colloquium
Wang, Z., Wang, L., Szolnoki, A., & Perc, M. (2015) · The European Physical Journal B · doi:10.1140/epjb/e2015-60270-7 · Cited by 754
Attack Robustness and Centrality of Complex Networks
Iyer, S., Killingback, T., Sundaram, B., & Wang, Z. (2013) · PLoS ONE · doi:10.1371/journal.pone.0059613 · Cited by 472
Complex Networks: Principles, Methods and Applications
Latora, V., Nicosia, V., & Russo, G. (2017) · Cambridge University Press eBooks · doi:10.1017/9781316216002 · Cited by 372
Explosive transitions in complex networks’ structure and dynamics: Percolation and synchronization
Boccaletti, S., Almendral, J. A., Guan, S., Leyva, I., Liu, Z., Sendiña-Nadal, I., Wang, Z., & Zou, Y. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.10.004 · Cited by 363
Roles of mixing patterns in cooperation on a scale-free networked game
Rong, Z., Li, X., & Wang, X. (2007) · Physical Review E · doi:10.1103/physreve.76.027101 · Cited by 338
Spectrum of controlling and observing complex networks
Yan, G., Tsekenis, G., Barzel, B., Slotine, J.-J., Liu, Y.-Y., & Barabási, A.-L. (2015) · Nature Physics · doi:10.1038/nphys3422 · Cited by 279
Degree mixing in multilayer networks impedes the evolution of cooperation
Wang, Z., Wang, L., & Perc, M. (2014) · Physical Review E · doi:10.1103/physreve.89.052813 · Cited by 254
Topological Structure of Urban Street Networks from the Perspective of Degree Correlations
Jiang, B., Duan, Y., Lu, F., Yang, T., & Zhao, J. (2014) · Environment and Planning B: Planning and Design · doi:10.1068/b39110 · Cited by 38
Metadata
- Authors
- Xulvi-Brunet, R., & Sokolov, I. M.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2004-12-02
- Volume
- 70
- Issue
- 6
- Pages
- 066102-066102
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W2072549232
- Cited by
- 243
- References
- 1
- FWCI
- 4.09
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.