Eigenvalue Statistics of One-Face Maps

Publication date 26 January 2012

Full work available at URL https://arxiv.org/abs/0908.3018

adjacency matrix algorithm cubic graphs eigenvalue statistics eigenvalues maps of genus zero one-face maps

Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random graphs (graph-theoretic aspects) (05C80) Random matrices (algebraic aspects) (15B52) Numerical approximation of eigenvalues and of other parts of the spectrum of ordinary differential operators (34L16) Random matrices (probabilistic aspects) (60B20)

Abstract: We examine the adjacency matrices of three-regular graphs representing one-face maps. Numerical studies reveal that the limiting eigenvalue statistics of these matrices are the same as those of much larger, and more widely studied classes from Random Matrix Theory. We present an algorithm for generating matrices corresponding to maps of genus zero, and find the eigenvalue statistics in the genus zero case differ strikingly from those of higher genus. These results lead us to conjecture that the eigenvalue statistics depend on the rigidity of the underlying map, and the distribution of scaled eigenvalue spacings shifts from that of the Gaussian Orthogonal Ensemble to the exponential distribution as the map size increases relative to the genus.

Recommendations

This page was built for publication: Eigenvalue Statistics of One-Face Maps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3110119)