Search

We present an algorithm for the numerical solution of ordinary differential equations by random enumeration of the Butcher trees used in the implementation of the Runge–Kutta method. Our Monte Carlo scheme allows for the direct numerical evaluation of an ODE solution at any given time within a certain interval, without iteration through multiple time steps. In particular, this approach does not involve a discretization step size, and it does not require the truncation of Taylor series. [ABSTRACT FROM AUTHOR]

The probability hypothesis density (PHD) filter, which is used for multi-target tracking based on sensor measurements, relies on the propagation of the first-order moment, or intensity function, of a point process. This algorithm assumes that targets behave independently, an hypothesis which may not hold in practice due to potential target interactions. In this paper, we construct a second-order PHD filter based on determinantal point processes which are able to model repulsion between targets. Such processes are characterized by their first- and second-order moments, which allows the algorithm to propagate variance and covariance information in addition to first-order target count estimates. Our approach relies on posterior moment formulas for the estimation of a general hidden point process after a thinning operation and a superposition with a Poisson point process, and on suitable approximation formulas in the determinantal point process setting. The repulsive properties of determinantal point processes apply to the modeling of negative correlation between distinct measurement domains. Monte Carlo simulations with correlation estimates are provided. [ABSTRACT FROM AUTHOR]

In this paper we provide a Monte Carlo algorithm for the density estimation of functionals of spatial point processes on Lipschitz domains with random marks, using the Malliavin calculus. Our method allows us to explicitly compute the Malliavin weight and is applied to density estimation of the interference in a wireless ad hoc network model. This extends and makes more precise, and under stronger assumptions, some recent results of Privault and Wei [J. Appl. Probab., 44 (2007), pp. 806-823], who dealt with the particular case of the half-line. [ABSTRACT FROM AUTHOR]

Abstract: The goal of this paper is to obtain probabilistic representation formulas that are suitable for the numerical computation of the (possibly non-continuous) density functions of infima of reserve processes commonly used in insurance. In particular we show, using Monte Carlo simulations, that these representation formulas perform better than standard finite difference methods. Our approach differs from Malliavin probabilistic representation formulas which generally require more smoothness on random variables and entail the continuity of their density functions. [Copyright &y& Elsevier]

We present a multidimensional deep learning implementation of a stochastic branching algorithm for the numerical solution of fully nonlinear PDEs. This approach is designed to tackle functional nonlinearities involving gradient terms of any orders, by combining the use of neural networks with a Monte Carlo branching algorithm. In comparison with other deep learning PDE solvers, it also allows us to check the consistency of the learned neural network function. Numerical experiments presented show that this algorithm can outperform deep learning approaches based on backward stochastic differential equations or the Galerkin method, and provide solution estimates that are not obtained by those methods in fully nonlinear examples. [ABSTRACT FROM AUTHOR]