arXiv · 1304.1236
Asymptotic Spectral Distributions of Distance $k$-Graphs of Cartesian Product Graphs
Abstract
Let $G$ be a finite connected graph on two or more vertices and $G^{[N,k]}$ the distance $k$-graph of the $N$-fold Cartesian power of $G$. For a fixed $k\ge1$, we obtain explicitly the large $N$ limit of the spectral distribution (the eigenvalue distribution of the adjacency matrix) of $G^{[N,k]}$. The limit distribution is described in terms of the Hermite polynomials. The proof is based on asymptotic combinatorics along with quantum probability theory.
Explore related subjects
Keep this discovery
Yuji Hibino, Hun Hee Lee, Nobuaki Obata. 2013-04-04. Asymptotic Spectral Distributions of Distance $k$-Graphs of Cartesian Product Graphs. https://arxiv.org/abs/1304.1236
Cite the original work for its findings. Save a collection to share your selection of sources.