Applications of Mathematics, Vol. 65, No. 5, pp. 609-618, 2020
Partial sum of eigenvalues of random graphs
Israel Rocha
Received December 10, 2019. Published online September 4, 2020.
Abstract: 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.
Keywords: sum of eigenvalues; graph energy; random matrix
Affiliations: Israel Rocha, The Czech Academy of Sciences, Institute of Computer Science, Pod Vodárenskou věží 2, 182 07 Praha 8, Czech Republic, e-mail: israelrocha@gmail.com