Searcharxiv⌕ Search

arXiv subjects

Ankush Agarwal

Publications and source records attributed to Ankush Agarwal.

23 records · Page 2Linked to original sources
arXiv2018

A Fourier-based Picard-iteration approach for a class of McKean-Vlasov SDEs with Lévy jumps

We consider a class of Lévy-driven stochastic differential equations (SDEs) with McKean-Vlasov (MK-V) interaction in the drift coefficient. It is assumed that the coefficient is bounded, affine in the state variable, and only measurable in the law of the solution. We study the equivalent functional fixed-point equation for the unknown time-dependent coefficients of the associated Markovian SDE. By proving a contraction property for the functional map in a suitable normed space, we infer existence and uniqueness results for the MK-V SDE, and derive a discretized Picard iteration scheme that approximates the law of the solution through its characteristic function. Numerical illustrations show the effectiveness of our method, which appears to be appropriate to handle the multi-dimensional setting.

math.PR↗
arXiv2018

Branching diffusion representation of semi-linear elliptic PDEs and estimation using Monte Carlo method

We study semi-linear elliptic PDEs with polynomial non-linearity and provide a probabilistic representation of their solution using branching diffusion processes. When the non-linearity involves the unknown function but not its derivatives, we extend previous results in the literature by showing that our probabilistic representation provides a solution to the PDE without assuming its existence. In the general case, we derive a new representation of the solution by using marked branching diffusion processes and automatic differentiation formulas to account for the non-linear gradient term. In both cases, we develop new theoretical tools to provide explicit sufficient conditions under which our probabilistic representations hold. As an application, we consider several examples including multi-dimensional semi-linear elliptic PDEs and estimate their solution by using the Monte Carlo method.

math.PR↗
arXiv2016

Portfolio Benchmarking under Drawdown Constraint and Stochastic Sharpe Ratio

We consider an investor who seeks to maximize her expected utility derived from her terminal wealth relative to the maximum performance achieved over a fixed time horizon, and under a portfolio drawdown constraint, in a market with local stochastic volatility (LSV). In the absence of closed-form formulas for the value function and optimal portfolio strategy, we obtain approximations for these quantities through the use of a coefficient expansion technique and nonlinear transformations. We utilize regularity properties of the risk tolerance function to numerically compute the estimates for our approximations. In order to achieve similar value functions, we illustrate that, compared to a constant volatility model, the investor must deploy a quite different portfolio strategy which depends on the current level of volatility in the stochastic volatility model.

q-fin.PM↗
arXiv2012

Efficient simulation of density and probability of large deviations of sum of random vectors using saddle point representations

We consider the problem of efficient simulation estimation of the density function at the tails, and the probability of large deviations for a sum of independent, identically distributed, light-tailed and non-lattice random vectors. The latter problem besides being of independent interest, also forms a building block for more complex rare event problems that arise, for instance, in queueing and financial credit risk modelling. It has been extensively studied in literature where state independent exponential twisting based importance sampling has been shown to be asymptotically efficient and a more nuanced state dependent exponential twisting has been shown to have a stronger bounded relative error property. We exploit the saddle-point based representations that exist for these rare quantities, which rely on inverting the characteristic functions of the underlying random vectors. These representations reduce the rare event estimation problem to evaluating certain integrals, which may via importance sampling be represented as expectations. Further, it is easy to identify and approximate the zero-variance importance sampling distribution to estimate these integrals. We identify such importance sampling measures and show that they possess the asymptotically vanishing relative error property that is stronger than the bounded relative error property. To illustrate the broader applicability of the proposed methodology, we extend it to similarly efficiently estimate the practically important expected overshoot of sums of iid random variables.

math.PR↗