Stochastic Block Transition Models for Dynamic Networks
원문 초록
There has been great interest in recent years on statistical models for dynamic networks. In this paper, I propose a stochastic block transition model (SBTM) for dynamic networks that is inspired by the well-known stochastic block model (SBM) for static networks and previous dynamic extensions of the SBM. Unlike most existing dynamic network models, it does not make a hidden Markov assumption on the edge-level dynamics, allowing the presence or absence of edges to directly influence future edge probabilities while retaining the interpretability of the SBM. I derive an approximate inference procedure for the SBTM and demonstrate that it is significantly better at reproducing durations of edges in real social network data.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Partition-wise Graph Filtering: A Unified Perspective Through the Lens of Graph Coarsening
Community and hyperedge inference in multiple hypergraphs
Communities in the Kuramoto Model: Dynamics and Detection via Path Signatures
A Semidefinite Relaxation Approach for Fair Graph Clustering
What Is Missing In Homophily? Disentangling Graph Homophily For Graph Neural Networks
CSA-Trans: Code Structure Aware Transformer for AST
토론
이 논문과 연결된 포럼 글이 아직 없습니다.