Publication

Stabilized Numerical Methods for Stochastic Differential Equations driven by Diffusion and Jump-Diffusion Processes

Related publications (53)

Feedback and Mediation in Causal Inference Illustrated by Stochastic Process Models

The concept of causality is naturally related to processes developing over time. Central ideas of causal inference like time-dependent confounding (feedback) and mediation should be viewed as dynamic concepts. We shall study these concepts in the context o ...

2018

On the Besov regularity of periodic Levy noises

Michaël Unser, Julien René Pierre Fageot, John Paul Ward

In this paper, we study the Besov regularity of Levy white noises on the d-dimensional torus. Due to their rough sample paths, the white noises that we consider are defined as generalized stochastic fields. We, initially, obtain regularity results for gene ...

Academic Press Inc Elsevier Science2017

Three- or Two-Stage Stochastic Market-Clearing Algorithm?

Farzaneh Abbaspourtorbati, Antonio J. Conejo

As the power industry considers moving from a deterministic paradigm to a stochastic one to clear the day-ahead market in systems with significant stochastic production, the following question arises: how should a stochastic clearing algorithm be formulate ...

Ieee-Inst Electrical Electronics Engineers Inc2017

MATHICSE Technical Report : Dimensionality reduction of parameter-dependent problems through proper orthogonal decomposition

Alfio Quarteroni, Andrea Manzoni, Federico Negri

The numerical solution of partial differential equations (PDEs) depending on para- metrized or random input data is computationally intensive. Reduced order modeling techniques, such as the reduced basis methods, have been developed to alleviate this compu ...

MATHICSE2016

Multi-index Monte Carlo: when sparsity meets sampling

Fabio Nobile

We propose and analyze a novel Multi Index Monte Carlo (MIMC) method for weak approximation of stochastic models that are described in terms of differential equations either driven by random measures or with random coefficients. The MIMC method is both a s ...

2016

Compressibility of Symmetric-α-Stable Processes

Michaël Unser, Julien René Pierre Fageot, John Paul Ward

Within a deterministic framework, it is well known that n-term wavelet approximation rates of functions can be deduced from their Besov regularity. We use this principle to determine approximation rates for symmetric-α-stable (SαS) stochastic processes. Fi ...

IEEE2015

Upper bounds for the reach-avoid probability via robust optimization

Maryam Kamgarpour, John Lygeros, Tyler Summers

We consider finite horizon reach-avoid problems for discrete time stochastic systems. Our goal is to construct upper bound functions for the reach-avoid probability by means of tractable convex optimization problems. We achieve this by restricting attentio ...

2015

Approximating Functions On Stratified Sets

We investigate smooth approximations of functions, with prescribed gradient behavior on a distinguished stratified subset of the domain. As an application, we outline how our results yield important consequences for a recently introduced class of stochasti ...

Amer Mathematical Soc2015

High order numerical approximation of the invariant measure of ergodic SDEs

Assyr Abdulle, Gilles Vilmart

We introduce new sufficient conditions for a numerical method to approximate with high order of accuracy the invariant measure of an ergodic system of stochastic differential equations, independently of the weak order of accuracy of the method. We then pre ...

Society for Industrial and Applied Mathematics2014

On the Connection between the Hamilton-Jacobi-Bellman and the Fokker-Planck Control Frameworks

Fabio Nobile

In the framework of stochastic processes, the connection between the dynamic programming scheme given by the Hamilton-Jacobi-Bellman equation and a recently proposed control approach based on the Fokker-Planck equation is discussed. Under appropriate assum ...

2014

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.