Quantifying Flows in Time-Irreversible Markov Chains

dc.contributor.advisorCameron, Mariaen_US
dc.contributor.authorMiddlebrooks, Danielle J.en_US
dc.contributor.departmentApplied Mathematics and Scientific Computationen_US
dc.contributor.publisherDigital Repository at the University of Marylanden_US
dc.contributor.publisherUniversity of Maryland (College Park, Md.)en_US
dc.date.accessioned2020-07-08T05:39:46Z
dc.date.available2020-07-08T05:39:46Z
dc.date.issued2020en_US
dc.description.abstractStochastic networks a.k.a. Markov chains allow us to model phenomena in systems arising in many applications. The appeal of stochastic networks is that they offer a mathematically tractable and robust model focused on the most important features of the system. Nevertheless, stochastic networks approximating complex systems can be huge and unstructured, and an effective description of their dynamics is a challenging mathematical problem. This dissertation is motivated by our study of two models of a gene regulatory network (GRN), one deterministic [1] and one stochastic [2], which describes the budding yeast cell cycle. A GRN with N nodes can be straightforwardly converted into a Markov chain with 2^N states. Our scientific goal is to understand how the stochasticity affects the stability of the cell cycle in the GRN. This gives rise to our mathematical goal: to develop efficient tools for quantifying dynamics of large time-irreversible Markov chains. Our methodological developments are built upon the transition path theory (TPT) [16] which is a general framework for describing transitions in Markov chains between two subsets of states. In TPT, the transition process is described by the so- called effective current. We have realized that the effective current gives a lopsided description of the transition process in the case of time-irreversible networks where elementary cycles of length greater than two are present. Thus, we have introduced the so-called acyclic current that gives a quantitative description of a transition process and proposed an algorithm to compute it. Moreover, we have developed a general recipe to modify the generator matrix of a given Markov chain in order to make the stationary probability current and the invariant distribution in the modified chain coincide with a desired current and a desired invariant distribution in the original chain. Finally, we have applied these tools to the budding yeast cell cycle GRN. Our results show which edges are essential and which ones are redundant. Our computations eloquently demonstrate that stochasticity makes the GRN much more stable with respect to edge removals. This conclusion is consistent with Q. Nie’s statement [26] that stochasticity plays a fundamental role in biological processes.en_US
dc.identifierhttps://doi.org/10.13016/ie95-x5ne
dc.identifier.urihttp://hdl.handle.net/1903/26112
dc.language.isoenen_US
dc.subject.pqcontrolledApplied mathematicsen_US
dc.subject.pquncontrolledGene Regulatory Networken_US
dc.subject.pquncontrolledMarkov Chainsen_US
dc.subject.pquncontrolledReactive Trajectoryen_US
dc.subject.pquncontrolledTransition Path Theoryen_US
dc.titleQuantifying Flows in Time-Irreversible Markov Chainsen_US
dc.typeDissertationen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Middlebrooks_umd_0117E_20756.pdf
Size:
6.86 MB
Format:
Adobe Portable Document Format