Network data sets are often constructed by some kind of thresholding procedure. The resulting networks frequently possess properties such as heavy-tailed degree distributions, clustering, large connected components, and short average shortest path lengths. These properties are considered typical of complex networks and appear in many contexts, prompting consideration of their universality. Here we introduce a simple model for correlated relational data and study the network ensemble obtained by thresholding it. We find that some, but not all, of the properties associated with complex networks can be seen after thresholding the correlated data, even though the underlying data are not "complex." In particular, we observe heavy-tailed degree distributions, a large numbers of triangles, and short path lengths, while we do not observe nonvanishing clustering or community structure.
Thresholding normally distributed data creates complex networks
George T. Cantwell,B. Maier,Alice C. Schwarze,Carlos A. Serván,Jordan Snyder,G. St‐Onge
Published 2019 in Physical Review E
ABSTRACT
PUBLICATION RECORD
- Publication year
2019
- Venue
Physical Review E
- Publication date
2019-02-21
- Fields of study
Mathematics, Physics, Computer Science, Medicine
- Identifiers
- External record
- Source metadata
Semantic Scholar, PubMed
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-31 of 31 references · Page 1 of 1
CITED BY
Showing 1-30 of 30 citing papers · Page 1 of 1