arXiv Analytics

Sign in

arXiv:1711.06327 [math.OC]AbstractReferencesReviewsResources

Estimating stationary characteristic functions of stochastic systems via semidefinite programming

Khem Raj Ghusinga, Andrew Lamperski, Abhyudai Singh

Published 2017-11-16Version 1

This paper proposes a methodology to estimate characteristic functions of stochastic differential equations that are defined over polynomials and driven by L\'evy noise. For such systems, the time evolution of the characteristic function is governed by a partial differential equation; consequently, the stationary characteristic function can be obtained by solving an ordinary differential equation (ODE). However, except for a few special cases such as linear systems, the solution to the ODE consists of unknown coefficients. These coefficients are closely related with the stationary moments of the process, and bounds on these can be obtained by utilizing the fact that the characteristic function is positive definite. These bounds can be further used to find bounds on other higher order stationary moments and also estimate the stationary characteristic function itself. The method is finally illustrated via examples.

Related articles: Most relevant | Search more
arXiv:2305.12936 [math.OC] (Published 2023-05-22)
Entropy bounds for invariant measure perturbations in stochastic systems with uncertain noise
arXiv:2004.00424 [math.OC] (Published 2020-03-29)
Solving the inverse problem for an ordinary differential equation using conjugation
Alfaro Vigo et al.
arXiv:0709.2559 [math.OC] (Published 2007-09-17)
GloptiPoly 3: moments, optimization and semidefinite programming