arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 1904.03348stat.MLcs.LGcs.SImath.PR
收藏

动态网络模型的通用测试

Toward Universal Testing of Dynamic Network Models

University at Albany, SUNY(纽约州立大学奥尔巴尼分校);Purdue University(普渡大学)

Abram Magner, Wojciech Szpankowski

摘要:

现实世界中的许多网络会随着时间的推移而变化,从某种意义上说,节点和边缘进入和离开网络。人们提出了各种动态随机图模型来解释这些系统的宏观性质,并为统计推断和预测提供基础。有一种严格的方法来确定这些模型与观察到的网络的匹配程度是令人感兴趣的。因此,我们提出了以下拟合优度问题:给定一个增长随机图的一系列观察/快照,以及一个候选模型M,我们能否确定这些快照是来自M,还是来自某个在某种自然度量中与M分离的任意替代模型?我们制定了这个问题,并将其归结为良好的适合测试图值,无限状态马尔可夫过程和展示和分析一个通用的测试的基础上,非平稳采样的自然类模型。

英文摘要:

Numerous networks in the real world change over time, in the sense that nodes and edges enter and leave the networks. Various dynamic random graph models have been proposed to explain the macroscopic properties of these systems and to provide a foundation for statistical inferences and predictions. It is of interest to have a rigorous way to determine how well these models match observed networks. We thus ask the following goodness of fit question: given a sequence of observations/snapshots of a growing random graph, along with a candidate model M, can we determine whether the snapshots came from M or from some arbitrary alternative model that is well-separated from M in some natural metric? We formulate this problem precisely and boil it down to goodness of fit testing for graph-valued, infinite-state Markov processes and exhibit and analyze a universal test based on non-stationary sampling for a natural class of models.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑