arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1507.07529math-phmath.MP
收藏

二部大加权随机图的特征值分布。解决方法

Eigenvalue distribution of bipartite large weighted random graphs. Resolvent approach

Valentin Vengerovsky

摘要:

研究了加权随机二部图$Γ= Γ_{N,p}$的邻接矩阵$A^{(N,p, α)}$的特征值分布。我们假设图有$N$顶点,部分的比率为$\fracα{1-α}$,并且连接到一个顶点的平均边数为$α\cdot p$或$(1-α)\cdot p$。对于图$e_{ij}$的每个边,我们分配一个由具有有限二阶矩的随机变量$a_{ij}$给出的权重。本文考虑$A^{(N,p, α)}$的预解式$G^{(N,p, α)}(z)$,并在极限$N\to \infty$中研究函数$f_{1,N}(u,z)=\frac{1}{[αN]}\sum_{k=1}^{[αN]}e^{-ua_k^2G_{kk}^{(N,p,α)}(z)}$和$f_{2,N}(u,z)=\frac{1}{N-[αN]}\sum_{k=[αN]+1}^Ne^{-ua_k^2G_{kk}^{(N,p,α)}(z)}$.我们推导出封闭的方程组,唯一确定的极限函数$f_{1}(u,z)$和$f_{2}(u,z)$。这个方程组允许我们证明极限测度$σ_{p, α}$的存在性。证明了归一化特征值计数测度的依概率弱收敛性。

英文摘要:

We study eigenvalue distribution of the adjacency matrix $A^{(N,p, α)}$ of weighted random bipartite graphs $Γ= Γ_{N,p}$. We assume that the graphs have $N$ vertices, the ratio of parts is $\fracα{1-α}$ and the average number of edges attached to one vertex is $α\cdot p$ or $(1-α)\cdot p$. To each edge of the graph $e_{ij}$ we assign a weight given by a random variable $a_{ij}$ with the finite second moment. We consider the resolvents $G^{(N,p, α)}(z)$ of $A^{(N,p, α)}$ and study the functions $f_{1,N}(u,z)=\frac{1}{[αN]}\sum_{k=1}^{[αN]}e^{-ua_k^2G_{kk}^{(N,p,α)}(z)}$ and $f_{2,N}(u,z)=\frac{1}{N-[αN]}\sum_{k=[αN]+1}^Ne^{-ua_k^2G_{kk}^{(N,p,α)}(z)}$ in the limit $N\to \infty$. We derive closed system of equations that uniquely determine the limiting functions $f_{1}(u,z)$ and $f_{2}(u,z)$. This system of equations allow us to prove the existence of the limiting measure $σ_{p, α}$ . The weak convergence in probability of normalized eigenvalue counting measures is proved.

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

↑