Adiabatic and stable adiabatic times Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/5x21th734

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • While the stability of time-homogeneous Markov chains have been extensively studied through the concept of mixing times, the stability of time-inhomogeneous Markov chains has not been studied as in depth. In this manuscript we will introduce special types of time-inhomogeneous Markov chains that are defined through an adiabatic transition. After doing this, we define the adiabatic and the stable adiabatic times as measures of stability these special time-inhomogeneous Markov chains. To construct an adiabatic transition one needs to make a transitioning convex combination of an initial and final probability transition matrix over the time interval [0, 1] for two time-homogeneous, discrete time, aperiodic and irreducible Markov chains. The adiabatic and stable adiabatic times depend on how this convex combinations transitions. In the most general setting, we suggested that as long as P : [0, 1] --> P[superscript ia][subscript n] is a Lipschitz continuous function with respect to the ‖ ·‖₁ matrix norm, then the adiabatic time is bounded above by a function of the mixing time of the final probability transition matrix [equation] For the stable adiabatic time, the most general result we achieved was for nonlinear adiabatic transitions P[subscript ø (t)] = (1-ø (t))P₀+ ø(t)P₁ where ø is a Lipschitz continuous functions that is piecewise defined over a finite partition of the interval [0, 1] so that on each subinterval ø is a bi-Lipschitz continuous function. In this setting we asymptotically bounded the stable adiabatic time by the largest mixing of P[subscript ø(t)] over all t∈[0, 1]. We found that [equation] We also have some additional results at bound the stable adiabatic time in this manuscript, but they are included to show the different attempts we took and highlight how important it is to pick the right variables to compare. We also provide examples to queueing and statistical mechanics.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Committee Member
Academic Affiliation
Non-Academic Affiliation
Keyword
Subject
Rights Statement
Peer Reviewed
Language
Replaces
Additional Information
  • description.provenance : Approved for entry into archive by Julie Kurtz(julie.kurtz@oregonstate.edu) on 2013-06-21T18:06:05Z (GMT) No. of bitstreams: 2 license_rdf: 1370 bytes, checksum: cd1af5ab51bcc7a5280cf305303530e9 (MD5) BradfordKyleB2013.pdf: 774689 bytes, checksum: b77e274b14e1f21ead49920b373be45f (MD5)
  • description.provenance : Made available in DSpace on 2013-07-03T18:33:59Z (GMT). No. of bitstreams: 2 license_rdf: 1370 bytes, checksum: cd1af5ab51bcc7a5280cf305303530e9 (MD5) BradfordKyleB2013.pdf: 774689 bytes, checksum: b77e274b14e1f21ead49920b373be45f (MD5) Previous issue date: 2013-05-15
  • description.provenance : Approved for entry into archive by Laura Wilson(laura.wilson@oregonstate.edu) on 2013-07-03T18:33:59Z (GMT) No. of bitstreams: 2 license_rdf: 1370 bytes, checksum: cd1af5ab51bcc7a5280cf305303530e9 (MD5) BradfordKyleB2013.pdf: 774689 bytes, checksum: b77e274b14e1f21ead49920b373be45f (MD5)
  • description.provenance : Submitted by Kyle Bradford (bradfork@onid.orst.edu) on 2013-06-21T17:40:33Z No. of bitstreams: 2 license_rdf: 1370 bytes, checksum: cd1af5ab51bcc7a5280cf305303530e9 (MD5) BradfordKyleB2013.pdf: 774689 bytes, checksum: b77e274b14e1f21ead49920b373be45f (MD5)

Relationships

In Administrative Set:
Last modified: 08/04/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items