Expansion in Distance Matrices
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912274223988736 |
|---|---|
| author | Byrne, John Johnston, Jacob Schildkraut, Carl Tait, Michael |
| author_facet | Byrne, John Johnston, Jacob Schildkraut, Carl Tait, Michael |
| contents | The normalized distance Laplacian matrix $\mathcal{D}^{\mathcal{L}}(G)$ of a graph $G$ is a natural generalization of the normalized Laplacian matrix, arising from the matrix of pairwise distances between vertices rather than the adjacency matrix. Following the motif that this matrix behaves quite differently to the normalized Laplacian matrix, we show that both the spectral gap and Cheeger constant of $\mathcal{D}^{\mathcal{L}}(G)$ are bounded away from $0$ independently of the graph $G$. The spectral result holds more generally for finite metric spaces. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_10895 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Expansion in Distance Matrices Byrne, John Johnston, Jacob Schildkraut, Carl Tait, Michael Combinatorics The normalized distance Laplacian matrix $\mathcal{D}^{\mathcal{L}}(G)$ of a graph $G$ is a natural generalization of the normalized Laplacian matrix, arising from the matrix of pairwise distances between vertices rather than the adjacency matrix. Following the motif that this matrix behaves quite differently to the normalized Laplacian matrix, we show that both the spectral gap and Cheeger constant of $\mathcal{D}^{\mathcal{L}}(G)$ are bounded away from $0$ independently of the graph $G$. The spectral result holds more generally for finite metric spaces. |
| title | Expansion in Distance Matrices |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2503.10895 |