Sparse power-law network model for reliable statistical predictions based on sampled data
arXiv:1803.00976 · doi:10.3390/e20040257
Abstract
A projective network model is a model that enables predictions to be made based on a subsample of the network data, with the predictions remaining unchanged if a larger sample is taken into consideration. An exchangeable model is a model that does not depend on the order in which nodes are sampled. Despite a large variety of non-equilibrium (growing) and equilibrium (static) sparse complex network models that are widely used in network science, how to reconcile sparseness (constant average degree) with the desired statistical properties of projectivity and exchangeability is currently an outstanding scientific problem. Here we propose a network process with hidden variables which is projective and can generate sparse power-law networks. Despite the model not being exchangeable, it can be closely related to exchangeable uncorrelated networks as indicated by its information theory characterization and its network entropy. The use of the proposed network process as a null model is here tested on real data, indicating that the model offers a promising avenue for statistical network modelling.
arXiv comment(26 pages 2 figures)
References in corpus (29)
- Emergence of scaling in random networks
- The diameter of the world wide web
- Structure of Growing Networks: Exact Solution of the Barabasi--Albert's Model
- Connectivity of Growing Random Networks
- The statistical mechanics of networks
- Entropy measures for complex networks: Toward an information theory of complex topologies
- Graph limits and exchangeable random graphs
- The entropy of network ensembles
- Triadic closure as a basic generating mechanism of communities in complex networks
- The entropy of randomized network ensembles
- Assessing the relevance of node features for network structure
- Mean field solution of the Ising model on a Barabasi-Albert network
- Maximum likelihood: extracting unbiased information from complex networks
- Sparse graphs using exchangeable random measures
- Emergent Hyperbolic Network Geometry
- Network geometry with flavor: from complexity to quantum geometry
- Entropy of stochastic blockmodel ensembles
- Consistency under sampling of exponential random graph models
- Emergent Complex Network Geometry
- Breaking of ensemble equivalence in networks
- Gibbs entropy of networks ensembles by cavity methods
- Edge-exchangeable graphs and sparsity
- Sparse Maximum-Entropy Random Graphs with a Given Power-Law Degree Distribution
- Statistical Mechanics of Multi-Edge Networks
- On edge exchangeable random graphs
- Duality between equilibrium and growing networks
- Entropy rate of non-equilibrium growing networks
- Emergent Network Modularity
- Projective, Sparse, and Learnable Latent Position Network Models