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.


Subject
Date Range
2010 2019


The uncrossing partially ordered set $P_n$ is defined on the set of matchings on $2n$ points on a circle represented with wires. The order relation is $\tau'\leq \tau$ in $P_n$ if and only if $\tau'$ is obtained by resolving a crossing of $\tau$. %This partial order has been studied by Alman-Lian-Tran, Huang-Wen-Xie, Kenyon, and Lam. %The posets $P_n$ emerged from studies of circular planar electrical networks. Circular planar electrical networks are finite weighted undirected graphs embedded into a disk, with boundary vertices and interior vertices. By Curtis-Ingerman-Morrow and de Verdi\`ere-Gitler-Vertigan, the electrical networks can be encoded with response matrices. By ...

Contributors
Kim, Younghwan, Fishel, Susanna, Bremner, Andrew, et al.
Created Date
2018

A tiling is a collection of vertex disjoint subgraphs called tiles. If the tiles are all isomorphic to a graph $H$ then the tiling is an $H$-tiling. If a graph $G$ has an $H$-tiling which covers all of the vertices of $G$ then the $H$-tiling is a perfect $H$-tiling or an $H$-factor. A goal of this study is to extend theorems on sufficient minimum degree conditions for perfect tilings in graphs to directed graphs. Corrádi and Hajnal proved that every graph $G$ on $3k$ vertices with minimum degree $delta(G)ge2k$ has a $K_3$-factor, where $K_s$ is the complete graph on $s$ ...

Contributors
Molla, Theodore, Kierstead, Henry A, Czygrinow, Andrzej, et al.
Created Date
2013

In 1984, Sinnott used $p$-adic measures on $\mathbb{Z}_p$ to give a new proof of the Ferrero-Washington Theorem for abelian number fields by realizing $p$-adic $L$-functions as (essentially) the $Gamma$-transform of certain $p$-adic rational function measures. Shortly afterward, Gillard and Schneps independently adapted Sinnott's techniques to the case of $p$-adic $L$-functions associated to elliptic curves with complex multiplication (CM) by realizing these $p$-adic $L$-functions as $Gamma$-transforms of certain $p$-adic rational function measures. The results in the CM case give the vanishing of the Iwasawa $mu$-invariant for certain $mathbb{Z}_p$-extensions of imaginary quadratic fields constructed from torsion points of CM elliptic curves. In ...

Contributors
Zinzer, Scott, Childress, Nancy, Bremner, Andrew, et al.
Created Date
2015

A central concept of combinatorics is partitioning structures with given constraints. Partitions of on-line posets and on-line graphs, which are dynamic versions of the more familiar static structures posets and graphs, are examined. In the on-line setting, vertices are continually added to a poset or graph while a chain partition or coloring (respectively) is maintained. %The optima of the static cases cannot be achieved in the on-line setting. Both upper and lower bounds for the optimum of the number of chains needed to partition a width $w$ on-line poset exist. Kierstead's upper bound of $\frac{5^w-1}{4}$ was improved to $w^{14 \lg ...

Contributors
Smith, Matthew Earl, Kierstead, Henry A, Colbourn, Charles, et al.
Created Date
2012

Since Duffin and Schaeffer's introduction of frames in 1952, the concept of a frame has received much attention in the mathematical community and has inspired several generalizations. The focus of this thesis is on the concept of an operator-valued frame (OVF) and a more general concept called herein an operator-valued frame associated with a measure space (MS-OVF), which is sometimes called a continuous g-frame. The first of two main topics explored in this thesis is the relationship between MS-OVFs and objects prominent in quantum information theory called positive operator-valued measures (POVMs). It has been observed that every MS-OVF gives rise ...

Contributors
Robinson, Benjamin David, Cochran, Douglas, Moran, William, et al.
Created Date
2014

In a large network (graph) it would be desirable to guarantee the existence of some local property based only on global knowledge of the network. Consider the following classical example: how many connections are necessary to guarantee that the network contains three nodes which are pairwise adjacent? It turns out that more than n^2/4 connections are needed, and no smaller number will suffice in general. Problems of this type fall into the category of ``extremal graph theory.'' Generally speaking, extremal graph theory is the study of how global parameters of a graph are related to local properties. This dissertation deals ...

Contributors
Debiasio, Louis, Kierstead, Henry A, Czygrinow, Andrzej, et al.
Created Date
2011

Increasing interest in individualized treatment strategies for prevention and treatment of health disorders has created a new application domain for dynamic modeling and control. Standard population-level clinical trials, while useful, are not the most suitable vehicle for understanding the dynamics of dosage changes to patient response. A secondary analysis of intensive longitudinal data from a naltrexone intervention for fibromyalgia examined in this dissertation shows the promise of system identification and control. This includes datacentric identification methods such as Model-on-Demand, which are attractive techniques for estimating nonlinear dynamical systems from noisy data. These methods rely on generating a local function approximation ...

Contributors
Deshpande, Sunil, Rivera, Daniel E., Peet, Matthew M., et al.
Created Date
2014

In this thesis, we focus on some of the NP-hard problems in control theory. Thanks to the converse Lyapunov theory, these problems can often be modeled as optimization over polynomials. To avoid the problem of intractability, we establish a trade off between accuracy and complexity. In particular, we develop a sequence of tractable optimization problems - in the form of Linear Programs (LPs) and/or Semi-Definite Programs (SDPs) - whose solutions converge to the exact solution of the NP-hard problem. However, the computational and memory complexity of these LPs and SDPs grow exponentially with the progress of the sequence - meaning ...

Contributors
Kamyar, Reza, Peet, Matthew, Berman, Spring, et al.
Created Date
2016

The Visceral Leishmaniasis (VL) is primarily endemic in five countries, with India and Sudan having the highest burden. The risk factors associated with VL are either unknown in some regions or vary drastically among empirical studies. Here, a dynamical model, motivated and informed by field data from the literature, is analyzed and employed to identify and quantify the impact of region dependent risks on the VL transmission dynamics. Parameter estimation procedures were developed using model-derived quantities and empirical data from multiple resources. The dynamics of VL depend on the estimates of the control reproductive number, RC, interpreted as the average ...

Contributors
Barley, Kamal Kevin, Castillo-Chavez, Carlos, Mubayi, Anuj, et al.
Created Date
2016

The dynamics of a fluid flow inside 2D square and 3D cubic cavities under various configurations were simulated and analyzed using a spectral code I developed. This code was validated against known studies in the 3D lid-driven cavity. It was then used to explore the various dynamical behaviors close to the onset of instability of the steady-state flow, and explain in the process the mechanism underlying an intermittent bursting previously observed. A fairly complete bifurcation picture emerged, using a combination of computational tools such as selective frequency damping, edge-state tracking and subspace restriction. The code was then used to investigate ...

Contributors
Wu, Ke, Lopez, Juan, Welfert, Bruno, et al.
Created Date
2019