随机局部样本图的Laplacian谱性质
Laplacian Spectral Properties of Graphs from Random Local Samples
摘要:
网络的拉普拉斯特征值在许多结构和动力网络问题的分析中起着重要的作用。在本文中,我们研究了归一化拉普拉斯矩阵的特征值谱和网络的“局部”子图的结构之间的关系。我们称一个子图为\emph{local},当它是由围绕一个节点的半径为$r$的呼吸优先搜索(BFS)获得的节点集所诱导的。在本文中,我们提出的技术来估计从随机收集的诱导局部子图的归一化拉普拉斯矩阵的谱特性。特别是,我们提供了一个算法来估计归一化拉普拉斯矩阵的谱矩(其特征值的幂和)。此外,我们提出了一种技术,基于凸优化,从局部子图的归一化拉普拉斯矩阵的谱半径计算上界和下界。我们说明了我们的研究结果的规范化拉普拉斯频谱的大型在线社交网络。
英文摘要:
The Laplacian eigenvalues of a network play an important role in the analysis of many structural and dynamical network problems. In this paper, we study the relationship between the eigenvalue spectrum of the normalized Laplacian matrix and the structure of `local' subgraphs of the network. We call a subgraph \emph{local} when it is induced by the set of nodes obtained from a breath-first search (BFS) of radius $r$ around a node. In this paper, we propose techniques to estimate spectral properties of the normalized Laplacian matrix from a random collection of induced local subgraphs. In particular, we provide an algorithm to estimate the spectral moments of the normalized Laplacian matrix (the power-sums of its eigenvalues). Moreover, we propose a technique, based on convex optimization, to compute upper and lower bounds on the spectral radius of the normalized Laplacian matrix from local subgraphs. We illustrate our results studying the normalized Laplacian spectrum of a large-scale online social network.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。