随机几何图的邻接矩阵的谱分析
Spectral Analysis of the Adjacency Matrix of Random Geometric Graphs
摘要:
本文分析了随机几何图的极限特征值分布。通过在$d$ -维环面$\mathbb{T}^d \equiv [0, 1]^d$上均匀分布$n$节点,并且如果两个节点的$\ell_{p}$ -距离$p \in [1, \infty]$至多为$r_{n}$,则连接两个节点来构造RGG.特别地,我们研究了连通性机制中RGG的邻接矩阵的LED,其中平均顶点度缩放为$\log\left( n\right)$或更快,即,$Ω\left(\log(n) \right)$。在连通性条件下,在半径为$r_{n}$的一定条件下,证明了当$n$趋于无穷大时,RGG的邻接矩阵的LED收敛于一个确定性几何图的邻接矩阵的LED.然后,对于$n$有限的,我们利用DGG的结构来近似RGG的邻接矩阵的特征值,并提供了近似误差的上界。
英文摘要:
In this article, we analyze the limiting eigenvalue distribution (LED) of random geometric graphs (RGGs). The RGG is constructed by uniformly distributing $n$ nodes on the $d$-dimensional torus $\mathbb{T}^d \equiv [0, 1]^d$ and connecting two nodes if their $\ell_{p}$-distance, $p \in [1, \infty]$ is at most $r_{n}$. In particular, we study the LED of the adjacency matrix of RGGs in the connectivity regime, in which the average vertex degree scales as $\log\left( n\right)$ or faster, i.e., $Ω\left(\log(n) \right)$. In the connectivity regime and under some conditions on the radius $r_{n}$, we show that the LED of the adjacency matrix of RGGs converges to the LED of the adjacency matrix of a deterministic geometric graph (DGG) with nodes in a grid as $n$ goes to infinity. Then, for $n$ finite, we use the structure of the DGG to approximate the eigenvalues of the adjacency matrix of the RGG and provide an upper bound for the approximation error.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。