Searcharxiv⌕ Search

arXiv subjects

Benjamin Jourdain

Publications and source records attributed to Benjamin Jourdain.

At least 73 records · Page 4Linked to original sources
arXiv2015

Optimal scaling for the transient phase of the random walk Metropolis algorithm: The mean-field limit

We consider the random walk Metropolis algorithm on $\mathbb{R}^n$ with Gaussian proposals, and when the target probability measure is the $n$-fold product of a one-dimensional law. In the limit $n\to\infty$, it is well known (see [Ann. Appl. Probab. 7 (1997) 110-120]) that, when the variance of the proposal scales inversely proportional to the dimension $n$ whereas time is accelerated by the factor $n$, a diffusive limit is obtained for each component of the Markov chain if this chain starts at equilibrium. This paper extends this result when the initial distribution is not the target probability measure. Remarking that the interaction between the components of the chain due to the common acceptance/rejection of the proposed moves is of mean-field type, we obtain a propagation of chaos result under the same scaling as in the stationary case. This proves that, in terms of the dimension $n$, the same scaling holds for the transient phase of the Metropolis-Hastings algorithm as near stationarity. The diffusive and mean-field limit of each component is a diffusion process nonlinear in the sense of McKean. This opens the route to new investigations of the optimal choice for the variance of the proposal distribution in order to accelerate convergence to equilibrium (see [Optimal scaling for the transient phase of Metropolis-Hastings algorithms: The longtime behavior Bernoulli (2014) To appear]).

math.PR↗
arXiv2015

Reducing the debt : is it optimal to outsource an investment?

We deal with the problem of outsourcing the debt for a big investment, according two situations: either the firm outsources both the investment (and the associated debt) and the exploitation to a private consortium, or the firm supports the debt and the investment but outsources the exploitation. We prove the existence of Stackelberg and Nash equilibria between the firm and the private consortium, in both situations. We compare the benefits of these contracts. We conclude with a study of what happens in case of incomplete information, in the sense that the risk aversion coefficient of each partner may be unknown by the other partner.

math.PR↗
arXiv2015

Optimal transport bounds between the time-marginals of a multidimensional diffusion and its Euler scheme

In this paper, we prove that the time supremum of the Wasserstein distance between the time-marginals of a uniformly elliptic multidimensional diffusion with coefficients bounded together with their derivatives up to the order $2$ in the spatial variables and H{ö}lder continuous with exponent $γ$ with respect to the time variable and its Euler scheme with $N$ uniform time-steps is smaller than $C \left(1+\mathbf{1}\_{γ=1} \sqrt{\ln(N)}\right)N^{-γ}$. To do so, we use the theory of optimal transport. More precisely, we investigate how to apply the theory by Ambrosio, Gigli and Savar{é} to compute the time derivative of the Wasserstein distance between the time-marginals. We deduce a stability inequality for the Wasserstein distance which finally leads to the desired estimation.

math.PR↗
arXiv2015

A trajectorial interpretation of the dissipations of entropy and Fisher information for stochastic differential equations

The dissipation of general convex entropies for continuous time Markov processes can be described in terms of backward martingales with respect to the tail filtration. The relative entropy is the expected value of a backward submartingale. In the case of (non necessarily reversible) Markov diffusion processes, we use Girsanov theory to explicit the Doob-Meyer decomposition of this submartingale. We deduce a stochastic analogue of the well known entropy dissipation formula, which is valid for general convex entropies, including the total variation distance. Under additional regularity assumptions, and using Itô's calculus and ideas of Arnold, Carlen and Ju \cite{Arnoldcarlenju}, we obtain moreover a new Bakry Emery criterion which ensures exponential convergence of the entropy to $0$. This criterion is non-intrisic since it depends on the square root of the diffusion matrix, and cannot be written only in terms of the diffusion matrix itself. We provide examples where the classic Bakry Emery criterion fails, but our non-intrisic criterion applies without modifying the law of the diffusion process.

math.PR↗
arXiv2015

On the long time behavior of stochastic vortices systems

In this paper, we are interested in the long-time behaviour of stochastic systems of n interacting vortices: the position in R2 of each vortex evolves according to a Brownian motion and a drift summing the influences of the other vortices computed through the Biot and Savart kernel and multiplied by their respective vorticities. For fixed n, we perform the rescalings of time and space used successfully by Gallay and Wayne [5] to study the long-time behaviour of the vorticity formulation of the two dimensional incompressible Navier-Stokes equation, which is the limit as n $\rightarrow$ $\infty$ of the weighted empirical measure of the system under mean-field interaction. When all the vorticities share the same sign, the 2n-dimensional process of the rescaled positions of the vortices is shown to converge exponentially fast as time goes to infinity to some invariant measure which turns out to be Gaussian if all the vorticities are equal. In the particular case n = 2 of two vortices, we prove exponential convergence in law of the 4-dimensional process to an explicit random variable, whatever the choice of the two vorticities. We show that this limit law is not Gaussian when the two vorticities are not equal.

math.PR↗
arXiv2014

Optimal scaling for the transient phase of Metropolis Hastings algorithms: The longtime behavior

We consider the Random Walk Metropolis algorithm on $\mathbb{R}^n$ with Gaussian proposals, and when the target probability measure is the $n$-fold product of a one-dimensional law. It is well known (see Roberts et al. (Ann. Appl. Probab. 7 (1997) 110-120)) that, in the limit $n\to\infty$, starting at equilibrium and for an appropriate scaling of the variance and of the timescale as a function of the dimension $n$, a diffusive limit is obtained for each component of the Markov chain. In Jourdain et al. (Optimal scaling for the transient phase of the random walk Metropolis algorithm: The mean-field limit (2012) Preprint), we generalize this result when the initial distribution is not the target probability measure. The obtained diffusive limit is the solution to a stochastic differential equation nonlinear in the sense of McKean. In the present paper, we prove convergence to equilibrium for this equation. We discuss practical counterparts in order to optimize the variance of the proposal distribution to accelerate convergence to equilibrium. Our analysis confirms the interest of the constant acceptance rate strategy (with acceptance rate between $1/4$ and $1/3$) first suggested in Roberts et al. (Ann. Appl. Probab. 7 (1997) 110-120). We also address scaling of the Metropolis-Adjusted Langevin Algorithm. When starting at equilibrium, a diffusive limit for an optimal scaling of the variance is obtained in Roberts and Rosenthal (J. R. Stat. Soc. Ser. B. Stat. Methodol. 60 (1998) 255-268). In the transient case, we obtain formally that the optimal variance scales very differently in $n$ depending on the sign of a moment of the distribution, which vanishes at equilibrium. This suggest that it is difficult to derive practical recommendations for MALA from such asymptotic results.

stat.ME↗
arXiv2014

Capital distribution and portfolio performance in the mean-field Atlas model

We study a mean-field version of rank-based models of equity markets such as the Atlas model introduced by Fernholz in the framework of Stochastic Portfolio Theory. We obtain an asymptotic description of the market when the number of companies grows to infinity. Then, we discuss the long-term capital distribution. We recover the Pareto-like shape of capital distribution curves usually derived from empirical studies, and provide a new description of the phase transition phenomenon observed by Chatterjee and Pal. Finally, we address the performance of simple portfolio rules and highlight the influence of the volatility structure on the growth of portfolios.

q-fin.PM↗
arXiv2014

The small noise limit of order-based diffusion processes

We introduce order-based diffusion processes as the solutions to multidimensional stochastic differential equations, with drift coefficient depending only on the ordering of the coordinates of the process and diffusion matrix proportional to the identity. These processes describe the evolution of a system of Brownian particles moving on the real line with piecewise constant drifts, and are the natural generalization of the rank-based diffusion processes introduced in stochastic portfolio theory or in the probabilistic interpretation of nonlinear evolution equations. Owing to the discontinuity of the drift coefficient, the corresponding ordinary differential equations are ill-posed. Therefore, the small noise limit of order-based diffusion processes is not covered by the classical Freidlin-Wentzell theory. The description of this limit is the purpose of this article. We first give a complete analysis of the two-particle case. Despite its apparent simplicity, the small noise limit of such a system already exhibits various behaviours. In particular, depending on the drift coefficient, the particles can either stick into a cluster, the velocity of which is determined by elementary computations, or drift away from each other at constant velocity, in a random ordering. The persistence of randomness in the zero noise limit is of the very same nature as in the pioneering works by Veretennikov (Mat. Zametki, 1983) and Bafico and Baldi (Stochastics, 1981) concerning the so-called Peano phenomenon. In the case of rank-based processes, we use a simple convexity argument to prove that the small noise limit is described by the sticky particle dynamics introduced by Brenier and Grenier (SIAM J. Numer. Anal., 1998), where particles travel at constant velocity between collisions, at which they stick together. In the general case of order-based processes, we give a sufficient condition on the drift for all the particles to aggregate into a single cluster, and compute the velocity of this cluster. Our argument consists in turning the study of the small noise limit into the study of the long time behaviour of a suitably rescaled process, and then exhibiting a Lyapunov functional for this rescaled process.

math.PR↗
arXiv2013

Convergence of the Wang-Landau algorithm

We analyze the convergence properties of the Wang-Landau algorithm. This sampling method belongs to the general class of adaptive importance sampling strategies which use the free energy along a chosen reaction coordinate as a bias. Such algorithms are very helpful to enhance the sampling properties of Markov Chain Monte Carlo algorithms, when the dynamics is metastable. We prove the convergence of the Wang-Landau algorithm and an associated central limit theorem.

math.PR↗
arXiv2013

A remark on the optimal transport between two probability measures sharing the same copula

We are interested in the Wasserstein distance between two probability measures on $\R^n$ sharing the same copula $C$. The image of the probability measure $dC$ by the vectors of pseudo-inverses of marginal distributions is a natural generalization of the coupling known to be optimal in dimension $n=1$. It turns out that for cost functions $c(x,y)$ equal to the $p$-th power of the $L^q$ norm of $x-y$ in $\R^n$, this coupling is optimal only when $p=q$ i.e. when $c(x,y)$ may be decomposed as the sum of coordinate-wise costs.

math.PR↗
arXiv2013

Propagation of chaos for rank-based interacting diffusions and long time behaviour of a scalar quasilinear parabolic equation

We study a quasilinear parabolic Cauchy problem with a cumulative distribution function on the real line as an initial condition. We call 'probabilistic solution' a weak solution which remains a cumulative distribution function at all times. We prove the uniqueness of such a solution and we deduce the existence from a propagation of chaos result on a system of scalar diffusion processes, the interactions of which only depend on their ranking. We then investigate the long time behaviour of the solution. Using a probabilistic argument and under weak assumptions, we show that the flow of the Wasserstein distance between two solutions is contractive. Under more stringent conditions ensuring the regularity of the probabilistic solutions, we finally derive an explicit formula for the time derivative of the flow and we deduce the convergence of solutions to equilibrium.

math.PR↗
arXiv2011

High order discretization schemes for stochastic volatility models

In usual stochastic volatility models, the process driving the volatility of the asset price evolves according to an autonomous one-dimensional stochastic differential equation. We assume that the coefficients of this equation are smooth. Using Itô's formula, we get rid, in the asset price dynamics, of the stochastic integral with respect to the Brownian motion driving this SDE. Taking advantage of this structure, we propose - a scheme, based on the Milstein discretization of this SDE, with order one of weak trajectorial convergence for the asset price, - a scheme, based on the Ninomiya-Victoir discretization of this SDE, with order two of weak convergence for the asset price. We also propose a specific scheme with improved convergence properties when the volatility of the asset price is driven by an Orstein-Uhlenbeck process. We confirm the theoretical rates of convergence by numerical experiments and show that our schemes are well adapted to the multilevel Monte Carlo method introduced by Giles [2008a, 2008b].

math.PR↗
arXiv2011

Lévy flights in ecology

We are interested in modeling Darwinian evolution resulting from the interplay of phenotypic variation and natural selection through ecological interactions. The population is modeled as a stochastic point process whose generator captures the probabilistic dynamics over continuous time of birth, mutation, and death, as influenced by each individual's trait values, and interactions between individuals. An offspring usually inherits the trait values of her progenitor, except when a random mutation causes the offspring to take an instantaneous mutation step at birth to new trait values. In the case we are interested in, the probability distribution of mutations has a heavy tail and belongs to the domain of attraction of a stable law. We investigate the large-population limit with allometric demographies: larger populations made up of smaller individuals which reproduce and die faster, as is typical for micro-organisms. We show that depending on the allometry coefficient the limit behavior of the population process can be approximated by nonlinear Lévy flights of different nature: either deterministic, in the form of nonlocal fractional reaction-diffusion equations, or stochastic, as nonlinear super-processes with the underlying reaction and a fractional diffusion operator. These approximation results demonstrate the existence of such nontrivial fractional objects; their uniqueness is also proved.

math.PR↗
arXiv2010

Convergence of a stochastic particle approximation for fractional scalar conservation laws

We give a probabilistic numerical method for solving a partial differential equation with fractional diffusion and nonlinear drift. The probabilistic interpretation of this equation uses a system of particles driven by Lévy alpha-stable processes and interacting with their drift through their empirical cumulative distribution function. We show convergence to the solution for the associated Euler scheme.

math.PR↗
arXiv2010

Regularity of the Exercise Boundary for American Put Options on Assets with Discrete Dividends

We analyze the regularity of the optimal exercise boundary for the American Put option when the underlying asset pays a discrete dividend at a known time $t_d$ during the lifetime of the option. The ex-dividend asset price process is assumed to follow Black-Scholes dynamics and the dividend amount is a deterministic function of the ex-dividend asset price just before the dividend date. The solution to the associated optimal stopping problem can be characterised in terms of an optimal exercise boundary which, in contrast to the case when there are no dividends, may no longer be monotone. In this paper we prove that when the dividend function is positive and concave, then the boundary is non-increasing in a left-hand neighbourhood of $t_d$, and tends to $0$ as time tends to $t_d^-$ with a speed that we can characterize. When the dividend function is linear in a neighbourhood of zero, then we show continuity of the exercise boundary and a high contact principle in the left-hand neighbourhood of $t_d$. When it is globally linear, then right-continuity of the boundary and the high contact principle are proved to hold globally. Finally, we show how all the previous results can be extended to multiple dividend payment dates in that case.

q-fin.CP↗
arXiv2010

Convenient Multiple Directions of Stratification

This paper investigates the use of multiple directions of stratification as a variance reduction technique for Monte Carlo simulations of path-dependent options driven by Gaussian vectors. The precision of the method depends on the choice of the directions of stratification and the allocation rule within each strata. Several choices have been proposed but, even if they provide variance reduction, their implementation is computationally intensive and not applicable to realistic payoffs, in particular not to Asian options with barrier. Moreover, all these previously published methods employ orthogonal directions for multiple stratification. In this work we investigate the use of algorithms producing convenient directions, generally non-orthogonal, combining a lower computational cost with a comparable variance reduction. In addition, we study the accuracy of optimal allocation in terms of variance reduction compared to the Latin Hypercube Sampling. We consider the directions obtained by the Linear Transformation and the Principal Component Analysis. We introduce a new procedure based on the Linear Approximation of the explained variance of the payoff using the law of total variance. In addition, we exhibit a novel algorithm that permits to correctly generate normal vectors stratified along non-orthogonal directions. Finally, we illustrate the efficiency of these algorithms in the computation of the price of different path-dependent options with and without barriers in the Black-Scholes and in the Cox-Ingersoll-Ross markets.

q-fin.CP↗
arXiv2010

Exact retrospective Monte Carlo computation of arithmetic average Asian options

Taking advantage of the recent litterature on exact simulation algorithms (Beskos, Papaspiliopoulos and Roberts) and unbiased estimation of the expectation of certain fonctional integrals (Wagner, Beskos et al. and Fearnhead et al.), we apply an exact simulation based technique for pricing continuous arithmetic average Asian options in the Black and Scholes framework. Unlike existing Monte Carlo methods, we are no longer prone to the discretization bias resulting from the approximation of continuous time processes through discrete sampling. Numerical results of simulation studies are presented and variance reduction problems are considered.

q-fin.CP↗