Matching Items (157)
Description
Food insecurity is an economic and social condition involving limited or uncertain access to food. The problem of food insecurity in communities is influenced by economic conditions, food deserts, and barriers to accessing healthy food. Individuals experiencing food insecurity often endure concurrent problems of financial instability, hunger, and poor mental and physical health. Public and non-profit services in the U.S., such as the federally supported Supplemental Nutrition Assistance Program (SNAP) and community food banks, provide food-related assistance to individuals who are at a high risk of experiencing food insecurity. Unfortunately, many individuals who qualify for these services still experience food insecurity due to barriers preventing them from accessing food, which may include inadequate finances, transportation, skills, and information. Effective approaches for removing barriers that prevent individuals from accessing food are needed to mitigate the increased risk of hunger, nutritional deficiencies, and chronic disease among vulnerable populations. This dissertation tested a novel food insecurity intervention using informational nudges to promote food security through the elimination of information barriers to accessing food. The intervention used in this mixed-methods feasibility study consisted of informational nudges in the form of weekly text messages that were sent to food pantry clients experiencing food insecurity. The study aims were to test the efficacy and acceptability of the intervention by examining whether the informational nudges could enhance food pantry utilization, increase SNAP registration, and promote food security. Quantitative study results showed a lower prevalence of food insecurity in the intervention group than the control group. Qualitative findings revealed how the intervention group found the text messages to be helpful and informative. These study findings can enhance future food insecurity interventions aiming to eliminate barriers that prevent individuals who are food insecure from accessing healthy food.
ContributorsRoyer, Michael F. (Author) / Wharton, Christopher (Thesis advisor) / Buman, Matthew (Committee member) / Der Ananian, Cheryl (Committee member) / MacKinnon, David (Committee member) / Ohri-Vachaspati, Punam (Committee member) / Arizona State University (Publisher)
Created2023
Description
A notable challenge when assembling synthetic gene circuits is that modularity often fails to function as intended. A crucial underlying reason for this modularity failure is the existence of competition for shared and limited gene expression resources. By designing a synthetic cascading bistable switches (Syn-CBS) circuit in a single strain with two coupled self-activation modules to achieve successive cell fate transitions, nonlinear resource competition within synthetic gene circuits is unveiled. However, in vivo it can be seen that the transition path was redirected with the activation of one switch always prevailing over that of the other, contradictory to coactivation theoretically expected. This behavior is a result of resource competition between genes and follows a ‘winner-takes-all’ rule, where the winner is determined by the relative connection strength between the two modules. Despite investigation demonstrating that resource competition between gene modules can significantly alter circuit deterministic behaviors, how resource competition contributes to gene expression noise and how this noise can be controlled is still an open issue of fundamental importance in systems biology and biological physics. By utilizing a two-gene circuit, the effects of resource competition on protein expression noise levels can be closely studied. A surprising double-edged role is discovered: the competition for these resources decreases noise while the constraint on resource availability adds its own term of noise into the system, denoted “resource competitive” noise. Noise reduction effects are then studied using orthogonal resources. Results indicate that orthogonal resources are a good strategy for eliminating the contribution of resource competition to gene expression noise.
Noise propagation through a cascading circuit has been considered without resource competition. It has been noted that the noise from upstream genes can be transmitted downstream. However, resource competition’s effects on this cascading noise have yet to be studied. When studied, it is found that resource competition can induce stochastic state
switching and perturb noise propagation. Orthogonal resources can remove some of the resource competitive behavior and allow for a system with less noise.
ContributorsGoetz, Hanah Elizabeth (Author) / Tian, Xiaojun (Thesis advisor) / Wang, Xiao (Committee member) / Lai, Ying-Cheng (Committee member) / Arizona State University (Publisher)
Created2022
Description
A description of numerical and analytical work pertaining to models that describe the growth and progression of glioblastoma multiforme (GBM), an aggressive form of primary brain cancer. Two reaction-diffusion models are used: the Fisher-Kolmogorov-Petrovsky-Piskunov equation and a 2-population model that divides the tumor into actively proliferating and quiescent (or necrotic) cells. The numerical portion of this work (chapter 2) focuses on simulating GBM expansion in patients undergoing treatment for recurrence of tumor following initial surgery. The models are simulated on 3-dimensional brain geometries derived from magnetic resonance imaging (MRI) scans provided by the Barrow Neurological Institute. The study consists of 17 clinical time intervals across 10 patients that have been followed in detail, each of whom shows significant progression of tumor over a period of 1 to 3 months on sequential follow up scans. A Taguchi sampling design is implemented to estimate the variability of the predicted tumors to using 144 different choices of model parameters. In 9 cases, model parameters can be identified such that the simulated tumor contains at least 40 percent of the volume of the observed tumor. In the analytical portion of the paper (chapters 3 and 4), a positively invariant region for our 2-population model is identified. Then, a rigorous derivation of the critical patch size associated with the model is performed. The critical patch (KISS) size is the minimum habitat size needed for a population to survive in a region. Habitats larger than the critical patch size allow a population to persist, while smaller habitats lead to extinction. The critical patch size of the 2-population model is consistent with that of the Fisher-Kolmogorov-Petrovsky-Piskunov equation, one of the first reaction-diffusion models proposed for GBM. The critical patch size may indicate that GBM tumors have a minimum size depending on the location in the brain. A theoretical relationship between the size of a GBM tumor at steady-state and its maximum cell density is also derived, which has potential applications for patient-specific parameter estimation based on magnetic resonance imaging data.
ContributorsHarris, Duane C. (Author) / Kuang, Yang (Thesis advisor) / Kostelich, Eric J. (Thesis advisor) / Preul, Mark C. (Committee member) / Crook, Sharon (Committee member) / Gardner, Carl (Committee member) / Arizona State University (Publisher)
Created2023
Description
The most advanced social insects, the eusocial insects, form often large societies in which there is reproductive division of labor, queens and workers, have overlapping generations, and cooperative brood care where daughter workers remain in the nest with their queen mother and care for their siblings. The eusocial insects are composed of representative species of bees and wasps, and all species of ants and termites. Much is known about their organizational structure, but remains to be discovered.
The success of social insects is dependent upon cooperative behavior and adaptive strategies shaped by natural selection that respond to internal or external conditions. The objective of my research was to investigate specific mechanisms that have helped shaped the structure of division of labor observed in social insect colonies, including age polyethism and nutrition, and phenomena known to increase colony survival such as egg cannibalism. I developed various Ordinary Differential Equation (ODE) models in which I applied dynamical, bifurcation, and sensitivity analysis to carefully study and visualize biological outcomes in social organisms to answer questions regarding the conditions under which a colony can survive. First, I investigated how the population and evolutionary dynamics of egg cannibalism and division of labor can promote colony survival. I then introduced a model of social conflict behavior to study the inclusion of different response functions that explore the benefits of cannibalistic behavior and how it contributes to age polyethism, the change in behavior of workers as they age, and its biological relevance. Finally, I introduced a model to investigate the importance of pollen nutritional status in a honeybee colony, how it affects population growth and influences division of labor within the worker caste. My results first reveal that both cannibalism and division of labor are adaptive strategies that increase the size of the worker population, and therefore, the persistence of the colony. I show the importance of food collection, consumption, and processing rates to promote good colony nutrition leading to the coexistence of brood and adult workers. Lastly, I show how taking into account seasonality for pollen collection improves the prediction of long term consequences.
The success of social insects is dependent upon cooperative behavior and adaptive strategies shaped by natural selection that respond to internal or external conditions. The objective of my research was to investigate specific mechanisms that have helped shaped the structure of division of labor observed in social insect colonies, including age polyethism and nutrition, and phenomena known to increase colony survival such as egg cannibalism. I developed various Ordinary Differential Equation (ODE) models in which I applied dynamical, bifurcation, and sensitivity analysis to carefully study and visualize biological outcomes in social organisms to answer questions regarding the conditions under which a colony can survive. First, I investigated how the population and evolutionary dynamics of egg cannibalism and division of labor can promote colony survival. I then introduced a model of social conflict behavior to study the inclusion of different response functions that explore the benefits of cannibalistic behavior and how it contributes to age polyethism, the change in behavior of workers as they age, and its biological relevance. Finally, I introduced a model to investigate the importance of pollen nutritional status in a honeybee colony, how it affects population growth and influences division of labor within the worker caste. My results first reveal that both cannibalism and division of labor are adaptive strategies that increase the size of the worker population, and therefore, the persistence of the colony. I show the importance of food collection, consumption, and processing rates to promote good colony nutrition leading to the coexistence of brood and adult workers. Lastly, I show how taking into account seasonality for pollen collection improves the prediction of long term consequences.
ContributorsRodríguez Messan, Marisabel (Author) / Kang, Yun (Thesis advisor) / Castillo-Chavez, Carlos (Thesis advisor) / Kuang, Yang (Committee member) / Page Jr., Robert E (Committee member) / Gardner, Carl (Committee member) / Arizona State University (Publisher)
Created2018
Description
The role of climate change, as measured in terms of changes in the climatology of geophysical variables (such as temperature and rainfall), on the global distribution and burden of vector-borne diseases (VBDs) remains a subject of considerable debate. This dissertation attempts to contribute to this debate via the use of mathematical (compartmental) modeling and statistical data analysis. In particular, the objective is to find suitable values and/or ranges of the climate variables considered (typically temperature and rainfall) for maximum vector abundance and consequently, maximum transmission intensity of the disease(s) they cause.
Motivated by the fact that understanding the dynamics of disease vector is crucial to understanding the transmission and control of the VBDs they cause, a novel weather-driven deterministic model for the population biology of the mosquito is formulated and rigorously analyzed. Numerical simulations, using relevant weather and entomological data for Anopheles mosquito (the vector for malaria), show that maximum mosquito abundance occurs when temperature and rainfall values lie in the range [20-25]C and [105-115] mm, respectively.
The Anopheles mosquito ecology model is extended to incorporate human dynamics. The resulting weather-driven malaria transmission model, which includes many of the key aspects of malaria (such as disease transmission by asymptomatically-infectious humans, and enhanced malaria immunity due to repeated exposure), was rigorously analyzed. The model which also incorporates the effect of diurnal temperature range (DTR) on malaria transmission dynamics shows that increasing DTR shifts the peak temperature value for malaria transmission from 29C (when DTR is 0C) to about 25C (when DTR is 15C).
Finally, the malaria model is adapted and used to study the transmission dynamics of chikungunya, dengue and Zika, three diseases co-circulating in the Americas caused by the same vector (Aedes aegypti). The resulting model, which is fitted using data from Mexico, is used to assess a few hypotheses (such as those associated with the possible impact the newly-released dengue vaccine will have on Zika) and the impact of variability in climate variables on the dynamics of the three diseases. Suitable temperature and rainfall ranges for the maximum transmission intensity of the three diseases are obtained.
Motivated by the fact that understanding the dynamics of disease vector is crucial to understanding the transmission and control of the VBDs they cause, a novel weather-driven deterministic model for the population biology of the mosquito is formulated and rigorously analyzed. Numerical simulations, using relevant weather and entomological data for Anopheles mosquito (the vector for malaria), show that maximum mosquito abundance occurs when temperature and rainfall values lie in the range [20-25]C and [105-115] mm, respectively.
The Anopheles mosquito ecology model is extended to incorporate human dynamics. The resulting weather-driven malaria transmission model, which includes many of the key aspects of malaria (such as disease transmission by asymptomatically-infectious humans, and enhanced malaria immunity due to repeated exposure), was rigorously analyzed. The model which also incorporates the effect of diurnal temperature range (DTR) on malaria transmission dynamics shows that increasing DTR shifts the peak temperature value for malaria transmission from 29C (when DTR is 0C) to about 25C (when DTR is 15C).
Finally, the malaria model is adapted and used to study the transmission dynamics of chikungunya, dengue and Zika, three diseases co-circulating in the Americas caused by the same vector (Aedes aegypti). The resulting model, which is fitted using data from Mexico, is used to assess a few hypotheses (such as those associated with the possible impact the newly-released dengue vaccine will have on Zika) and the impact of variability in climate variables on the dynamics of the three diseases. Suitable temperature and rainfall ranges for the maximum transmission intensity of the three diseases are obtained.
ContributorsOkuneye, Kamaldeen O (Author) / Gumel, Abba B (Thesis advisor) / Kuang, Yang (Committee member) / Smith, Hal (Committee member) / Thieme, Horst (Committee member) / Nagy, John (Committee member) / Arizona State University (Publisher)
Created2018
Description
Longitudinal recursive partitioning (LRP) is a tree-based method for longitudinal data. It takes a sample of individuals that were each measured repeatedly across time, and it splits them based on a set of covariates such that individuals with similar trajectories become grouped together into nodes. LRP does this by fitting a mixed-effects model to each node every time that it becomes partitioned and extracting the deviance, which is the measure of node purity. LRP is implemented using the classification and regression tree algorithm, which suffers from a variable selection bias and does not guarantee reaching a global optimum. Additionally, fitting mixed-effects models to each potential split only to extract the deviance and discard the rest of the information is a computationally intensive procedure. Therefore, in this dissertation, I address the high computational demand, variable selection bias, and local optimum solution. I propose three approximation methods that reduce the computational demand of LRP, and at the same time, allow for a straightforward extension to recursive partitioning algorithms that do not have a variable selection bias and can reach the global optimum solution. In the three proposed approximations, a mixed-effects model is fit to the full data, and the growth curve coefficients for each individual are extracted. Then, (1) a principal component analysis is fit to the set of coefficients and the principal component score is extracted for each individual, (2) a one-factor model is fit to the coefficients and the factor score is extracted, or (3) the coefficients are summed. The three methods result in each individual having a single score that represents the growth curve trajectory. Therefore, now that the outcome is a single score for each individual, any tree-based method may be used for partitioning the data and group the individuals together. Once the individuals are assigned to their final nodes, a mixed-effects model is fit to each terminal node with the individuals belonging to it.
I conduct a simulation study, where I show that the approximation methods achieve the goals proposed while maintaining a similar level of out-of-sample prediction accuracy as LRP. I then illustrate and compare the methods using an applied data.
I conduct a simulation study, where I show that the approximation methods achieve the goals proposed while maintaining a similar level of out-of-sample prediction accuracy as LRP. I then illustrate and compare the methods using an applied data.
ContributorsStegmann, Gabriela (Author) / Grimm, Kevin (Thesis advisor) / Edwards, Michael (Committee member) / MacKinnon, David (Committee member) / McNeish, Daniel (Committee member) / Arizona State University (Publisher)
Created2019
Description
There is a need to reinvent evidence-based interventions (EBIs) for pediatric anxiety problems to better address the demands of real-word service delivery settings and achieve public health impact. The time- and resource-intensive nature of most EBIs for youth anxiety has frequently been noted as a barrier to the utilization of EBIs in community settings, leading to increased attention towards exploring the viability of briefer, more accessible protocols. Principally, this research reports between-group effect sizes from brief-interventions targeting pediatric anxiety and classifies each as well-established, probably efficacious, possibly efficacious, experimental, or questionable. brief interventions yielded an overall mean effect size of 0.19 on pediatric anxiety outcomes from pre to post. Effect sizes varied significantly by level of intervention: Pre to post-intervention effects were strongest for brief-treatments (0.35), followed by brief-targeted prevention (0.22), and weakest for brief-universal prevention (0.09). No participant or other intervention characteristic emerged as significant moderators of effect sizes. In terms of standard of evidence, one brief intervention is well-established, and five are probably efficacious, with most drawing on cognitive and behavioral change procedures and/or family systems models. At this juncture, the minimal intervention needed for clinical change in pediatric anxiety points to in-vivo exposures for specific phobias (~3 hours), cognitive-behavioral therapy (CBT) with social skills training (~3 hours), and CBT based parent training (~6 hours, eight digital modules with clinician support). This research concludes with a discussion on limitations to available brief EBIs, practice guidelines, and future research needed to capitalize on the viability of briefer protocols in enhancing access to, and impact of, evidence-based care in the real-world.
ContributorsStoll, Ryan (Author) / Pina, Armando A. (Thesis advisor) / Gonzales, Nancy (Committee member) / MacKinnon, David (Committee member) / Perez, Marisol (Committee member) / Arizona State University (Publisher)
Created2019
Description
Rabies is an infectious viral disease. It is usually fatal if a victim reaches the rabid stage, which starts after the appearance of disease symptoms. The disease virus attacks the central nervous system, and then it migrates from peripheral nerves to the spinal cord and brain. At the time when the rabies virus reaches the brain, the incubation period is over and the symptoms of clinical disease appear on the victim. From the brain, the virus travels via nerves to the salivary glands and saliva.
A mathematical model is developed for the spread of rabies in a spatially distributed fox population to model the spread of the rabies epizootic through middle Europe that occurred in the second half of the 20th century. The model considers both territorial and wandering rabid foxes and includes a latent period for the infection. Since the model assumes these two kinds of rabid foxes, it is a system of both partial differential and integral equations (with integration
over space and, occasionally, also over time). To study the spreading speeds of the rabies epidemic, the model is reduced to a scalar Volterra-Hammerstein integral equation, and space-time Laplace transform of the integral equation is used to derive implicit formulas for the spreading speed. The spreading speeds are discussed and implicit formulas are given for latent periods of fixed length, exponentially distributed length, Gamma distributed length, and log-normally distributed length. A number of analytic and numerical results are shown pertaining to the spreading speeds.
Further, a numerical algorithm is described for the simulation
of the spread of rabies in a spatially distributed fox population on a bounded domain with Dirichlet boundary conditions. I propose the following methods for the numerical approximation of solutions. The partial differential and integral equations are discretized in the space variable by central differences of second order and by
the composite trapezoidal rule. Next, the ordinary or delay differential equations that are obtained this way are discretized in time by explicit
continuous Runge-Kutta methods of fourth order for ordinary and delay differential systems. My particular interest
is in how the partition of rabid foxes into
territorial and diffusing rabid foxes influences
the spreading speed, a question that can be answered by purely analytic means only for small basic reproduction numbers. I will restrict the numerical analysis
to latent periods of fixed length and to exponentially
distributed latent periods.
The results of the numerical calculations
are compared for latent periods
of fixed and exponentially distributed length
and for various proportions of territorial
and wandering rabid foxes.
The speeds of spread observed in the
simulations are compared
to spreading speeds obtained by numerically solving the analytic formulas
and to observed speeds of epizootic frontlines
in the European rabies outbreak 1940 to 1980.
A mathematical model is developed for the spread of rabies in a spatially distributed fox population to model the spread of the rabies epizootic through middle Europe that occurred in the second half of the 20th century. The model considers both territorial and wandering rabid foxes and includes a latent period for the infection. Since the model assumes these two kinds of rabid foxes, it is a system of both partial differential and integral equations (with integration
over space and, occasionally, also over time). To study the spreading speeds of the rabies epidemic, the model is reduced to a scalar Volterra-Hammerstein integral equation, and space-time Laplace transform of the integral equation is used to derive implicit formulas for the spreading speed. The spreading speeds are discussed and implicit formulas are given for latent periods of fixed length, exponentially distributed length, Gamma distributed length, and log-normally distributed length. A number of analytic and numerical results are shown pertaining to the spreading speeds.
Further, a numerical algorithm is described for the simulation
of the spread of rabies in a spatially distributed fox population on a bounded domain with Dirichlet boundary conditions. I propose the following methods for the numerical approximation of solutions. The partial differential and integral equations are discretized in the space variable by central differences of second order and by
the composite trapezoidal rule. Next, the ordinary or delay differential equations that are obtained this way are discretized in time by explicit
continuous Runge-Kutta methods of fourth order for ordinary and delay differential systems. My particular interest
is in how the partition of rabid foxes into
territorial and diffusing rabid foxes influences
the spreading speed, a question that can be answered by purely analytic means only for small basic reproduction numbers. I will restrict the numerical analysis
to latent periods of fixed length and to exponentially
distributed latent periods.
The results of the numerical calculations
are compared for latent periods
of fixed and exponentially distributed length
and for various proportions of territorial
and wandering rabid foxes.
The speeds of spread observed in the
simulations are compared
to spreading speeds obtained by numerically solving the analytic formulas
and to observed speeds of epizootic frontlines
in the European rabies outbreak 1940 to 1980.
ContributorsAlanazi, Khalaf Matar (Author) / Thieme, Horst R. (Thesis advisor) / Jackiewicz, Zdzislaw (Committee member) / Baer, Steven (Committee member) / Gardner, Carl (Committee member) / Kuang, Yang (Committee member) / Smith, Hal (Committee member) / Arizona State University (Publisher)
Created2018
Description
Ideas from coding theory are employed to theoretically demonstrate the engineering of mutation-tolerant genes, genes that can sustain up to some arbitrarily chosen number of mutations and still express the originally intended protein. Attention is restricted to tolerating substitution mutations. Future advances in genomic engineering will make possible the ability to synthesize entire genomes from scratch. This presents an opportunity to embed desirable capabilities like mutation-tolerance, which will be useful in preventing cell deaths in organisms intended for research or industrial applications in highly mutagenic environments. In the extreme case, mutation-tolerant genes (mutols) can make organisms resistant to retroviral infections.
An algebraic representation of the nucleotide bases is developed. This algebraic representation makes it possible to convert nucleotide sequences into algebraic sequences, apply mathematical ideas and convert results back into nucleotide terms. Using the algebra developed, a mapping is found from the naturally-occurring codons to an alternative set of codons which makes genes constructed from them mutation-tolerant, provided no more than one substitution mutation occurs per codon. The ideas discussed naturally extend to finding codons that can tolerate t arbitrarily chosen number of mutations per codon. Finally, random substitution events are simulated in both a wild-type green fluorescent protein (GFP) gene and its mutol variant and the amino acid sequence expressed from each post-mutation is compared with the amino acid sequence pre-mutation.
This work assumes the existence of synthetic protein-assembling entities that function like tRNAs but can read k nucleotides at a time, with k greater than or equal to 5. The realization of this assumption is presented as a challenge to the research community.
An algebraic representation of the nucleotide bases is developed. This algebraic representation makes it possible to convert nucleotide sequences into algebraic sequences, apply mathematical ideas and convert results back into nucleotide terms. Using the algebra developed, a mapping is found from the naturally-occurring codons to an alternative set of codons which makes genes constructed from them mutation-tolerant, provided no more than one substitution mutation occurs per codon. The ideas discussed naturally extend to finding codons that can tolerate t arbitrarily chosen number of mutations per codon. Finally, random substitution events are simulated in both a wild-type green fluorescent protein (GFP) gene and its mutol variant and the amino acid sequence expressed from each post-mutation is compared with the amino acid sequence pre-mutation.
This work assumes the existence of synthetic protein-assembling entities that function like tRNAs but can read k nucleotides at a time, with k greater than or equal to 5. The realization of this assumption is presented as a challenge to the research community.
ContributorsAmpofo, Prince Kwame (Author) / Tian, Xiaojun (Thesis advisor) / Kiani, Samira (Committee member) / Kuang, Yang (Committee member) / Arizona State University (Publisher)
Created2019
Description
The research on the topology and dynamics of complex networks is one of the most focused area in complex system science. The goals are to structure our understanding of the real-world social, economical, technological, and biological systems in the aspect of networks consisting a large number of interacting units and to develop corresponding detection, prediction, and control strategies. In this highly interdisciplinary field, my research mainly concentrates on universal estimation schemes, physical controllability, as well as mechanisms behind extreme events and cascading failure for complex networked systems.
Revealing the underlying structure and dynamics of complex networked systems from observed data without of any specific prior information is of fundamental importance to science, engineering, and society. We articulate a Markov network based model, the sparse dynamical Boltzmann machine (SDBM), as a universal network structural estimator and dynamics approximator based on techniques including compressive sensing and K-means algorithm. It recovers the network structure of the original system and predicts its short-term or even long-term dynamical behavior for a large variety of representative dynamical processes on model and real-world complex networks.
One of the most challenging problems in complex dynamical systems is to control complex networks.
Upon finding that the energy required to approach a target state with reasonable precision
is often unbearably large, and the energy of controlling a set of networks with similar structural properties follows a fat-tail distribution, we identify fundamental structural ``short boards'' that play a dominant role in the enormous energy and offer a theoretical interpretation for the fat-tail distribution and simple strategies to significantly reduce the energy.
Extreme events and cascading failure, a type of collective behavior in complex networked systems, often have catastrophic consequences. Utilizing transportation and evolutionary game dynamics as prototypical
settings, we investigate the emergence of extreme events in simplex complex networks, mobile ad-hoc networks and multi-layer interdependent networks. A striking resonance-like phenomenon and the emergence of global-scale cascading breakdown are discovered. We derive analytic theories to understand the mechanism of
control at a quantitative level and articulate cost-effective control schemes to significantly suppress extreme events and the cascading process.
Revealing the underlying structure and dynamics of complex networked systems from observed data without of any specific prior information is of fundamental importance to science, engineering, and society. We articulate a Markov network based model, the sparse dynamical Boltzmann machine (SDBM), as a universal network structural estimator and dynamics approximator based on techniques including compressive sensing and K-means algorithm. It recovers the network structure of the original system and predicts its short-term or even long-term dynamical behavior for a large variety of representative dynamical processes on model and real-world complex networks.
One of the most challenging problems in complex dynamical systems is to control complex networks.
Upon finding that the energy required to approach a target state with reasonable precision
is often unbearably large, and the energy of controlling a set of networks with similar structural properties follows a fat-tail distribution, we identify fundamental structural ``short boards'' that play a dominant role in the enormous energy and offer a theoretical interpretation for the fat-tail distribution and simple strategies to significantly reduce the energy.
Extreme events and cascading failure, a type of collective behavior in complex networked systems, often have catastrophic consequences. Utilizing transportation and evolutionary game dynamics as prototypical
settings, we investigate the emergence of extreme events in simplex complex networks, mobile ad-hoc networks and multi-layer interdependent networks. A striking resonance-like phenomenon and the emergence of global-scale cascading breakdown are discovered. We derive analytic theories to understand the mechanism of
control at a quantitative level and articulate cost-effective control schemes to significantly suppress extreme events and the cascading process.
ContributorsChen, Yuzhong (Author) / Lai, Ying-Cheng (Thesis advisor) / Spanias, Andreas (Committee member) / Tepedelenlioğlu, Cihan (Committee member) / Ying, Lei (Committee member) / Arizona State University (Publisher)
Created2016