Edge direction and the structure of networks
Open accessThe DOI matches its Crossref record; 46 of the 46 references it cites were found in a registry or an index.
Abstract
Directed networks are ubiquitous and are necessary to represent complex systems with asymmetric interactions—from food webs to the World Wide Web. Despite the importance of edge direction for detecting local and community structure, it has been disregarded in studying a basic type of global diversity in networks: the tendency of nodes with similar numbers of edges to connect. This tendency, called assortativity, affects crucial structural and dynamic properties of real-world networks, such as error tolerance or epidemic spreading. Here we demonstrate that edge direction has profound effects on assortativity. We define a set of four directed assortativity measures and assign statistical significance by comparison to randomized networks. We apply these measures to three network classes—online/social networks, food webs, and word-adjacency networks. Our measures ( i ) reveal patterns common to each class, ( ii ) separate networks that have been previously classified together, and ( iii ) expose limitations of several existing theoretical models. We reject the standard classification of directed networks as purely assortative or disassortative. Many display a class-specific mixture, likely reflecting functional or historical constraints, contingencies, and forces guiding the system’s evolution.
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
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060 · cited 2×
“Note that after reconstructing the adjacency matrix by hand from references [5, 6, 7, 8, 9], we performed a trophic aggregation on all food webs, meaning that if two species had identical interactions, we combined them into one node.”
BackgroundMethodEmergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135 · cited 1×
“arXiv:0908.4288v1 [physics.soc-ph] 29 Aug 2009 be represented as networks [1]. In a network, nodes represent components of the system and edges between nodes represent interactions between components [2, 3, 4]. Networks from diverse fields share global, whole-network properties, including a broad distribution of degree…”
BackgroundThe Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 8,959
Network biology: understanding the cell's functional organization
Barabási, A.-L., & Oltvai, Z. N. (2004) · Nature Reviews Genetics · doi:10.1038/nrg1272 · Cited by 7,903 · cited 3×
“Assortativity is a standard tool in analyzing network structure (4) and has a simple interpretation.”
BackgroundMethodError and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
Network motifs: simple building blocks of complex networks.
Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., & Alon, U. (2002) · Science · doi:10.1126/science.298.5594.824 · Cited by 7,368 · cited 6×
“Thus, when we begin our sampling of the FDS ensemble, we perform ten times the inter-sample number of rewiring steps on the original network to ensure that we are truly sampling typical FDS ensemble networks.”
BackgroundMethodInfluentialError and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (2000) · RePEc: Research Papers in Economics · Cited by 6,469
Assortative Mixing in Networks
Newman, M. E. J. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.208701 · Cited by 4,988
Diameter of the World-Wide Web
Albert, R., Jeong, H., & Barabási, A.-L. (1999) · Nature · doi:10.1038/43601 · Cited by 4,260
Cited by
Clustering and community detection in directed networks: A survey
Malliaros, F. D., & Vazirgiannis, M. (2013) · Physics Reports · doi:10.1016/j.physrep.2013.08.002 · Cited by 591
Consistency and differences between centrality measures across distinct classes of networks
Oldham, S., Fulcher, B., Parkes, L., Arnatkevic̆iūtė, A., Suo, C., & Fornito, A. (2019) · PLOS ONE · doi:10.1371/journal.pone.0220061 · Cited by 296
Water for food: The global virtual water trade network
Konar, M., Dalin, C., Suweis, S., Hanasaki, N., Rinaldo, A., & Rodriguez‐Iturbe, I. (2011) · Water Resources Research · doi:10.1029/2010wr010307 · Cited by 285
Assortativity in complex networks
Noldus, R., & Van Mieghem, P. (2015) · Journal of Complex Networks · doi:10.1093/comnet/cnv005 · Cited by 266
Seed exchange networks for agrobiodiversity conservation. A review
Pautasso, M., Aistara, G., Barnaud, A., Caillon, S., Clouvel, P., Coomes, O. T., Delêtre, M., Demeulenaere, E., De Santis, P., Döring, T., et al. (2013) · Agronomy for Sustainable Development · doi:10.1007/s13593-012-0089-6 · Cited by 259
What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
Dunning, I., Gupta, S., & Silberholz, J. (2018) · INFORMS Journal on Computing · doi:10.1287/ijoc.2017.0798 · Cited by 128
“(2)Degree assortativity is the correlation between the degrees of nodes that are linked in the graph (Foster et al. 2010).”
Background
Metadata
- Authors
- Foster, J. G., Foster, D. V., Grassberger, P., & Paczuski, M.
- Venue
- Proceedings of the National Academy of Sciences
- Published
- 2010-05-26
- Volume
- 107
- Issue
- 24
- Pages
- 10815-10820
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- OpenAlex
- W2064796447
- Cited by
- 256
- References
- 46
- FWCI
- 8.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.