arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1804.04583stat.MEcs.SI
收藏

一种新的图的生成统计模型--潜序Logistic(LOLOG)模型

A New Generative Statistical Model for Graphs: The Latent Order Logistic (LOLOG) Model

Ian E. Fellows

摘要:

全概率模型对于复杂网络的统计建模至关重要,但目前还没有通用的、灵活的、广泛适用的生成方法。我们提出了一个新的家庭的概率模型的动机网络增长的想法,我们称之为潜在订单逻辑(LOOTH)模型。LOT是一个完全通用的框架,能够描述图形配置上的任何概率分布,尽管不是所有的分布都容易表达或估计为LOT。我们开发的推理程序的基础上的蒙特卡罗矩量法,广义矩量法和变分推断。为了展示模型框架的灵活性,我们展示了如何通过优先连接将所谓的无标度网络建模为LOLOG。的LONDO在避免退化,易于采样,模型的灵活性方面的优势进行了说明。与流行的指数族随机图模型(ERGM)的连接也进行了探讨,我们发现,他们是相同的情况下,并矢独立。最后,我们将该模型应用于一个公司律师事务所内的合作社会网络,青少年学生之间的友谊网络,以及在线社会网络中的友谊关系。

英文摘要:

Full probability models are critical for the statistical modeling of complex networks, and yet there are few general, flexible and widely applicable generative methods. We propose a new family of probability models motivated by the idea of network growth, which we call the Latent Order Logistic (LOLOG) model. LOLOG is a fully general framework capable of describing any probability distribution over graph configurations, though not all distributions are easily expressible or estimable as a LOLOG. We develop inferential procedures based on Monte Carlo Method of Moments, Generalized Method of Moments and variational inference. To show the flexibility of the model framework, we show how so-called scale-free networks can be modeled as LOLOGs via preferential attachment. The advantages of LOLOG in terms of avoidance of degeneracy, ease of sampling, and model flexibility are illustrated. Connections with the popular Exponential-family Random Graph model (ERGM) are also explored, and we find that they are identical in the case of dyadic independence. Finally, we apply the model to a social network of collaboration within a corporate law firm, a friendship network among adolescent students, and the friendship relations in an online social network.

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

↑