arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2203.13304stat.ME
收藏

随机块光滑图子模型

Stochastic Block Smooth Graphon Model

Benjamin Sischka, Göran Kauermann

摘要:

本文提出了随机块模型与光滑图子模型的结合。第一个允许将网络中的个体集合划分为块,这些块表示可能等价连接随机网络的节点组,因此通常也称为社区。平滑图子模型则假设网络的节点可以在一维尺度上排列,使得紧密度意味着类似的连通性行为。这两个模型都属于节点特定的隐变量的模型类,从而产生了自然的关系。虽然这些模型链或多或少完全独立地发展,本文提出了他们的推广随机块光滑图子模型。这种方法能够利用两个世界的优势。我们追求一个通用的EM型算法估计和证明的可用性,通过应用模型模拟和现实世界的例子。

英文摘要:

The paper proposes the combination of stochastic blockmodels with smooth graphon models. The first allow for partitioning the set of individuals in a network into blocks which represent groups of nodes that presumably connect stochastically equivalently, therefore often also called communities. Smooth graphon models instead assume that the network's nodes can be arranged on a one-dimensional scale such that closeness implies a similar connectivity behavior. Both models belong to the model class of node-specific latent variables, entailing a natural relationship. While these model strands have developed more or less completely independently, this paper proposes their generalization towards stochastic block smooth graphon models. This approach enables to exploit the advantages of both worlds. We pursue a general EM-type algorithm for estimation and demonstrate the usability by applying the model to both simulated and real-world examples.

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

↑