MoN18: Eighteenth Mathematics of Networks meeting

Carl Dettmann (Bristol) Spectral statistics in spatial networks

Diffusion processes on networks can be described using the spectrum of the graph Laplacian. This spectrum and that of the related adjacency matrix have been studied for the most popular model of spatial networks, the random geometric graph. Degeneracies are related to graph symmetries, which can be quantified as a function of parameters in one, two or three dimensions. The spectral statistics can also be compared with relevant models from random matrix theory.