Planar diagrams from optimization

We propose a new toy model of a heteropolymer chain capable of forming planar secondary structures typical for RNA molecules. In this model the sequential intervals between neighboring monomers along a chain are considered as quenched random variables. Using the optimization procedure for a special class of concave--type potentials, borrowed from optimal transport analysis, we derive the local difference equation for the ground state free energy of the chain with the planar (RNA--like) architecture of paired links. We consider various distribution functions of intervals between neighboring monomers (truncated Gaussian and scale--free) and demonstrate the existence of a topological crossover from sequential to essentially embedded (nested) configurations of paired links.Comment: 10 pages, 10 figures, the proof is added. arXiv admin note: text overlap with arXiv:1102.155

Local matching indicators for transport problems with concave costs

In this paper, we introduce a class of indicators that enable to compute efficiently optimal transport plans associated to arbitrary distributions of N demands and M supplies in R in the case where the cost function is concave. The computational cost of these indicators is small and independent of N. A hierarchical use of them enables to obtain an efficient algorithm

Ballistic deposition patterns beneath a growing KPZ interface

We consider a (1+1)-dimensional ballistic deposition process with next-nearest neighbor interaction, which belongs to the KPZ universality class, and introduce for this discrete model a variational formulation similar to that for the randomly forced continuous Burgers equation. This allows to identify the characteristic structures in the bulk of a growing aggregate ("clusters" and "crevices") with minimizers and shocks in the Burgers turbulence, and to introduce a new kind of equipped Airy process for ballistic growth. We dub it the "hairy Airy process" and investigate its statistics numerically. We also identify scaling laws that characterize the ballistic deposition patterns in the bulk: the law of "thinning" of the forest of clusters with increasing height, the law of transversal fluctuations of cluster boundaries, and the size distribution of clusters. The corresponding critical exponents are determined exactly based on the analogy with the Burgers turbulence and simple scaling considerations.Comment: 10 pages, 5 figures. Minor edits: typo corrected, added explanation of two acronyms. The text is essentially equivalent to version

Minimum-weight perfect matching for non-intrinsic distances on the line

Consider a real line equipped with a (not necessarily intrinsic) distance. We deal with the minimum-weight perfect matching problem for a complete graph whose points are located on the line and whose edges have weights equal to distances along the line. This problem is closely related to one-dimensional Monge-Kantorovich trasnport optimization. The main result of the present note is a "bottom-up" recursion relation for weights of partial minimum-weight matchings.Comment: 13 pages, figures in TiKZ, uses xcolor package; introduction and the concluding section have been expande

A Wasserstein approach to the one-dimensional sticky particle system

We present a simple approach to study the one-dimensional pressureless Euler system via adhesion dynamics in the Wasserstein space of probability measures with finite quadratic moments. Starting from a discrete system of a finite number of "sticky" particles, we obtain new explicit estimates of the solution in terms of the initial mass and momentum and we are able to construct an evolution semigroup in a measure-theoretic phase space, allowing mass distributions with finite quadratic moment and corresponding L^2-velocity fields. We investigate various interesting properties of this semigroup, in particular its link with the gradient flow of the (opposite) squared Wasserstein distance. Our arguments rely on an equivalent formulation of the evolution as a gradient flow in the convex cone of nondecreasing functions in the Hilbert space L^2(0,1), which corresponds to the Lagrangian system of coordinates given by the canonical monotone rearrangement of the measures.Comment: Added reference

A reconstruction of the initial conditions of the Universe by optimal mass transportation

Reconstructing the density fluctuations in the early Universe that evolved into the distribution of galaxies we see today is a challenge of modern cosmology [ref.]. An accurate reconstruction would allow us to test cosmological models by simulating the evolution starting from the reconstructed state and comparing it to the observations. Several reconstruction techniques have been proposed [8 refs.], but they all suffer from lack of uniqueness because the velocities of galaxies are usually not known. Here we show that reconstruction can be reduced to a well-determined problem of optimisation, and present a specific algorithm that provides excellent agreement when tested against data from N-body simulations. By applying our algorithm to the new redshift surveys now under way [ref.], we will be able to recover reliably the properties of the primeval fluctuation field of the local Universe and to determine accurately the peculiar velocities (deviations from the Hubble expansion) and the true positions of many more galaxies than is feasible by any other method. A version of the paper with higher-quality figures is available at http://www.obs-nice.fr/etc7/nature.pdfComment: Latex, 4 pages, 3 figure

Reconstructing the Initial Conditions of our Universe by Optimal Mass Transportation

Reconstructing the density fluctuations in the early Universe that evolved into the distribution of galaxies we see today is a challenge to modern cosmology. An accurate reconstruction would allow us to test cosmological models by simulating the evolution starting from the reconstructed primordial state and comparing it to observations. Several reconstruction techniques have been proposed, but they all suffer from lack of uniqueness because the velocities needed to produce a unique reconstruction usually are not known. Here we show that reconstruction can be reduced to a well-determined problem of optimization, and present a specific algorithm that provides excellent agreement when tested against data from N-body simulations. By applying our algorithm to the redshift surveys now under way, we will be able to recover reliably the properties of the primeval fluctuation field of the local Universe, and to determine accurately the peculiar velocities (deviations from the Hubble expansion) and the true positions of many more galaxies than is feasible by any other method