arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1612.03054stat.MEcs.DMcs.SIstat.CO
收藏

DERGMs:退化限制指数随机图模型

DERGMs: Degeneracy-restricted exponential random graph models

Vishesh Karwa, Sonja Petrović, Denis Bajić

摘要:

指数随机图模型,或ERGM,是一种灵活和通用的模型建模相关的数据。虽然早期的文献已经表明它们在捕获许多感兴趣的网络特征方面是强大的,但最近的工作突出了与模型的不良行为相关的困难,例如大多数概率质量集中在参数空间的一个非常小的子集上。这种行为限制了ERGM作为真实数据模型的适用性以及通过通常的马尔可夫链蒙特卡罗算法进行推断和参数估计。为了解决这个问题,我们提出了一个新的指数族的随机图模型,建立在标准的ERGM框架。具体来说,我们解决了计算的棘手性和“退化”模型的行为的问题,通过一个可解释的支持限制。我们引入了一个新的参数的基础上的图论概念的退化,稀疏性的测量,其值通常在现实世界中的网络低。新的模型族被支撑在具有有界退化的图的样本空间上,称为退化限制的ERGM,简称DERGMs。由于DERGMs推广ERGMs -后者是通过将简并参数设置为最大值从前者获得的-它们继承了良好的理论性质,同时将它们的质量更均匀地放置在现实图形上。支持限制允许使用新的(和快速的)蒙特卡罗方法进行推理,从而使模型的可扩展性和计算易处理。我们研究了DERGMs的各种理论性质,并说明了支持限制如何改善模型的行为。我们还提出了一个快速的Monte Carlo算法的参数估计,避免了许多问题所面临的马尔可夫链蒙特卡罗算法用于ERGMs的推理。

英文摘要:

Exponential random graph models, or ERGMs, are a flexible and general class of models for modeling dependent data. While the early literature has shown them to be powerful in capturing many network features of interest, recent work highlights difficulties related to the models' ill behavior, such as most of the probability mass being concentrated on a very small subset of the parameter space. This behavior limits both the applicability of an ERGM as a model for real data and inference and parameter estimation via the usual Markov chain Monte Carlo algorithms. To address this problem, we propose a new exponential family of models for random graphs that build on the standard ERGM framework. Specifically, we solve the problem of computational intractability and `degenerate' model behavior by an interpretable support restriction. We introduce a new parameter based on the graph-theoretic notion of degeneracy, a measure of sparsity whose value is commonly low in real-worlds networks. The new model family is supported on the sample space of graphs with bounded degeneracy and is called degeneracy-restricted ERGMs, or DERGMs for short. Since DERGMs generalize ERGMs -- the latter is obtained from the former by setting the degeneracy parameter to be maximal -- they inherit good theoretical properties, while at the same time place their mass more uniformly over realistic graphs. The support restriction allows the use of new (and fast) Monte Carlo methods for inference, thus making the models scalable and computationally tractable. We study various theoretical properties of DERGMs and illustrate how the support restriction improves the model behavior. We also present a fast Monte Carlo algorithm for parameter estimation that avoids many issues faced by Markov Chain Monte Carlo algorithms used for inference in ERGMs.

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

↑