{"id":{"repo_id":"houston","oai_identifier":"oai:uh-ir.tdl.org:10657/4758"},"canonical_url":"https://search.dev.ndltd.org/etd/houston/oai:uh-ir.tdl.org:10657/4758","repository":{"repo_id":"houston","name":"University of Houston","base_url":"https://uh-ir.tdl.org/server/oai/request"},"display":{"title":"Impact of Stochastic Transcriptional Delay on Gene Networks","abstract":"The creation of protein from DNA is a dynamic process consisting of numerous components that include transcription, translation and protein folding. Each of these components is further comprised of hundreds or thousands of sub-steps that must be completed before a fully mature protein is formed. Consequently, the time it takes to create a single protein depends on the number of steps in the reaction chain and the nature of each step. Instead of modeling each of these steps in detail, one way to account for these reactions in models of gene regulatory networks is to incorporate dynamical delay. The stochastic nature of the reactions necessary to produce protein leads to a waiting time that is randomly distributed, complicating simulation and analysis. We examine this problem using different examples and approaches. First, we describe how queueing theory can be used to examine the effects of such distributed delay on the propagation of information through transcriptionally regulated genetic networks. In an analytically tractable model we find that increasing the variance in protein production delay while holding the mean fixed increases signaling speed in transcriptional networks. The effect is confirmed in stochastic simulations, and we demonstrate its impact in several common transcriptional motifs. Next we examine how such delay affects bistable systems. We investigate several stochastic models of bistable gene networks and find that increasing delay dramatically increases the mean residence times near stable states. We show that this behavior can be explained using a non-Markovian, analytically tractable reduced model. Finally, we explore the relationship between delay birth-death processes and their appropriate approximating delay chemical Langevin equations. Simulations demonstrate that, if done correctly, a delay chemical Langevin approximation is accurate even at moderate system sizes. Together, these results provide a foundation for the implementation of detailed stochastic simulation algorithms in the study of the delay stochastic processes that model biochemical networks.","abstract_html":"The creation of protein from DNA is a dynamic process consisting of numerous components that include transcription, translation and protein folding. Each of these components is further comprised of hundreds or thousands of sub-steps that must be completed before a fully mature protein is formed. Consequently, the time it takes to create a single protein depends on the number of steps in the reaction chain and the nature of each step. Instead of modeling each of these steps in detail, one way to account for these reactions in models of gene regulatory networks is to incorporate dynamical delay. The stochastic nature of the reactions necessary to produce protein leads to a waiting time that is randomly distributed, complicating simulation and analysis. We examine this problem using different examples and approaches. First, we describe how queueing theory can be used to examine the effects of such distributed delay on the propagation of information through transcriptionally regulated genetic networks. In an analytically tractable model we find that increasing the variance in protein production delay while holding the mean fixed increases signaling speed in transcriptional networks. The effect is confirmed in stochastic simulations, and we demonstrate its impact in several common transcriptional motifs. Next we examine how such delay affects bistable systems. We investigate several stochastic models of bistable gene networks and find that increasing delay dramatically increases the mean residence times near stable states. We show that this behavior can be explained using a non-Markovian, analytically tractable reduced model. Finally, we explore the relationship between delay birth-death processes and their appropriate approximating delay chemical Langevin equations. Simulations demonstrate that, if done correctly, a delay chemical Langevin approximation is accurate even at moderate system sizes. Together, these results provide a foundation for the implementation of detailed stochastic simulation algorithms in the study of the delay stochastic processes that model biochemical networks.","abstract_has_math":false,"creators":["López Rodríguez, José Manuel 1986-"],"institution":"University of Houston","degree_name":"Doctor of Philosophy","degree_level":"Doctoral","degree_discipline":"Mathematics","degree_department":null,"school":null,"contributors":[],"advisors":["Josić, Krešimir"],"committee_chairs":[],"committee_members":["Ott, William","Kilpatrick, Zachary P.","Bennett, Matthew R."],"year":2014,"date_issued":"2014-08","date_published":"2014-08","updated_at":"2026-07-24T02:31:52Z","subjects":["Stochastic","Delay","Gene-networks"],"languages":["eng"],"rights":["The author of this work is the copyright owner. UH Libraries and the Texas Digital Library have their permission to store and provide access to this work. UH Libraries has secured permission to reproduce any and all previously published materials contained in the work. Further transmission, reproduction, or presentation of this work is prohibited except with permission of the author(s)."],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/10657/4758","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Josić, Krešimir"]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Ott, William","Kilpatrick, Zachary P.","Bennett, Matthew R."]},{"key":"dc:creator","label":"Author","values":["López Rodríguez, José Manuel 1986-"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2019-09-17T01:43:02Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2019-09-17T01:43:02Z"]},{"key":"dc:date.issued","label":"Date","values":["2014-08"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Doctoral"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Doctor of Philosophy"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Houston"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Stochastic","Delay","Gene-networks"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["The author of this work is the copyright owner. UH Libraries and the Texas Digital Library have their permission to store and provide access to this work. UH Libraries has secured permission to reproduce any and all previously published materials contained in the work. Further transmission, reproduction, or presentation of this work is prohibited except with permission of the author(s)."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/10657/4758"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["The creation of protein from DNA is a dynamic process consisting of numerous components that include transcription, translation and protein folding. Each of these components is further comprised of hundreds or thousands of sub-steps that must be completed before a fully mature protein is formed. Consequently, the time it takes to create a single protein depends on the number of steps in the reaction chain and the nature of each step. Instead of modeling each of these steps in detail, one way to account for these reactions in models of gene regulatory networks is to incorporate dynamical delay. The stochastic nature of the reactions necessary to produce protein leads to a waiting time that is randomly distributed, complicating simulation and analysis. We examine this problem using different examples and approaches. First, we describe how queueing theory can be used to examine the effects of such distributed delay on the propagation of information through transcriptionally regulated genetic networks. In an analytically tractable model we find that increasing the variance in protein production delay while holding the mean fixed increases signaling speed in transcriptional networks. The effect is confirmed in stochastic simulations, and we demonstrate its impact in several common transcriptional motifs. Next we examine how such delay affects bistable systems. We investigate several stochastic models of bistable gene networks and find that increasing delay dramatically increases the mean residence times near stable states. We show that this behavior can be explained using a non-Markovian, analytically tractable reduced model. Finally, we explore the relationship between delay birth-death processes and their appropriate approximating delay chemical Langevin equations. Simulations demonstrate that, if done correctly, a delay chemical Langevin approximation is accurate even at moderate system sizes. Together, these results provide a foundation for the implementation of detailed stochastic simulation algorithms in the study of the delay stochastic processes that model biochemical networks."]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Impact of Stochastic Transcriptional Delay on Gene Networks"]}]}],"canonical_facts":{"dc:contributor.advisor":["Josić, Krešimir"],"dc:contributor.committeemember":["Ott, William","Kilpatrick, Zachary P.","Bennett, Matthew R."],"dc:creator":["López Rodríguez, José Manuel 1986-"],"dc:date.accessioned":["2019-09-17T01:43:02Z"],"dc:date.available":["2019-09-17T01:43:02Z"],"dc:date.issued":["2014-08"],"dc:description.abstract":["The creation of protein from DNA is a dynamic process consisting of numerous components that include transcription, translation and protein folding. Each of these components is further comprised of hundreds or thousands of sub-steps that must be completed before a fully mature protein is formed. Consequently, the time it takes to create a single protein depends on the number of steps in the reaction chain and the nature of each step. Instead of modeling each of these steps in detail, one way to account for these reactions in models of gene regulatory networks is to incorporate dynamical delay. The stochastic nature of the reactions necessary to produce protein leads to a waiting time that is randomly distributed, complicating simulation and analysis. We examine this problem using different examples and approaches. First, we describe how queueing theory can be used to examine the effects of such distributed delay on the propagation of information through transcriptionally regulated genetic networks. In an analytically tractable model we find that increasing the variance in protein production delay while holding the mean fixed increases signaling speed in transcriptional networks. The effect is confirmed in stochastic simulations, and we demonstrate its impact in several common transcriptional motifs. Next we examine how such delay affects bistable systems. We investigate several stochastic models of bistable gene networks and find that increasing delay dramatically increases the mean residence times near stable states. We show that this behavior can be explained using a non-Markovian, analytically tractable reduced model. Finally, we explore the relationship between delay birth-death processes and their appropriate approximating delay chemical Langevin equations. Simulations demonstrate that, if done correctly, a delay chemical Langevin approximation is accurate even at moderate system sizes. Together, these results provide a foundation for the implementation of detailed stochastic simulation algorithms in the study of the delay stochastic processes that model biochemical networks."],"dc:format.mimetype":["application/pdf"],"dc:identifier.uri":["https://hdl.handle.net/10657/4758"],"dc:language.iso":["eng"],"dc:rights":["The author of this work is the copyright owner. UH Libraries and the Texas Digital Library have their permission to store and provide access to this work. UH Libraries has secured permission to reproduce any and all previously published materials contained in the work. Further transmission, reproduction, or presentation of this work is prohibited except with permission of the author(s)."],"dc:subject":["Stochastic","Delay","Gene-networks"],"dc:title":["Impact of Stochastic Transcriptional Delay on Gene Networks"],"thesis:degree_discipline":["Mathematics"],"thesis:degree_level":["Doctoral"],"thesis:degree_name":["Doctor of Philosophy"],"thesis:institution_name":["University of Houston"]},"updated_at":"2026-07-24T02:31:52Z"}