Spectral gap of $G(n, αn, α^2 n)$ graphs and the giant component theorem
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866916996108517376 |
|---|---|
| author | Koshelev, M. Raigorodskii, A. |
| author_facet | Koshelev, M. Raigorodskii, A. |
| contents | The spectrum of a graph $G$ is the set of the eigenvalues of its adjacency matrix. It turns out that one can say a lot about a graph with the only knowledge being the spectrum of this graph. In this paper we obtain new results about the spectrum of $G(n, αn, α^2 n)$ graphs. We then apply these results to get a giant component theorem for them. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_06722 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Spectral gap of $G(n, αn, α^2 n)$ graphs and the giant component theorem Koshelev, M. Raigorodskii, A. Combinatorics The spectrum of a graph $G$ is the set of the eigenvalues of its adjacency matrix. It turns out that one can say a lot about a graph with the only knowledge being the spectrum of this graph. In this paper we obtain new results about the spectrum of $G(n, αn, α^2 n)$ graphs. We then apply these results to get a giant component theorem for them. |
| title | Spectral gap of $G(n, αn, α^2 n)$ graphs and the giant component theorem |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2510.06722 |