Embedded Tree Structures and Eigenvalue Statistics of Genus Zero One-Face Maps

Persistent Link:
http://hdl.handle.net/10150/194030
Title:
Embedded Tree Structures and Eigenvalue Statistics of Genus Zero One-Face Maps
Author:
McNicholas, Erin Mari
Issue Date:
2006
Publisher:
The University of Arizona.
Rights:
Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.
Abstract:
Using numerical simulations and combinatorics, this dissertation focuses on connections between random matrix theory and graph theory.We examine the adjacency matrices of three-regular graphs representing one-face maps. Numerical studies have revealed that the limiting eigenvalue statistics of these matrices are the same as those of much larger, and more widely studied classes of random matrices. In particular, the eigenvalue density is described by the McKay density formula, and the distribution of scaled eigenvalue spacings appears to be that of the Gaussian Orthogonal Ensemble (GOE).A natural question is whether the eigenvalue statistics depend on the genus of the underlying map. We present an algorithm for generating random three-regular graphs representing genus zero one-face maps. Our numerical studies of these three-regular graphs have revealed that their eigenvalue statistics are strikingly different from those of three-regular graphs representing maps of higher genus. While our results indicate that there is a limiting eigenvalue density formula in the genus zero case, it is not described by any established density function. Furthermore, the scaled eigenvalue spacings appear to be described by the exponential distribution function, not the GOE spacing distribution.The embedded graph of a genus zero one-face map is a planar tree, and there is a correlation between its vertices and the primitive cycles of the associated three-regular graph. The second half of this dissertation examines the structure of these embedded planar trees. In particular, we show how the Dyck path representation can be used to recast questions about the probabilistic structure of random planar trees into straightforward counting problems. Using this Dyck path approach, we find:1. the expected number of degree k vertices adjacent to j degree d vertices in a random planar tree, 2. the structure of the planar tree's adjacency matrix under a natural labeling of the vertices, and 3. an explanation for the existence of eigenvalues with multiplicity greater than one in the tree's spectrum.
Type:
text; Electronic Dissertation
Keywords:
planar trees; Dyck paths; eigenvalue statistics
Degree Name:
PhD
Degree Level:
doctoral
Degree Program:
Applied Mathematics; Graduate College
Degree Grantor:
University of Arizona
Advisor:
Flaschka, Hermann
Committee Chair:
Flaschka, Hermann

Full metadata record

DC FieldValue Language
dc.language.isoENen_US
dc.titleEmbedded Tree Structures and Eigenvalue Statistics of Genus Zero One-Face Mapsen_US
dc.creatorMcNicholas, Erin Marien_US
dc.contributor.authorMcNicholas, Erin Marien_US
dc.date.issued2006en_US
dc.publisherThe University of Arizona.en_US
dc.rightsCopyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.en_US
dc.description.abstractUsing numerical simulations and combinatorics, this dissertation focuses on connections between random matrix theory and graph theory.We examine the adjacency matrices of three-regular graphs representing one-face maps. Numerical studies have revealed that the limiting eigenvalue statistics of these matrices are the same as those of much larger, and more widely studied classes of random matrices. In particular, the eigenvalue density is described by the McKay density formula, and the distribution of scaled eigenvalue spacings appears to be that of the Gaussian Orthogonal Ensemble (GOE).A natural question is whether the eigenvalue statistics depend on the genus of the underlying map. We present an algorithm for generating random three-regular graphs representing genus zero one-face maps. Our numerical studies of these three-regular graphs have revealed that their eigenvalue statistics are strikingly different from those of three-regular graphs representing maps of higher genus. While our results indicate that there is a limiting eigenvalue density formula in the genus zero case, it is not described by any established density function. Furthermore, the scaled eigenvalue spacings appear to be described by the exponential distribution function, not the GOE spacing distribution.The embedded graph of a genus zero one-face map is a planar tree, and there is a correlation between its vertices and the primitive cycles of the associated three-regular graph. The second half of this dissertation examines the structure of these embedded planar trees. In particular, we show how the Dyck path representation can be used to recast questions about the probabilistic structure of random planar trees into straightforward counting problems. Using this Dyck path approach, we find:1. the expected number of degree k vertices adjacent to j degree d vertices in a random planar tree, 2. the structure of the planar tree's adjacency matrix under a natural labeling of the vertices, and 3. an explanation for the existence of eigenvalues with multiplicity greater than one in the tree's spectrum.en_US
dc.typetexten_US
dc.typeElectronic Dissertationen_US
dc.subjectplanar treesen_US
dc.subjectDyck pathsen_US
dc.subjecteigenvalue statisticsen_US
thesis.degree.namePhDen_US
thesis.degree.leveldoctoralen_US
thesis.degree.disciplineApplied Mathematicsen_US
thesis.degree.disciplineGraduate Collegeen_US
thesis.degree.grantorUniversity of Arizonaen_US
dc.contributor.advisorFlaschka, Hermannen_US
dc.contributor.chairFlaschka, Hermannen_US
dc.contributor.committeememberKenneth, McLaughlinen_US
dc.contributor.committeememberGrove, Larryen_US
dc.contributor.committeememberFlaschka, Hermannen_US
dc.identifier.proquest1727en_US
dc.identifier.oclc659746313en_US
All Items in UA Campus Repository are protected by copyright, with all rights reserved, unless otherwise indicated.