Searcharxiv⌕ Search

arXiv subjects

Xiaolu Tan

Publications and source records attributed to Xiaolu Tan.

50 records · Page 3Linked to original sources

On the monotonicity principle of optimal Skorokhod embedding problem

In this paper, we provide an alternative proof of the monotonicity principle for the optimal Skorokhod embedding problem established by Beiglböck, Cox and Huesmann. This principle presents a geometric characterization that reflects the desired optimality properties of Skorokhod embeddings. Our proof is based on the adaptation of the Monge-Kantorovich duality in our context together with a delicate application of the optional cross-section theorem and a clever conditioning argument.

math.PR↗

Optimal Skorokhod embedding under finitely-many marginal constraints

The Skorokhod embedding problem aims to represent a given probability measure on the real line as the distribution of Brownian motion stopped at a chosen stopping time. In this paper, we consider an extension of the optimal Skorokhod embedding problem to the case of finitely-many marginal constraints. Using the classical convex duality approach together with the optimal stopping theory, we obtain the duality results which are formulated by means of probability measures on an enlarged space. We also relate these results to the problem of martingale optimal transport under multiple marginal constraints.

math.PR↗

Tightness and duality of martingale transport on the Skorokhod space

The martingale optimal transport aims to optimally transfer a probability measure to another along the class of martingales. This problem is mainly motivated by the robust superhedging of exotic derivatives in financial mathematics, which turns out to be the corresponding Kantorovich dual. In this paper we consider the continuous-time martingale transport on the Skorokhod space of cadlag paths. Similar to the classical setting of optimal transport, we introduce different dual problems and establish the corresponding dualities by a crucial use of the S-topology and the dynamic programming principle.

math.PR↗

On the convergence of monotone schemes for path-dependent PDE

We propose a reformulation of the convergence theorem of monotone numerical schemes introduced by Zhang and Zhuo for viscosity solutions of path-dependent PDEs, which extends the seminal work of Barles and Souganidis on the viscosity solution of PDE. We prove the convergence theorem under conditions similar to those of the classical theorem in the work of Barles and Souganidis. These conditions are satisfied, to the best of our knowledge, by all classical monotone numerical schemes in the context of stochastic control theory. In particular, the paper provides a unified approach to prove the convergence of numerical schemes for non-Markovian stochastic control problems, second order BSDEs, stochastic differential games etc.

math.PR↗

Unbiased simulation of stochastic differential equations

We propose an unbiased Monte-Carlo estimator for $\mathbb{E}[g(X_{t_1}, \cdots, X_{t_n})]$, where $X$ is a diffusion process defined by a multi-dimensional stochastic differential equation (SDE). The main idea is to start instead from a well-chosen simulatable SDE whose coefficients are updated at independent exponential times. Such a simulatable process can be viewed as a regime-switching SDE, or as a branching diffusion process with one single living particle at all times. In order to compensate for the change of the coefficients of the SDE, our main representation result relies on the automatic differentiation technique induced by Bismu-Elworthy-Li formula from Malliavin calculus, as exploited by Fournié et al.(1999) for the simulation of the Greeks in financial applications. In particular, this algorithm can be considered as a variation of the (infinite variance) estimator obtained in Bally and Kohatsu-Higa [Section 6.1](2014) as an application of the parametrix method.

math.PR↗

Branching diffusion representation of semilinear PDEs and Monte Carlo approximation

We provide a representation result of parabolic semi-linear PD-Es, with polynomial nonlinearity, by branching diffusion processes. We extend the classical representation for KPP equations, introduced by Skorokhod (1964), Watanabe (1965) and McKean (1975), by allowing for polynomial nonlinearity in the pair $(u, Du)$, where $u$ is the solution of the PDE with space gradient $Du$. Similar to the previous literature, our result requires a non-explosion condition which restrict to "small maturity" or "small nonlinearity" of the PDE. Our main ingredient is the automatic differentiation technique as in Henry Labordere, Tan and Touzi (2015), based on the Malliavin integration by parts, which allows to account for the nonlinearities in the gradient. As a consequence, the particles of our branching diffusion are marked by the nature of the nonlinearity. This new representation has very important numerical implications as it is suitable for Monte Carlo simulation. Indeed, this provides the first numerical method for high dimensional nonlinear PDEs with error estimate induced by the dimension-free Central limit theorem. The complexity is also easily seen to be of the order of the squared dimension. The final section of this paper illustrates the efficiency of the algorithm by some high dimensional numerical experiments.

math.PR↗

Weak approximation of second-order BSDEs

We study the weak approximation of the second-order backward SDEs (2BSDEs), when the continuous driving martingales are approximated by discrete time martingales. We establish a convergence result for a class of 2BSDEs, using both robustness properties of BSDEs, as proved in Briand, Delyon and Mémin [Stochastic Process. Appl. 97 (2002) 229-253], and tightness of solutions to discrete time BSDEs. In particular, when the approximating martingales are given by some particular controlled Markov chains, we obtain several concrete numerical schemes for 2BSDEs, which we illustrate on specific examples.

math.PR↗

A general Doob-Meyer-Mertens decomposition for $g$-supermartingale systems

We provide a general Doob-Meyer decomposition for $g$-supermartingale systems, which does not require any right-continuity on the system. In particular, it generalizes the Doob-Meyer decomposition of Mertens (1972) for classical supermartingales, as well as Peng's (1999) version for right-continuous $g$-supermartingales. As examples of application, we prove an optional decomposition theorem for $g$-supermartingale systems, and also obtain a general version of the well-known dual formation for BSDEs with constraint on the gains-process, using very simple arguments.

math.PR↗

Optimal Skorokhod embedding given full marginals and Azema-Yor peacocks

We consider the optimal Skorokhod embedding problem (SEP) given full marginals over the time interval $[0,1]$. The problem is related to the study of extremal martingales associated with a peacock ("process increasing in convex order", by Hirsch, Profeta, Roynette and Yor). A general duality result is obtained by convergence techniques. We then study the case where the reward function depends on the maximum of the embedding process, which is the limit of the martingale transport problem studied in Henry-Labordere, Obloj, Spoida and Touzi. Under technical conditions, some explicit characteristics of the solutions to the optimal SEP as well as to its dual problem are obtained. We also discuss the associated martingale inequality.

math.PR↗

A pseudo-Markov property for controlled diffusion processes

In this note, we propose two different approaches to rigorously justify a pseudo-Markov property for controlled diffusion processes which is often (explicitly or implicitly) used to prove the dynamic programming principle in the stochastic control literature. The first approach develops a sketch of proof proposed by Fleming and Souganidis~\cite{fleming-souganidis}. The second approach is based on an enlargement of the original state space and a controlled martingale problem. We clarify some measurability and topological issues raised by these two approaches.

math.PR↗

Discrete-time probabilistic approximation of path-dependent stochastic control problems

We give a probabilistic interpretation of the Monte Carlo scheme proposed by Fahim, Touzi and Warin [Ann. Appl. Probab. 21 (2011) 1322-1364] for fully nonlinear parabolic PDEs, and hence generalize it to the path-dependent (or non-Markovian) case for a general stochastic control problem. A general convergence result is obtained by a weak convergence method in the spirit of Kushner and Dupuis [Numerical Methods for Stochastic Control Problems in Continuous Time (1992) Springer]. We also get a rate of convergence using the invariance principle technique as in Dolinsky [Electron. J. Probab. 17 (2012) 1-5], which is better than that obtained by viscosity solution method. Finally, by approximating the conditional expectations arising in the numerical scheme with simulation-regression method, we obtain an implementable scheme.

math.PR↗

A numerical algorithm for a class of BSDEs via branching process

We generalize the algorithm for semi-linear parabolic PDEs in Henry-Labordère (2012) to the non-Markovian case for a class of Backward SDEs (BSDEs). By simulating the branching process, the algorithm does not need any backward regression. To prove that the numerical algorithm converges to the solution of BSDEs, we use the notion of viscosity solution of path dependent PDEs introduced by Ekren, Keller, Touzi and Zhang (2012) and extended in Ekren, Touzi and Zhang (2013).

math.NA↗

Capacities, Measurable Selection and Dynamic Programming Part I: Abstract Framework

We give a brief presentation of the capacity theory and show how it derives naturally a measurable selection theorem following the approach of Dellacherie (1972). Then we present the classical method to prove the dynamic programming of discrete time stochastic control problem, using measurable selection arguments. At last, we propose a continuous time extension, that is an abstract framework for the continuous time dynamic programming principle (DPP).

math.OC↗

Optimal transportation under controlled stochastic dynamics

We consider an extension of the Monge-Kantorovitch optimal transportation problem. The mass is transported along a continuous semimartingale, and the cost of transportation depends on the drift and the diffusion coefficients of the continuous semimartingale. The optimal transportation problem minimizes the cost among all continuous semimartingales with given initial and terminal distributions. Our first main result is an extension of the Kantorovitch duality to this context. We also suggest a finite-difference scheme combined with the gradient projection algorithm to approximate the dual value. We prove the convergence of the scheme, and we derive a rate of convergence. We finally provide an application in the context of financial mathematics, which originally motivated our extension of the Monge-Kantorovitch problem. Namely, we implement our scheme to approximate no-arbitrage bounds on the prices of exotic options given the implied volatility curve of some maturity.

math.PR↗