Multilevel monte carlo for cortical circuit models

Author(s):  
Zhuo-Cheng Xiao ◽  
Kevin K. Lin
2020 ◽  
Vol 26 (2) ◽  
pp. 131-161
Author(s):  
Florian Bourgey ◽  
Stefano De Marco ◽  
Emmanuel Gobet ◽  
Alexandre Zhou

AbstractThe multilevel Monte Carlo (MLMC) method developed by M. B. Giles [Multilevel Monte Carlo path simulation, Oper. Res. 56 2008, 3, 607–617] has a natural application to the evaluation of nested expectations {\mathbb{E}[g(\mathbb{E}[f(X,Y)|X])]}, where {f,g} are functions and {(X,Y)} a couple of independent random variables. Apart from the pricing of American-type derivatives, such computations arise in a large variety of risk valuations (VaR or CVaR of a portfolio, CVA), and in the assessment of margin costs for centrally cleared portfolios. In this work, we focus on the computation of initial margin. We analyze the properties of corresponding MLMC estimators, for which we provide results of asymptotic optimality; at the technical level, we have to deal with limited regularity of the outer function g (which might fail to be everywhere differentiable). Parallel to this, we investigate upper and lower bounds for nested expectations as above, in the spirit of primal-dual algorithms for stochastic control problems.


2021 ◽  
Vol 433 ◽  
pp. 110164
Author(s):  
S. Ben Bader ◽  
P. Benedusi ◽  
A. Quaglino ◽  
P. Zulian ◽  
R. Krause

2020 ◽  
Vol 26 (3) ◽  
pp. 193-203
Author(s):  
Shady Ahmed Nagy ◽  
Mohamed A. El-Beltagy ◽  
Mohamed Wafa

AbstractMonte Carlo (MC) simulation depends on pseudo-random numbers. The generation of these numbers is examined in connection with the Brownian motion. We present the low discrepancy sequence known as Halton sequence that generates different stochastic samples in an equally distributed form. This will increase the convergence and accuracy using the generated different samples in the Multilevel Monte Carlo method (MLMC). We compare algorithms by using a pseudo-random generator and a random generator depending on a Halton sequence. The computational cost for different stochastic differential equations increases in a standard MC technique. It will be highly reduced using a Halton sequence, especially in multiplicative stochastic differential equations.


2018 ◽  
Vol 40 (4) ◽  
pp. A2315-A2335 ◽  
Author(s):  
Jeremie Houssineau ◽  
Ajay Jasra ◽  
Sumeetpal S. Singh

2017 ◽  
Vol 14 (03) ◽  
pp. 415-454 ◽  
Author(s):  
Ujjwal Koley ◽  
Nils Henrik Risebro ◽  
Christoph Schwab ◽  
Franziska Weber

This paper proposes a finite difference multilevel Monte Carlo algorithm for degenerate parabolic convection–diffusion equations where the convective and diffusive fluxes are allowed to be random. We establish a notion of stochastic entropy solutions to these equations. Our chief goal is to efficiently compute approximations to statistical moments of these stochastic entropy solutions. To this end, we design a multilevel Monte Carlo method based on a finite volume scheme for each sample. We present a novel convergence rate analysis of the combined multilevel Monte Carlo finite volume method, allowing in particular for low [Formula: see text]-integrability of the random solution with [Formula: see text], and low deterministic convergence rates (here, the theoretical rate is [Formula: see text]). We analyze the design and error versus work of the multilevel estimators. We obtain that the maximal rate (based on optimizing possibly the pessimistic upper bounds on the discretization error) is obtained for [Formula: see text], for finite volume convergence rate of [Formula: see text]. We conclude with numerical experiments.


2013 ◽  
Vol 125 (3) ◽  
pp. 569-600 ◽  
Author(s):  
A. L. Teckentrup ◽  
R. Scheichl ◽  
M. B. Giles ◽  
E. Ullmann

Sign in / Sign up

Export Citation Format

Share Document