大型加权多部随机稀疏图的特征值分布
Eigenvalue distribution of large weighted multipartite random sparse graphs
AI总结:
本文研究了大型加权多部随机稀疏图邻接矩阵的特征值分布,证明了随机计数测度向非随机概率测度的依概率弱收敛,并给出了极限测度矩的递推关系。
摘要:
我们研究来自特定随机图系综的加权邻接矩阵的特征值分布。我们将$N$个顶点分配到固定数量$κ$个组件中,每个组件中渐近有$α_j \dot N$个顶点,其中向量$(α_1,α_2, \ldots, α_κ)$是固定的。考虑一个有$κ$个顶点的连通图$Γ$。我们构造一个有$N$个顶点的多部图,如果$Γ_{ij}=1$,则第$i$个组件中的所有顶点都与第$j$个组件中的所有顶点相连。反之,如果$Γ_{ij}=0$,则没有边连接第$i$和第$j$个组件。在生成的图中,我们以$p/N$的概率独立地保留每条边,其中$p$是固定参数。对于每条剩余的边,我们分配一个具有固定分布的独立权重,该分布具有所有有限矩。我们建立了随机计数测度向非随机概率测度的依概率弱收敛。此外,极限测度的矩可由递推关系系统导出。
英文摘要:
We investigate the distribution of eigenvalues of weighted adjacency matrices from a specific ensemble of random graphs. We distribute $N$ vertices across a fixed number $κ$ of components, with asymptotically $α_j \dot N$ vertices in each component, where the vector $(α_1,α_2, \ldots, α_κ)$ is fixed. Consider a connected graph $Γ$ with $κ$ vertices. We construct a multipartite graph with $N$ vertices, in which all vertices in the $i$-th component are connected to all vertices in the $j$-th component if if $Γ_{ij}=1$. Conversely, if $Γ_{ij}=0$, no edge connects the $i$-th and $j$-th components. In the resulting graph, we independently retain each edge with a probability of $p/N$, where $p$ is a fixed parameter. To each remaining edge, we assign an independent weight with a fixed distribution, that possesses all finite moments. We establish the weak convergence in probability of a random counting measure to a non-random probability measure. Furthermore, the moments of the limiting measure can be derived from a system of recurrence relations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。