Searcharxiv⌕ Search

arXiv subjects

Giovanni Conforti

Publications and source records attributed to Giovanni Conforti.

49 records · Page 3Linked to original sources

Multi-marginal Schrodinger bridges

We consider the problem to identify the most likely flow in phase space, of (inertial) particles under stochastic forcing, that is in agreement with spatial (marginal) distributions that are specified at a set of points in time. The question raised generalizes the classical Schrodinger Bridge Problem (SBP) which seeks to interpolate two specified end-point marginal distributions of overdamped particles driven by stochastic excitation. While we restrict our analysis to second-order dynamics for the particles, the data represents partial (i.e., only positional) information on the flow at {\em multiple} time-points. The solution sought, as in SBP, represents a probability law on the space of paths this closest to a uniform prior while consistent with the given marginals. We approach this problem as an optimal control problem to minimize an action integral a la Benamou-Brenier, and derive a time-symmetric formulation that includes a Fisher information term on the velocity field. We underscore the relation of our problem to recent measure-valued splines in Wasserstein space, which is akin to that between SBP and Optimal Mass Transport (OMT). The connection between the two provides a Sinkhorn-like approach to computing measure-valued splines. We envision that interpolation between measures as sought herein will have a wide range of applications in signal/images processing as well as in data science in cases where data have a temporal dimension.

math.OC↗

A second order equation for Schrödinger bridges with applications to the hot gas experiment and entropic transportation cost

The \emph{Schrödinger problem} is obtained by replacing the mean square distance with the relative entropy in the Monge-Kantorovich problem. It was first addressed by Schrödinger as the problem of describing the most likely evolution of a large number of Brownian particles conditioned to reach an "unexpected configuration". Its optimal value, the \textit{entropic transportation cost}, and its optimal solution, the \textit{Schrödinger bridge}, stand as the natural probabilistic counterparts to the transportation cost and displacement interpolation. Moreover, they provide a natural way of lifting from the point to the measure setting the concept of Brownian bridge. In this article, we prove that the Schrödinger bridge solves a second order equation in the Riemannian structure of optimal transport. Roughly speaking, the equation says that its acceleration is the gradient of the Fisher information. Using this result, we obtain a fine quantitative description of the dynamics, and a new functional inequality for the entropic transportation cost, that generalize Talagrand's transportation inequality. Finally, we study the convexity of the Fisher information along Schrödigner bridges, under the hypothesis that the associated \textit{reciprocal characteristic} is convex. The techniques developed in this article are also well suited to study the \emph{Feynman-Kac penalisations} of Brownian motion.

math.PR↗

Conditioned point processes with application to Lévy bridges

Our first result concerns a characterisation by means of a functional equation of Poisson point processes conditioned by the value of their first moment. It leads to a generalised version of Mecke's formula. En passant, it also allows to gain quantitative results about stochastic domination for Poisson point processes under linear constraints. Since bridges of a pure jump Lévy process in $\mathbb{R}^d$ with a height $a$ can be interpreted as a Poisson point process on space-time conditioned by pinning its first moment to $a$, our approach allows us to characterize bridges of Lévy processes by means of a functional equation. The latter result has two direct applications: first we obtain a constructive and simple way to sample Lévy bridge dynamics; second it allows to estimate the number of jumps for such bridges. We finally show that our method remains valid for linearly perturbed Lévy processes like periodic Ornstein-Uhlenbeck processes driven by Lévy noise.

math.PR↗

Measure-valued spline curves: an optimal transport viewpoint

The aim of this article is to introduce and address the problem to smoothly interpolate (empirical) probability measures. To this end, we lift the concept of a spline curve from the setting of points in a Euclidean space that that of probability measures, using the framework of optimal transport.

math.OC↗

Extremal flows on Wasserstein space

We develop an intrinsic geometric approach to calculus of variations on Wasserstein space. We show that the flows associated to the Schroedinger bridge with general prior, to Optimal Mass Transport and to the Madelung fluid can all be characterized as annihilating the first variation of a suitable action. We then discuss the implications of this unified framework for stochastic mechanics: It entails, in particular, a sort of fluid-dynamic reconciliation between Bohm's and Nelson's stochastic mechanics.

math-ph↗

Approximating conditional distributions

In this article, we discuss the basic ideas of a general procedure to adapt the Stein-Chen method to bound the distance between conditional distributions. From an integration-by-parts formula (IBPF), we derive a Stein operator whose solution can be bounded, for example, via ad hoc couplings. This method provides quantitative bounds in several examples: the filtering equation, the distance between bridges of random walks and the distance between bridges and discrete schemes approximating them. Moreover, through the coupling construction for a certain class of random walk bridges we determine samplers, whose convergence to equilibrium is computed explicitly.

math.PR↗

Couplings, gradient estimates and logarithmic Sobolev inequality for Langevin bridges

In this paper we establish quantitative results about the bridges of the Langevin dynamics and the associated reciprocal processes. They include an equivalence between gradient estimates for bridge semigroups and couplings, comparison principles, bounds of the distance between bridges of different Langevin dynamics, and a Logarithmic Sobolev inequality for bridge measures. The existence of an invariant measure for the bridges is also discussed and quantitative bounds for the convergence to the invariant measure are proved . All results are based on a seemingly new expression of the drift of a bridge in terms of the reciprocal characteristic, which, roughly speaking, quantifies the " mean acceleration " of a bridge.

math.PR↗

Reciprocal classes of random walks on graphs

The reciprocal class of a Markov path measure is the set of all mixtures of its bridges. We give characterizations of the reciprocal class of a continuous-time Markov random walk on a graph. Our main result is in terms of some reciprocal characteristics whose expression only depends on the jump intensity. We also characterize the reciprocal class by means of Taylor expansions in small time of some conditional probabilities. Our measure-theoretical approach allows to extend significantly already known results on the subject. The abstract results are illustrated by several examples.

math.PR↗

Fluctuations of bridges, reciprocal characteristics, and concentration of measure

Conditions on the generator of a Markov process to control the fluctuations of its bridges are found. In particular, continuous time random walks on graphs and gradient diffusions are considered. Under these conditions, a concentration of measure inequality for the marginals of the bridge of a gradient diffusion and refined large deviation expansions for the tails of a random walk on a graph are derived. In contrast with the existing literature about bridges, all the estimates we obtain hold for non asymptotic time scales. New concentration of measure inequalities for pinned Poisson random vectors are also established. The quantities expressing our conditions are the so called \textit{reciprocal characteristics} associated with the Markov generator.

math.PR↗

Bridges of Markov counting processes: quantitative estimates

In this paper we investigate the behavior of the bridges of a Markov counting process in several directions. We first characterize convexity(concavity) in time of the mean value in terms of lower (upper) bounds on the so called \textit{reciprocal characteristics}. This result gives a natural criterion to determine whether bridges are "lazy" or "hurried". Under the hypothesis of global bounds on the reciprocal characteristics we prove sharp estimates for the marginal distributions and a comparison theorem for the jump times. When the height of the bridge tends to infinity we show the convergence to a deterministic curve, after a proper rescaling.

math.PR↗

On small-noise equations with degenerate limiting system arising from volatility models

The one-dimensional SDE with non Lipschitz diffusion coefficient $dX_{t} = b(X_{t})dt + σX_{t}^γ dB_{t}, \ X_{0}=x, \ γ<1$ is widely studied in mathematical finance. Several works have proposed asymptotic analysis of densities and implied volatilities in models involving instances of this equation, based on a careful implementation of saddle-point methods and (essentially) the explicit knowledge of Fourier transforms. Recent research on tail asymptotics for heat kernels [J-D. Deuschel, P.~Friz, A.~Jacquier, and S.~Violante. Marginal density expansions for diffusions and stochastic volatility, part II: Applications. 2013, arxiv:1305.6765] suggests to work with the rescaled variable $X^{\varepsilon}:=\varepsilon^{1/(1-γ)} X$: while allowing to turn a space asymptotic problem into a small-$\varepsilon$ problem with fixed terminal point, the process $X^{\varepsilon}$ satisfies a SDE in Wentzell--Freidlin form (i.e. with driving noise $\varepsilon dB$). We prove a pathwise large deviation principle for the process $X^{\varepsilon}$ as $\varepsilon \to 0$. As it will become clear, the limiting ODE governing the large deviations admits infinitely many solutions, a non-standard situation in the Wentzell--Freidlin theory. As for applications, the $\varepsilon$-scaling allows to derive exact log-asymptotics for path functionals of the process: while on the one hand the resulting formulae are confirmed by the CIR-CEV benchmarks, on the other hand the large deviation approach (i) applies to equations with a more general drift term and (ii) potentially opens the way to heat kernel analysis for higher-dimensional diffusions involving such an SDE as a component.

math.PR↗

Reciprocal class of jump processes

Processes having the same bridges as a given reference Markov process constitute its {\it reciprocal class}. In this paper we study the reciprocal class of compound Poisson processes whose jumps belong to a finite set $\mathcal{A} \subset \mathbb{R}^d$. We propose a characterization of the reciprocal class as the unique set of probability measures on which a family of time and space transformations induces the same density, expressed in terms of the \textit{reciprocal invariants}. The geometry of $\mathcal{A}$ plays a crucial role in the design of the transformations, and we use tools from discrete geometry to obtain an optimal characterization. We deduce explicit conditions for two Markov jump processes to belong to the same class. Finally, we provide a natural interpretation of the invariants as short-time asymptotics for the probability that the reference process makes a cycle around its current state.

math.PR↗