Fitting timeseries by continuoustime Markov chains: A quadratic programming approach
Abstract
Construction of stochastic models that describe the effective dynamics of observables of interest is an useful instrument in various fields of application, such as physics, climate science, and finance. We present a new technique for the construction of such models. From the timeseries of an observable, we construct a discreteintime Markov chain and calculate the eigenspectrum of its transition probability (or stochastic) matrix. As a next step we aim to find the generator of a continuoustime Markov chain whose eigenspectrum resembles the observed eigenspectrum as closely as possible, using an appropriate norm. The generator is found by solving a minimization problem: the norm is chosen such that the object function is quadratic and convex, so that the minimization problem can be solved using quadratic programming techniques. The technique is illustrated on various toy problems as well as on datasets stemming from simulations of molecular dynamics and of atmospheric flows.
 Authors:
 Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, New York, NY 10012 (United States). Email: crommelin@cims.nyu.edu
 Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, New York, NY 10012 (United States). Email: eve2@cims.nyu.edu
 Publication Date:
 OSTI Identifier:
 20840351
 Resource Type:
 Journal Article
 Resource Relation:
 Journal Name: Journal of Computational Physics; Journal Volume: 217; Journal Issue: 2; Other Information: DOI: 10.1016/j.jcp.2006.01.045; PII: S00219991(06)000404; Copyright (c) 2006 Elsevier Science B.V., Amsterdam, The Netherlands, All rights reserved; Country of input: International Atomic Energy Agency (IAEA)
 Country of Publication:
 United States
 Language:
 English
 Subject:
 71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS; MARKOV PROCESS; MINIMIZATION; MOLECULAR DYNAMICS METHOD; PROBABILITY; PROGRAMMING; SIMULATION
Citation Formats
Crommelin, D.T., and VandenEijnden, E. Fitting timeseries by continuoustime Markov chains: A quadratic programming approach. United States: N. p., 2006.
Web. doi:10.1016/j.jcp.2006.01.045.
Crommelin, D.T., & VandenEijnden, E. Fitting timeseries by continuoustime Markov chains: A quadratic programming approach. United States. doi:10.1016/j.jcp.2006.01.045.
Crommelin, D.T., and VandenEijnden, E. 2006.
"Fitting timeseries by continuoustime Markov chains: A quadratic programming approach". United States.
doi:10.1016/j.jcp.2006.01.045.
@article{osti_20840351,
title = {Fitting timeseries by continuoustime Markov chains: A quadratic programming approach},
author = {Crommelin, D.T. and VandenEijnden, E.},
abstractNote = {Construction of stochastic models that describe the effective dynamics of observables of interest is an useful instrument in various fields of application, such as physics, climate science, and finance. We present a new technique for the construction of such models. From the timeseries of an observable, we construct a discreteintime Markov chain and calculate the eigenspectrum of its transition probability (or stochastic) matrix. As a next step we aim to find the generator of a continuoustime Markov chain whose eigenspectrum resembles the observed eigenspectrum as closely as possible, using an appropriate norm. The generator is found by solving a minimization problem: the norm is chosen such that the object function is quadratic and convex, so that the minimization problem can be solved using quadratic programming techniques. The technique is illustrated on various toy problems as well as on datasets stemming from simulations of molecular dynamics and of atmospheric flows.},
doi = {10.1016/j.jcp.2006.01.045},
journal = {Journal of Computational Physics},
number = 2,
volume = 217,
place = {United States},
year = 2006,
month = 9
}

In this paper, we investigate an optimization problem for continuoustime Markov decision processes with both impulsive and continuous controls. We consider the socalled constrained problem where the objective of the controller is to minimize a total expected discounted optimality criterion associated with a cost rate function while keeping other performance criteria of the same form, but associated with different cost rate functions, below some given bounds. Our model allows multiple impulses at the same time moment. The main objective of this work is to study the associated linear program defined on a space of measures including the occupation measures ofmore »

Adiabatic condition and the quantum hitting time of Markov chains
We present an adiabatic quantum algorithm for the abstract problem of searching marked vertices in a graph, or spatial search. Given a random walk (or Markov chain) P on a graph with a set of unknown marked vertices, one can define a related absorbing walk P{sup '} where outgoing transitions from marked vertices are replaced by selfloops. We build a Hamiltonian H(s) from the interpolated Markov chain P(s)=(1s)P+sP{sup '} and use it in an adiabatic quantum algorithm to drive an initial superposition over all vertices to a superposition over marked vertices. The adiabatic condition implies that, for any reversible Markovmore » 
A fast quadratic programming approach for largescale reactive power optimization
A fast reactive power optimization method for largescale power systems has been developed in this paper. The method is fast and robust. The largescale power system is decomposed into subsystems. The subsystem solution is noniterative and it provides a suboptimal solution when constraints are violated. Results of applying this method to the IEEE 118 bus system and a sample 200 bus system indicate it can be used in realtime power system control. 
Filtering of FiniteState TimeNonhomogeneous Markov Processes, a Direct Approach
A filtering equation is derived for P(x{sub t}=x vertical bar y{sub s},s element of [0,t]) for a continuoustime finitestate twocomponent timenonhomogeneous cadlag Markov process z{sub t}=(x{sub t},y{sub t}) . The derivation is based on some new ideas in the filtering theory and does not require any knowledge of stochastic integration. 
Analytic derivative couplings in timedependent density functional theory: Quadratic response theory versus pseudowavefunction approach
We revisit the formalism for analytic derivative couplings between excited states in timedependent density functional theory (TDDFT). We derive and implement these couplings using quadratic response theory, then numerically compare this responsetheory formulation to couplings implemented previously based on a pseudowavefunction formalism and direct differentiation of the KohnSham determinant. Numerical results, including comparison to full configuration interaction calculations, suggest that the two approaches perform equally well for many molecular systems, provided that the underlying DFT method affords accurate potential energy surfaces. The response contributions are found to be important for certain systems with high symmetry, but can be calculated withmore »