arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1210.7375physics.soc-phcs.SI
收藏

易处理的一致随机图模型

Tractable and Consistent Random Graph Models

Arun G. Chandrasekhar, Matthew O. Jackson

摘要:

我们定义了一个一般类的网络形成模型,统计指数随机图模型(SERGMs),嵌套标准指数随机图模型(ERGMs)作为一种特殊情况。我们提供了第一个一般性结果,当这些模型(包括ERGM)的参数估计从一个单一的网络的观察是一致的(即,随着节点数量的增长而变得准确)。接下来,解决的问题,估计ERGMs的标准技术已被证明有指数缓慢的混合时间为许多规格,我们表明,通过重新制定网络的形成作为一个分布在空间上的足够的统计数据,而不是空间的网络,估计空间的大小可以大大减少,使估计实用和容易。我们还开发了一个相关的,但不同的,一类模型,我们称之为子图生成模型(SUGMs),是有用的建模稀疏网络,其参数估计也是直接和容易估计,一致的,渐近正态分布。最后,我们展示了如何将基于选择的(战略)网络形成模型写成SERGM和SUGM,并将我们的模型和技术应用于印度乡村的网络数据。

英文摘要:

We define a general class of network formation models, Statistical Exponential Random Graph Models (SERGMs), that nest standard exponential random graph models (ERGMs) as a special case. We provide the first general results on when these models' (including ERGMs) parameters estimated from the observation of a single network are consistent (i.e., become accurate as the number of nodes grows). Next, addressing the problem that standard techniques of estimating ERGMs have been shown to have exponentially slow mixing times for many specifications, we show that by reformulating network formation as a distribution over the space of sufficient statistics instead of the space of networks, the size of the space of estimation can be greatly reduced, making estimation practical and easy. We also develop a related, but distinct, class of models that we call subgraph generation models (SUGMs) that are useful for modeling sparse networks and whose parameter estimates are also directly and easily estimable, consistent, and asymptotically normally distributed. Finally, we show how choice-based (strategic) network formation models can be written as SERGMs and SUGMs, and apply our models and techniques to network data from rural Indian villages.

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

↑