Large deviations for the largest singular value of sparse non-Hermitian matrices
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909225157918720 |
|---|---|
| author | Han, Hyungwon |
| author_facet | Han, Hyungwon |
| contents | We prove a large deviation principle for the largest singular value of sparse non-Hermitian random matrices, or directed Erdős-Rényi networks in the constant average degree regime $p =\frac{d}{n}$ where $d$ is fixed. Entries are assumed to have Weibull distributions with tail decaying at rate $e^{-t^α}$ for $α>0$. While the law of large number results agree with the largest eigenvalue of sparse Hermitian matrices given in (Ganguly and Nam, '22) and (Ganguly, Hiesmayr and Nam, '22), large deviation results are surprisingly simpler, exhibiting a single transition at $α=2$. The rate function for undirected networks with $0<α\leq 2$ involved a transition at $α=1$ and a complicated variational formula due to the emergence of cliques with large edge-weights (Ganguly, Hiesmayr and Nam, '22). For directed networks, we introduce a clique reduction technique which reformulates the problem for undirected networks with maximum clique size $2$, and the rate function is greatly simplified. For $α>2$, both the law of large numbers and large deviation results are identical to the sparse Hermitian case. Our results easily generalize to rectangular i.i.d. ensembles. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_09851 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Large deviations for the largest singular value of sparse non-Hermitian matrices Han, Hyungwon Probability Combinatorics We prove a large deviation principle for the largest singular value of sparse non-Hermitian random matrices, or directed Erdős-Rényi networks in the constant average degree regime $p =\frac{d}{n}$ where $d$ is fixed. Entries are assumed to have Weibull distributions with tail decaying at rate $e^{-t^α}$ for $α>0$. While the law of large number results agree with the largest eigenvalue of sparse Hermitian matrices given in (Ganguly and Nam, '22) and (Ganguly, Hiesmayr and Nam, '22), large deviation results are surprisingly simpler, exhibiting a single transition at $α=2$. The rate function for undirected networks with $0<α\leq 2$ involved a transition at $α=1$ and a complicated variational formula due to the emergence of cliques with large edge-weights (Ganguly, Hiesmayr and Nam, '22). For directed networks, we introduce a clique reduction technique which reformulates the problem for undirected networks with maximum clique size $2$, and the rate function is greatly simplified. For $α>2$, both the law of large numbers and large deviation results are identical to the sparse Hermitian case. Our results easily generalize to rectangular i.i.d. ensembles. |
| title | Large deviations for the largest singular value of sparse non-Hermitian matrices |
| topic | Probability Combinatorics |
| url | https://arxiv.org/abs/2406.09851 |