arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1607.08812physics.soc-phcs.SImath.SP
收藏

用高斯矩阵函数探索网络谱的“中土世界”

Exploring the "Middle Earth" of Network Spectra via a Gaussian Matrix Function

Ernesto Estrada, Alhanouf Ali Alhomaidhi, Fawzi Al-Thukair

摘要:

我们研究了人工网络和真实网络的邻接矩阵的高斯矩阵函数。特别是,我们研究了高斯埃斯特拉达指数-一个指数特征的重要性接近零的特征值。该指数说明了网络谱中接近于零的特征值所包含的信息。在这里,我们得到这个指数在简单的图的界限,证明它达到最大的星图其次是完全二分图。我们还获得了Erdens-Rényi随机图的Estrada Gaussian指数公式以及Barabási-Albert图的Estrada Gaussian指数公式。我们还表明,在现实世界中的网络,这个指数是相关的重要结构模式,如完整的二部子图(bicliques)的存在。由于进化过程的结果,这种biclique自然地出现在许多现实世界的网络中。一般来说,网络邻接矩阵的高斯矩阵函数表征了以前使用的图的矩阵函数中没有描述的重要结构信息。

英文摘要:

We study a Gaussian matrix function of the adjacency matrix of artificial and real-world networks. In particular, we study the Gaussian Estrada index---an index characterizing the importance of eigenvalues close to zero. This index accounts for the information contained in the eigenvalues close to zero in the spectra of networks. Here we obtain bounds for this index in simple graphs, proving that it reaches its maximum for star graphs followed by complete bipartite graphs. We also obtain formulas for the Estrada Gaussian index of Erdős-Rényi random graphs as well as for the Barabási-Albert graphs. We also show that in real-world networks this index is related to the existence of important structural patterns, such as complete bipartite subgraphs (bicliques). Such bicliques appear naturally in many real-world networks as a consequence of the evolutionary processes giving rise to them. In general, the Gaussian matrix function of the adjacency matrix of networks characterizes important structural information not described in previously used matrix functions of graphs.

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

↑