Many existing statistical models for networks overlook the fact that many real world networks are formed through a growth process. To address this, we introduce the PAPER (Preferential Attachment Plus Erdős--Rényi) model for random networks, where we let a random network G be the union of a preferential attachment (PA) tree T and additional Erdős--Rényi (ER) random edges. The PA tree component captures the underlying growth/recruitment process of a network where vertices and edges are added sequentially, while the ER component can be regarded as random noise. Given only a single snapshot of the final network G, we study the problem of constructing confidence sets for the early history, in particular the root node, of the unobserved growth process; the root node can be patient zero in a disease infection network or the source of fake news in a social media network. We propose an inference algorithm based on Gibbs sampling that scales to networks with millions of nodes and provide theoretical analysis showing that the expected size of the confidence set is small so long as the noise level of the ER edges is not too large. We also propose variations of the model in which multiple growth processes occur simultaneously, reflecting the growth of multiple communities, and we use these models to provide a new approach to community detection.
Latent heterogeneous multilayer community detection
Huawei Noah's Ark Lab(华为诺亚方舟实验室);University of South Florida(南佛罗里达大学);University of Michigan(密歇根大学);GIPSA-lab, University Grenoble-Alpes(格勒诺布尔-阿尔卑斯大学GIPSA实验室);MIT-IBM Watson AI Lab, IBM Research(IBM研究院MIT-IBM沃森人工智能实验室)
vGraph: A Generative Model for Joint Community Detection and Node Representation Learning
National Taiwan University(台湾大学);Mila-Quebec Institute for Learning Algorithms(Mila-魁北克学习算法研究所);Harvard University(哈佛大学);Element AI;HEC Montreal(蒙特利尔高等商学院)
Fudan University(复旦大学);Shanghai Center for Mathematical Sciences(上海数学中心);University of Pennsylvania(宾夕法尼亚大学);Shanghai University of Finance and Economics(上海财经大学)
Robust Community Detection for Noisy Networks with Covariates: Application to Functional Brain Networks
University of Connecticut(康涅狄格大学);University of Pennsylvania(宾夕法尼亚大学);University of Texas MD Anderson Cancer Center(德克萨斯大学安德森癌症中心);Yale University(耶鲁大学)
Community Network Auto-Regression for High-Dimensional Time Series
对大规模网络节点的响应进行建模是一项重要的任务,在实践中经常出现。提出了一种社区网络向量自回归(CNAR)模型,该模型利用网络结构来刻画高维时间序列的相关性和社区内同质性。CNAR模型通过允许不同网络社区的异构网络效应,大大提高了网络向量自回归(Zhu et al,2017,NAR)模型的灵活性和通用性。此外,非社区相关的潜在因素也包括在内,以解释未知的横截面依赖。网络社区的数量可以随着网络的扩展而发散,这导致估计发散的模型参数数量。我们得到了一组平稳条件,并开发了一个有效的两步加权最小二乘估计。建立了估计量的相合性和渐近正态性。理论结果表明,当误差具有因子结构时,两步估计比一步估计提高了一个数量级。CNAR模型的优点进一步说明了各种合成和真实的数据集。
Dynamic sparse graphs with overlapping communities
University of Cyprus(塞浦路斯大学);Imperial College London(伦敦帝国学院);Sapienza University of Rome(罗马第一大学);London School of Economics and Political Science(伦敦政治经济学院)