How strong is strong? The challenge of interpreting network edge weights
Weighted networks are information-rich and highly-flexible, but they can be difficult to analyze because the interpretation of edges weights is often ambiguous. Specifically, the meaning of a given edge's weight is locally contingent, so that a given weight may be strong for one dyad, but weak for other dyad, even in the same network. I use backbone models to distinguish strong and weak edges in a corpus of 110 weighted networks, and used the results to examine the magnitude of this ambiguity. Although strong edges have larger weights than weak edges on average, a large fraction of edges' weights provide ambiguous information about whether it is strong or weak. Based on these results, I recommend that strong edges should be identified by applying an appropriate backbone model, and that once strong edges have been identified using a backbone model, their original weights should not be directly interpreted or used in subsequent analysis.
Authors
- Zachary P. Neal (ORCID: https://orcid.org/0000-0003-3076-4995)
Institutions
- Michigan State University (US)
Publication Details
- Journal
- PLoS ONE
- Published
- 2024-10-03
- DOI
- https://doi.org/10.1371/journal.pone.0311614
- Citations
- 4
- Primary Topic
- Complex Network Analysis Techniques
- Type
- article
- Field-Weighted Citation Impact
- 1.12
Funders
- National Science Foundation