Shadow networks: Discovering hidden nodes with models of information flow
arXiv:1312.6122
Abstract
Complex, dynamic networks underlie many systems, and understanding these networks is the concern of a great span of important scientific and engineering problems. Quantitative description is crucial for this understanding yet, due to a range of measurement problems, many real network datasets are incomplete. Here we explore how accidentally missing or deliberately hidden nodes may be detected in networks by the effect of their absence on predictions of the speed with which information flows through the network. We use Symbolic Regression (SR) to learn models relating information flow to network topology. These models show localized, systematic, and non-random discrepancies when applied to test networks with intentionally masked nodes, demonstrating the ability to detect the presence of missing nodes and where in the network those nodes are likely to reside.
arXiv comment12 pages, 3 figures
References in corpus (10)
- Emergence of scaling in random networks
- The structure and function of complex networks
- Mixing patterns in networks
- Hierarchical structure and the prediction of missing links in networks
- Homophily and Contagion Are Generically Confounded in Observational Social Network Studies
- Temporal patterns of happiness and information in a global social network: Hedonometrics and Twitter
- The Geography of Happiness: Connecting Twitter sentiment and expression, demographics, and objective characteristics of place
- Collective response of human populations to large-scale emergencies
- An Evolutionary Algorithm Approach to Link Prediction in Dynamic Social Networks
- Node discovery problem for a social network