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

Watt-Strogatz随机图的Eigenvalue分布

The Eigenvalue Distribution of the Watt-Strogatz Random Graph

Poramate Nakkirt

摘要:

本文研究了Watts-Strogatz随机图的特征值分布,即所谓的“小世界”随机图。小世界随机图的构造始于一个n个顶点的正则环格,每个顶点正好有k个邻居,每边有相等的k/2条边。在概率p的情况下,特定顶点的每个下侧邻居将独立地重新连接到图上的随机顶点,而不允许自循环或重复。重新布线过程从顶点1的第一个相邻邻居开始,并以有序的方式继续到顶点n的最远的下侧邻居。每条边都必须考虑一次。本文主要研究了表示小世界随机图的邻接矩阵A_n的特征值。我们计算了特征值分布的一阶矩、二阶矩,并证明了当n趋于无穷大时的极限三阶矩。

英文摘要:

This paper studies the eigenvalue distribution of the Watts-Strogatz random graph, which is known as the "small-world" random graph. The construction of the small-world random graph starts with a regular ring lattice of n vertices; each has exactly k neighbors with equally k/2 edges on each side. With probability p, each downside neighbor of a particular vertex will rewire independently to a random vertex on the graph without allowing for self-loops or duplication. The rewiring process starts at the first adjacent neighbor of vertex 1 and continues in an orderly fashion to the farthest downside neighbor of vertex n. Each edge must be considered once. This paper focuses on the eigenvalues of the adjacency matrix A_n, used to represent the small-world random graph. We compute the first moment, second moment, and prove the limiting third moment as n goes to infinity of the eigenvalue distribution.

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

↑