Statistical validation of high-dimensional models of growing networks
arXiv:1311.2008 · doi:10.1103/PhysRevE.89.032801
Abstract
The abundance of models of complex networks and the current insufficient validation standards make it difficult to judge which models are strongly supported by data and which are not. We focus here on likelihood maximization methods for models of growing networks with many parameters and compare their performance on artificial and real datasets. While high dimensionality of the parameter space harms the performance of direct likelihood maximization on artificial data, this can be improved by introducing a suitable penalization term. Likelihood maximization on real data shows that the presented approach is able to discriminate among available network models. To make large-scale datasets accessible to this kind of analysis, we propose a subset sampling technique and show that it yields substantial model evidence in a fraction of time necessary for the analysis of the complete data.
8 pages, 5 figures, 2 tables
References in corpus (4)
Cited by in corpus (15)
- Nestedness in complex networks: Observation, emergence, and implications
- Ranking in evolving complex networks
- The Memory of Science: Inflation, Myopia, and the Knowledge Network
- Ranking nodes in growing networks: When PageRank fails
- Growing complex network of citations of scientific papers -- measurements and modeling
- Phase transition in the recoverability of network history
- Preferential attachment mechanism of complex network growth: "rich-gets-richer" or "fit-gets-richer"?
- Model-based evaluation of scientific impact indicators
- The essential role of time in network-based recommendation
- Identification and modeling of discoverers in online social systems
- Time-invariant degree growth in preferential attachment network models
- A multi-layer network approach to modelling authorship influence on citation dynamics in physics journals
- Decay of Relevance in Exponentially Growing Networks
- Optimal timescale for community detection in growing networks
- Enhancing speed of pinning synchronizability: low-degree nodes with high feedback gains