评价网络模型:似然分析
Evaluating Network Models: A Likelihood Analysis
摘要:
许多模型被提出来模拟真实网络系统的演化。一个公认的方法来判断的有效性是比较的建模结果与实际网络的几个结构特征。即使对于一个特定的真实网络,我们也不能公平地评估不同模型的优劣,因为有太多的结构特征,而没有标准来选择和分配权重。受链路预测算法研究的启发,本文提出了一种统一的方法,通过比较不同模型驱动下当前观测网络的似然度来评价网络模型,并假设似然度越高,模型越好。我们在自治系统(AS)级别的真实互联网上测试了我们的方法,结果表明,广义线性偏好(GLP)模型优于特拉维夫网络生成器(Tang),而这两个模型都优于Barabási-Albert(BA)和Erdös-Rényi(ER)模型。我们的方法可以进一步应用于确定对应于最大似然的参数的最佳值。实验结果表明,该方法得到的参数能更好地捕捉AS级互联网中新增节点和链路的特征。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。