Displaying similar documents to “A generalized dual maximizer for the Monge–Kantorovich transport problem”

A generalized dual maximizer for the Monge–Kantorovich transport problem

Mathias Beiglböck, Christian Léonard, Walter Schachermayer (2012)

ESAIM: Probability and Statistics

Similarity:

The dual attainment of the Monge–Kantorovich transport problem is analyzed in a general setting. The spaces are assumed to be polish and equipped with Borel probability measures and . The transport cost function :  ×  →  [0,∞]  is assumed to be Borel measurable. We show that a dual optimizer always exists, provided we interpret it as a projective limit of certain finitely additive measures. Our methods are functional analytic...

Trivial Cases for the Kantorovitch Problem

Serge Dubuc, Issa Kagabo, Patrice Marcotte (2010)

RAIRO - Operations Research

Similarity:

Let and be two compact spaces endowed with respective measures and satisfying the condition . Let be a continuous function on the product space . The mass transfer problem consists in determining a measure on whose marginals coincide with and , and such that the total cost be minimized. We first show that if the cost function is decomposable, i.e., can be represented as the sum of two continuous functions defined on and , respectively, then every feasible measure is optimal....

Means in complete manifolds: uniqueness and approximation

Marc Arnaudon, Laurent Miclo (2014)

ESAIM: Probability and Statistics

Similarity:

Let be a complete Riemannian manifold,  ∈ ℕ and  ≥ 1. We prove that almost everywhere on  = ( ,, ) ∈  for Lebesgue measure in , the measure μ ( x ) = N ∑ k = 1 N x k μ ( x ) = 1 N ∑ k = 1 N δ x k has a unique–mean (). As a consequence, if  = ( ,, ) is a -valued random variable with absolutely continuous law, then almost surely (()) has a unique –mean. In particular if ( ...

Pointwise constrained radially increasing minimizers in the quasi-scalar calculus of variations

Luís Balsa Bicho, António Ornelas (2014)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

We prove of vector minimizers () =  (||) to multiple integrals ∫ ((), |()|)  on a  ⊂ ℝ, among the Sobolev functions (·) in + (, ℝ), using a  : ℝ×ℝ → [0,∞] with (·) and . Besides such basic hypotheses, (·,·) is assumed to satisfy also...

Upper large deviations for maximal flows through a tilted cylinder

Marie Theret (2014)

ESAIM: Probability and Statistics

Similarity:

We consider the standard first passage percolation model in ℤ for  ≥ 2 and we study the maximal flow from the upper half part to the lower half part (respectively from the top to the bottom) of a cylinder whose basis is a hyperrectangle of sidelength proportional to and whose height is () for a certain height function . We denote this maximal flow by (respectively ). We emphasize the fact that the cylinder may be tilted. We look at the probability that...

Minimising convex combinations of low eigenvalues

Mette Iversen, Dario Mazzoleni (2014)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

We consider the variational problem         inf{ () +  () + (1 −  − ) () | Ω open in ℝ, || ≤ 1}, for  ∈ [0, 1],  +  ≤ 1, where () is the th eigenvalue of the Dirichlet Laplacian acting in () and || is the Lebesgue measure of . We investigate for which values of every minimiser is connected.

Survival probabilities of autoregressive processes

Christoph Baumgarten (2014)

ESAIM: Probability and Statistics

Similarity:

Given an autoregressive process of order (  =   + ··· +   +  where the random variables , ,... are i.i.d.), we study the asymptotic behaviour of the probability that the process does not exceed a constant barrier up to time (survival or persistence probability). Depending on the coefficients ,...,...

An Extended Opportunity-Based Age Replacement Policy

Bermawi P. Iskandar, Hiroaki Sandoh (2010)

RAIRO - Operations Research

Similarity:

The present study proposes an extended opportunity-based age replacement policy where opportunities occur according to a Poisson process. When the age, of the system satisfies for a prespecified value , a corrective replacement is conducted if the objective system fails. In case satisfies for another prespecified value , we take an opportunity to preventively replace the system by a new one with probability , and do not take the opportunity with probability . At the moment reaches...

Hydrodynamic limit of a d-dimensional exclusion process with conductances

Fábio Júlio Valentim (2012)

Annales de l'I.H.P. Probabilités et statistiques

Similarity:

Fix a polynomial of the form () = + ∑2≤≤    =1 with (1) gt; 0. We prove that the evolution, on the diffusive scale, of the empirical density of exclusion processes on 𝕋 d , with conductances given by special class of functions, is described by the unique weak solution of the non-linear parabolic partial differential equation = ∑    ...

Hereditary properties of words

József Balogh, Béla Bollobás (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

Let be a hereditary property of words, , an infinite class of finite words such that every subword (block) of a word belonging to is also in . Extending the classical Morse-Hedlund theorem, we show that either contains at least words of length for every  or, for some , it contains at most words of length for every . More importantly, we prove the following quantitative extension of this result: if has words of length then, for every , it contains at most ⌈( + 1)/2⌉⌈( + 1)/2⌈...

Convolutive decomposition and fast summation methods for discrete-velocity approximations of the Boltzmann equation

Clément Mouhot, Lorenzo Pareschi, Thomas Rey (2013)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

Similarity:

Discrete-velocity approximations represent a popular way for computing the Boltzmann collision operator. The direct numerical evaluation of such methods involve a prohibitive cost, typically ( ) where is the dimension of the velocity space. In this paper, following the ideas introduced in [C. Mouhot and L. Pareschi, 339 (2004) 71–76, C. Mouhot and L. Pareschi, 75 (2006) 1833–1852], we derive fast summation techniques for the evaluation of discrete-velocity schemes which...