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

基于节点特征的图子网络估计

Network estimation via graphon with node features

Yi Su, Raymond K. W. Wong, Thomas C. M. Lee

摘要:

近年来,对网络中联系概率的估计引起了越来越多的兴趣。网络分析的一个流行模型是可交换图模型(ExGM),其特征在于称为图子的二维函数。估计一个潜在的graphon成为这种分析的关键。已经提出了几种非参数估计方法,其中一些方法是可证明相容的。然而,如果节点的某些有用特征(例如,年龄和学校在社会网络环境中),这些方法都没有被设计为纳入这一信息来源,以帮助估计。本文提出了一种融合邻接矩阵和节点特征信息的一致图子估计方法。我们表明,适当地利用功能可以提高估计。提出了一种交叉验证的方法来自动选择方法的调整参数。

英文摘要:

Estimating the probabilities of linkages in a network has gained increasing interest in recent years. One popular model for network analysis is the exchangeable graph model (ExGM) characterized by a two-dimensional function known as a graphon. Estimating an underlying graphon becomes the key of such analysis. Several nonparametric estimation methods have been proposed, and some are provably consistent. However, if certain useful features of the nodes (e.g., age and schools in social network context) are available, none of these methods was designed to incorporate this source of information to help with the estimation. This paper develops a consistent graphon estimation method that integrates the information from both the adjacency matrix itself and node features. We show that properly leveraging the features can improve the estimation. A cross-validation method is proposed to automatically select the tuning parameter of the method.

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

↑