Thresholding normally distributed data creates complex networks
arXiv:1902.08278 · doi:10.1103/PhysRevE.101.062302
Abstract
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 non-vanishing clustering or community structure.
incorporated referees' suggestions; to be published in Phys. Rev. E
References in corpus (7)
- The structure of scientific collaboration networks
- Extracting the multiscale backbone of complex weighted networks
- Scale-Free Networks are Ultrasmall
- Measuring large-scale social networks with high resolution
- Information filtering in complex weighted networks
- The Strength of Friendship Ties in Proximity Sensor Data
- Unwinding the hairball graph: pruning algorithms for weighted complex networks
Cited by in corpus (8)
- Introduction to correlation networks: Interdisciplinary approaches beyond thresholding
- Measuring topological descriptors of complex networks under uncertainty
- Testing biological network motif significance with exponential random graph models
- Threshold-free estimation of entropy from a Pearson matrix
- Network reconstruction via the minimum description length principle
- An Agent-based Model to Evaluate Interventions on Online Dating Platforms to Decrease Racial Homogamy
- A perturbation-based approach to identifying potentially superfluous network constituents
- Exploring the space of graphs with fixed discrete curvatures