The top eigenvalue of uniformly random trees
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909156641865728 |
|---|---|
| author | Addario-Berry, Louigi Lugosi, Gábor Oliveira, Roberto Imbuzeiro |
| author_facet | Addario-Berry, Louigi Lugosi, Gábor Oliveira, Roberto Imbuzeiro |
| contents | Let ${\mathbf T}_n$ be a uniformly random tree with vertex set $[n]=\{1,\ldots,n\}$, let $Δ_{{\mathbf T}_n}$ be the largest vertex degree in ${\mathbf T}_n$, and let $λ_1({\mathbf T}_n),\ldots,λ_n({\mathbf T}_n)$ be the eigenvalues of its adjacency matrix, arranged in decreasing order. We prove that $|λ_1({\mathbf T}_n)-\sqrt{Δ_{{\mathbf T}_n}}| \to 0$ in expectation as $n \to \infty$, and additionally prove probability tail bounds for $|λ_1({\mathbf T}_n)-\sqrt{Δ_{{\mathbf T}_n}}|$. Writing $a_n$ for any median of $Δ_{{\mathbf T}_n}$, we also prove that $|λ_k({\mathbf T}_n)-\sqrt{a_n}| \to 0$ in expectation, uniformly over $1 \le k \le e^{\log^β(n)}$, for any fixed $β\in (0,1/2)$.
The proof is based on the trace method and thus on counting closed walks in a random tree. To this end, we develop novel combinatorial tools for encoding walks in trees that we expect will find other applications. In order to apply these tools, we show that uniformly random trees -- after appropriate "surgery" -- satisfy, with high probability, the properties required for the combinatorial bounds to be effective. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_08443 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The top eigenvalue of uniformly random trees Addario-Berry, Louigi Lugosi, Gábor Oliveira, Roberto Imbuzeiro Probability 60C05, 05C05, 05C50 Let ${\mathbf T}_n$ be a uniformly random tree with vertex set $[n]=\{1,\ldots,n\}$, let $Δ_{{\mathbf T}_n}$ be the largest vertex degree in ${\mathbf T}_n$, and let $λ_1({\mathbf T}_n),\ldots,λ_n({\mathbf T}_n)$ be the eigenvalues of its adjacency matrix, arranged in decreasing order. We prove that $|λ_1({\mathbf T}_n)-\sqrt{Δ_{{\mathbf T}_n}}| \to 0$ in expectation as $n \to \infty$, and additionally prove probability tail bounds for $|λ_1({\mathbf T}_n)-\sqrt{Δ_{{\mathbf T}_n}}|$. Writing $a_n$ for any median of $Δ_{{\mathbf T}_n}$, we also prove that $|λ_k({\mathbf T}_n)-\sqrt{a_n}| \to 0$ in expectation, uniformly over $1 \le k \le e^{\log^β(n)}$, for any fixed $β\in (0,1/2)$. The proof is based on the trace method and thus on counting closed walks in a random tree. To this end, we develop novel combinatorial tools for encoding walks in trees that we expect will find other applications. In order to apply these tools, we show that uniformly random trees -- after appropriate "surgery" -- satisfy, with high probability, the properties required for the combinatorial bounds to be effective. |
| title | The top eigenvalue of uniformly random trees |
| topic | Probability 60C05, 05C05, 05C50 |
| url | https://arxiv.org/abs/2403.08443 |