{"id":{"repo_id":"queens","oai_identifier":"oai:queensu.scholaris.ca:1974/36303"},"canonical_url":"https://search.dev.ndltd.org/etd/queens/oai:queensu.scholaris.ca:1974/36303","repository":{"repo_id":"queens","name":"Queens University","base_url":"https://qspace.library.queensu.ca/server/oai/request"},"display":{"title":"Eigenvalue Spacings of Transition Matrices Associated to Directed Graphs","abstract":"This thesis develops new spectral techniques to analyze the convergence behaviour of finite, discrete-time, time-homogeneous Markov chains and explores their applications to directed graphs. We derive an explicit expression for the error term in the convergence theorem in terms of the eigenvalues of the transition matrix. This expression reveals that the convergence behaviour is governed not only by the spectral gap but also by the spacings between eigenvalues. Interpreting the transition matrix as describing a random walk on a directed graph, we use the error term to obtain a new spectral upper bound on the diameter of the directed graph. Finally, we establish several variations of the Expander Mixing Lemma for directed graphs, further illustrating how eigenvalue structure controls combinatorial properties.","abstract_html":"This thesis develops new spectral techniques to analyze the convergence behaviour of finite, discrete-time, time-homogeneous Markov chains and explores their applications to directed graphs. We derive an explicit expression for the error term in the convergence theorem in terms of the eigenvalues of the transition matrix. This expression reveals that the convergence behaviour is governed not only by the spectral gap but also by the spacings between eigenvalues. Interpreting the transition matrix as describing a random walk on a directed graph, we use the error term to obtain a new spectral upper bound on the diameter of the directed graph. Finally, we establish several variations of the Expander Mixing Lemma for directed graphs, further illustrating how eigenvalue structure controls combinatorial properties.","abstract_has_math":false,"creators":["Carter, Rebecca"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Mathematics and Statistics","school":null,"contributors":[],"advisors":["Murty , M. Ram","Taylor, Peter"],"committee_chairs":[],"committee_members":[],"year":2026,"date_issued":"2026-04-22","date_published":"2026-04-22","updated_at":"2026-07-27T20:35:41Z","subjects":["spectral graph theory","discrete Markov chains","directed graphs","random walks","eigenvalue spacings","rate of convergence","graph diameter"],"languages":["eng"],"rights":["Attribution 4.0 International"],"rights_urls":["http://creativecommons.org/licenses/by/4.0/"],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/1974/36303","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.department","label":"Department","values":["Mathematics and Statistics"]},{"key":"dc:contributor.supervisor","label":"Supervisor","values":["Murty , M. Ram","Taylor, Peter"]},{"key":"dc:creator","label":"Author","values":["Carter, Rebecca"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2026-04-22T13:49:57Z"]},{"key":"dc:date.issued","label":"Date","values":["2026-04-22"]},{"key":"dc:type","label":"Dc Type","values":["thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["spectral graph theory","discrete Markov chains","directed graphs","random walks","eigenvalue spacings","rate of convergence","graph diameter"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Attribution 4.0 International"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://creativecommons.org/licenses/by/4.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/1974/36303"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["This thesis develops new spectral techniques to analyze the convergence behaviour of finite, discrete-time, time-homogeneous Markov chains and explores their applications to directed graphs. We derive an explicit expression for the error term in the convergence theorem in terms of the eigenvalues of the transition matrix. This expression reveals that the convergence behaviour is governed not only by the spectral gap but also by the spacings between eigenvalues. Interpreting the transition matrix as describing a random walk on a directed graph, we use the error term to obtain a new spectral upper bound on the diameter of the directed graph. Finally, we establish several variations of the Expander Mixing Lemma for directed graphs, further illustrating how eigenvalue structure controls combinatorial properties."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["PhD"]},{"key":"dc:title","label":"Title","values":["Eigenvalue Spacings of Transition Matrices Associated to Directed Graphs"]}]}],"canonical_facts":{"dc:contributor.department":["Mathematics and Statistics"],"dc:contributor.supervisor":["Murty , M. Ram","Taylor, Peter"],"dc:creator":["Carter, Rebecca"],"dc:date.accessioned":["2026-04-22T13:49:57Z"],"dc:date.issued":["2026-04-22"],"dc:description.abstract":["This thesis develops new spectral techniques to analyze the convergence behaviour of finite, discrete-time, time-homogeneous Markov chains and explores their applications to directed graphs. We derive an explicit expression for the error term in the convergence theorem in terms of the eigenvalues of the transition matrix. This expression reveals that the convergence behaviour is governed not only by the spectral gap but also by the spacings between eigenvalues. Interpreting the transition matrix as describing a random walk on a directed graph, we use the error term to obtain a new spectral upper bound on the diameter of the directed graph. Finally, we establish several variations of the Expander Mixing Lemma for directed graphs, further illustrating how eigenvalue structure controls combinatorial properties."],"dc:description.degree":["PhD"],"dc:identifier.uri":["https://hdl.handle.net/1974/36303"],"dc:language.iso":["eng"],"dc:rights":["Attribution 4.0 International"],"dc:rights.uri":["http://creativecommons.org/licenses/by/4.0/"],"dc:subject":["spectral graph theory","discrete Markov chains","directed graphs","random walks","eigenvalue spacings","rate of convergence","graph diameter"],"dc:title":["Eigenvalue Spacings of Transition Matrices Associated to Directed Graphs"],"dc:type":["thesis"]},"updated_at":"2026-07-27T20:35:41Z"}