一种基于似然性的时变网络模型混合判别方法
Likelihood-based approach to discriminate mixtures of network models that vary in time
摘要:
区分相互竞争的解释模型,以确定哪一个更有可能对网络的增长负责,这是网络科学的一个根本问题。支配这种增长的规则被归因于诸如偏好连接和三角闭合等机制,并有大量基于这些机制的解释模型。这些模型故意简单,通常网络在其生命周期内根据恒定的机制增长,以允许分析结果。我们在人工数据上使用基于似然的框架,其中网络模型在已知的时间点发生变化,并证明我们可以从网络分析中恢复变化点。然后,我们使用真实的数据集,并演示我们的框架如何显示网络增长机制随着时间的推移而变化的重要性。
英文摘要:
Discriminating between competing explanatory models as to which is more likely responsible for the growth of a network is a problem of fundamental importance for network science. The rules governing this growth are attributed to mechanisms such as preferential attachment and triangle closure, with a wealth of explanatory models based on these. These models are deliberately simple, commonly with the network growing according to a constant mechanism for its lifetime, to allow for analytical results. We use a likelihood-based framework on artificial data where the network model changes at a known point in time and demonstrate that we can recover the change point from analysis of the network. We then use real datasets and demonstrate how our framework can show the changing importance of network growth mechanisms over time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。