Evaluating Network Models: A Likelihood Analysis
arXiv:1112.4597 · doi:10.1209/0295-5075/98/28004
Abstract
Many models are put forward to mimic the evolution of real networked systems. A well-accepted way to judge the validity is to compare the modeling results with real networks subject to several structural features. Even for a specific real network, we cannot fairly evaluate the goodness of different models since there are too many structural features while there is no criterion to select and assign weights on them. Motivated by the studies on link prediction algorithms, we propose a unified method to evaluate the network models via the comparison of the likelihoods of the currently observed network driven by different models, with an assumption that the higher the likelihood is, the better the model is. We test our method on the real Internet at the Autonomous System (AS) level, and the results suggest that the Generalized Linear Preferential (GLP) model outperforms the Tel Aviv Network Generator (Tang), while both two models are better than the Barabási-Albert (BA) and Erdös-Rényi (ER) models. Our method can be further applied in determining the optimal values of parameters that correspond to the maximal likelihood. Experiment indicates that the parameters obtained by our method can better capture the characters of newly-added nodes and links in the AS-level Internet than the original methods in the literature.
arXiv comment6 pages, 2 figures, 3 tables
References in corpus (1)
Cited by in corpus (16)
- Link Prediction in Complex Networks: A Mutual Information Perspective
- Progresses and Challenges in Link Prediction
- Link Prediction with Node Clustering Coefficient
- Predicting missing links and their weights via reliable-route-based method
- Link Prediction via Matrix Completion
- Link prediction via linear optimization
- Experimental analyses on 2-hop-based and 3-hop-based link prediction algorithms
- Uncovering missing links with cold ends
- Discriminating abilities of threshold-free evaluation metrics in link prediction
- Improving local clustering based top-L link prediction methods via asymmetrical link clustering information
- Collaborative Filtering Approach to Link Prediction
- Large Communities in a scale-free network
- Information Evolution in Complex Networks
- Estimating Formation Mechanisms and Degree Distributions in Mixed Attachment Networks
- Link Prediction via controlling the leading eigenvector
- Measuring multiple evolution mechanisms of complex networks