加载中…
We study eigenvalue distribution of the adjacency matrix of weighted random uniform -hypergraphs . We assume that the graphs have vertices and the average number of hyperedges attached to one vertex is . To each edge of the graph we assign a weight given by a random variable with all moments finite. We consider the moments of normalized eigenvalue counting function of . Assuming all moments of finite, we obtain recurrent relations that determine the moments of the limiting measure .

生成讲解博客的中文版本

生成AI智能校验的中文版本