arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2107.00153stat.MEmath.PRstat.CO
收藏

网络潜在增长过程的根和社团推断

Root and community inference on the latent growth process of a network

Harry Crane, Min Xu

摘要:

许多现有的网络统计模型忽略了这样一个事实,即许多现实世界的网络是通过增长过程形成的。为了解决这个问题,我们引入了随机网络的PAPER(优先连接加Erdens-Rényi)模型,其中我们让随机网络G是优先连接(PA)树T和额外的Erdens-Rényi(ER)随机边的并集。PA树组件捕获了网络的潜在增长/招募过程,其中顶点和边依次添加,而ER组件可以被视为随机噪声。只给出最终网络G的一个快照,我们研究了为未观察到的增长过程的早期历史,特别是根节点构建置信集的问题;根节点可以是疾病感染网络中的零号病人,也可以是社交媒体网络中的假新闻来源。我们提出了一个推理算法的基础上吉布斯抽样,规模以百万计的节点网络,并提供理论分析表明,只要ER边缘的噪声水平不是太大的预期大小的置信集是小的。我们还提出了多种增长过程同时发生的模型的变化,反映了多个社区的增长,我们使用这些模型提供了一种新的方法来社区检测。

英文摘要:

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.

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

↑