Partial sum of eigenvalues of random graphs

Rocha, Israel

Applications of Mathematics, Tome 65 (2020) no. 5, pp. 609-618

Résumé

Let $G$ be a graph on $n$ vertices and let $\lambda _{1}\geq \lambda _{2}\geq \ldots \geq \lambda _{n}$ be the eigenvalues of its adjacency matrix. For random graphs we investigate the sum of eigenvalues $s_{k}=\sum _{i=1}^{k}\lambda _{i}$, for $1\leq k\leq n$, and show that a typical graph has $s_{k}\leq (e(G)+k^{2})/(0.99n)^{1/2}$, where $e(G)$ is the number of edges of $G$. We also show bounds for the sum of eigenvalues within a given range in terms of the number of edges. The approach for the proofs was first used in Rocha (2020) to bound the partial sum of eigenvalues of the Laplacian matrix.

Détail

DOI : 10.21136/AM.2020.0352-19

Classification : 05C50, 15A18
Keywords: sum of eigenvalues; graph energy; random matrix