Learning the mechanisms of network growth
arXiv:2404.00793 · doi:10.1038/s41598-024-61940-4 10.1038/s41598-024-61940-4
Abstract
We propose a novel model-selection method for dynamic networks. Our approach involves training a classifier on a large body of synthetic network data. The data is generated by simulating nine state-of-the-art random graph models for dynamic networks, with parameter range chosen to ensure exponential growth of the network size in time. We design a conceptually novel type of dynamic features that count new links received by a group of vertices in a particular time interval. The proposed features are easy to compute, analytically tractable, and interpretable. Our approach achieves a near-perfect classification of synthetic networks, exceeding the state-of-the-art by a large margin. Applying our classification method to real-world citation networks gives credibility to the claims in the literature that models with preferential attachment, fitness and aging fit real-world citation networks best, although sometimes, the predicted model does not involve vertex fitness.
Main text: 13 pages, 4 figures. Supplementary: 12 pages; Textual changes
References in corpus (17)
- Emergence of scaling in random networks
- Error and attack tolerance of complex networks
- Epidemic spreading in scale-free networks
- Hyperbolic Geometry of Complex Networks
- Scale-free networks are rare
- Quantifying Long-Term Scientific Impact
- Bose-Einstein condensation in complex networks
- Contact processes on random graphs with power law degree distributions have critical value 0
- Scale-free Networks Well Done
- Systematic Topology Analysis and Generation Using Degree Correlations
- A likelihood-based framework for the analysis of discussion threads
- The nature and nurture of network evolution
- Characterizing the structural diversity of complex networks across domains
- The dynamics of power laws: Fitness and aging in preferential attachment trees
- When is a scale-free graph ultra-small?
- Network Signatures from Image Representation of Adjacency Matrices: Deep/Transfer Learning for Subgraph Classification
- Statistical Inference in Parametric Preferential Attachment Trees