English

Eigenvalue Distribution of Large Weighted Random Sparse Uniform $q$-Hypergraphs

Combinatorics 2025-08-20 v1 Mathematical Physics math.MP

Abstract

We study eigenvalue distribution of the adjacency matrix A(N,p,q)A^{(N,p,q)} of weighted random uniform qq-hypergraphs Γ=ΓN,p,q\Gamma= \Gamma_{N,p,q}. We assume that the graphs have NN vertices and the average number of hyperedges attached to one vertex is (q1)!p(q-1)!\cdot p. To each edge of the graph eije_{ij} we assign a weight given by a random variable aija_{ij} with all moments finite. We consider the moments of normalized eigenvalue counting function σN,p,q\sigma_{N,p,q} of A(N,p,q)A^{(N,p,q)}. Assuming all moments of aa finite, we obtain recurrent relations that determine the moments of the limiting measure σp,q=limNσN,p,q\sigma_{p,q} = \lim_{N\to\infty} \sigma_{N,p,q}.

Keywords

Cite

@article{arxiv.2508.13297,
  title  = {Eigenvalue Distribution of Large Weighted Random Sparse Uniform $q$-Hypergraphs},
  author = {Valentin Vengerovsky},
  journal= {arXiv preprint arXiv:2508.13297},
  year   = {2025}
}
R2 v1 2026-07-01T04:55:33.253Z