Skip to main content

ASU Electronic Theses and Dissertations


This collection includes most of the ASU Theses and Dissertations from 2011 to present. ASU Theses and Dissertations are available in downloadable PDF format; however, a small percentage of items are under embargo. Information about the dissertations/theses includes degree information, committee members, an abstract, supporting data or media.

In addition to the electronic theses found in the ASU Digital Repository, ASU Theses and Dissertations can be found in the ASU Library Catalog.

Dissertations and Theses granted by Arizona State University are archived and made available through a joint effort of the ASU Graduate College and the ASU Libraries. For more information or questions about this collection contact or visit the Digital Repository ETD Library Guide or contact the ASU Graduate College at gradformat@asu.edu.


Bacteriophage (phage) are viruses that infect bacteria. Typical laboratory experiments show that in a chemostat containing phage and susceptible bacteria species, a mutant bacteria species will evolve. This mutant species is usually resistant to the phage infection and less competitive compared to the susceptible bacteria species. In some experiments, both susceptible and resistant bacteria species, as well as phage, can coexist at an equilibrium for hundreds of hours. The current research is inspired by these observations, and the goal is to establish a mathematical model and explore sufficient and necessary conditions for the coexistence. In this dissertation a model with ...

Contributors
Han, Zhun, Smith, Hal, Armbruster, Dieter, et al.
Created Date
2012

In this thesis, I investigate the C*-algebras and related constructions that arise from combinatorial structures such as directed graphs and their generalizations. I give a complete characterization of the C*-correspondences associated to directed graphs as well as results about obstructions to a similar characterization of these objects for generalizations of directed graphs. Viewing the higher-dimensional analogues of directed graphs through the lens of product systems, I give a rigorous proof that topological k-graphs are essentially product systems over N^k of topological graphs. I introduce a "compactly aligned" condition for such product systems of graphs and show that this coincides with ...

Contributors
Patani, Nura, Kaliszewski, Steven, Quigg, John, et al.
Created Date
2011

This dissertation contains three main results. First, a generalization of Ionescu's theorem is proven. Ionescu's theorem describes an unexpected connection between graph C*-algebras and fractal geometry. In this work, this theorem is extended from ordinary directed graphs to higher-rank graphs. Second, a characterization is given of the Cuntz-Pimsner algebra associated to a tensor product of C*-correspondences. This is a generalization of a result by Kumjian about graphs algebras. This second result is applied to several important special cases of Cuntz-Pimsner algebras including topological graph algebras, crossed products by the integers and crossed products by completely positive maps. The result has ...

Contributors
Morgan, Adam, Kaliszewski, Steven, Quigg, John, et al.
Created Date
2016

In the 1980's, Gromov and Piatetski-Shapiro introduced a technique called "hybridization'' which allowed them to produce non-arithmetic hyperbolic lattices from two non-commensurable arithmetic lattices. It has been asked whether an analogous hybridization technique exists for complex hyperbolic lattices, because certain geometric obstructions make it unclear how to adapt this technique. This thesis explores one possible construction (originally due to Hunt) in depth and uses it to produce arithmetic lattices, non-arithmetic lattices, and thin subgroups in SU(2,1). Dissertation/Thesis

Contributors
Wells, Joseph, Paupert, Julien, Kotschwar, Brett, et al.
Created Date
2019