Spectral analysis of the (combinatorial) Laplacian or the adjacency matrix of a graph has been studied from various aspects. In this paper we focus on asymptotic spectral properties for a large regular graph and propose a new method based on algebraic probability theory. General results are proved for Cayley graphs of discrete groups and for distance-regular graphs.
Spectral analysis of the (combinatorial) Laplacian or the adjacency matrix of a graph has been studied from various aspects. In this paper we focus on asymptotic spectral properties for a large regular graph and propose a new method based on algebraic probability theory. General results are proved for Cayley graphs of discrete groups and for distance-regular graphs.
Droits d'auteur :
Attribution Non-Commercial (BY-NC)
Formats disponibles
Téléchargez comme PDF, TXT ou lisez en ligne sur Scribd
Spectral analysis of the (combinatorial) Laplacian or the adjacency matrix of a graph has been studied from various aspects. In this paper we focus on asymptotic spectral properties for a large regular graph and propose a new method based on algebraic probability theory. General results are proved for Cayley graphs of discrete groups and for distance-regular graphs.
Droits d'auteur :
Attribution Non-Commercial (BY-NC)
Formats disponibles
Téléchargez comme PDF, TXT ou lisez en ligne sur Scribd