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...
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...
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 , with conductances given by special class of functions, is described by the unique weak solution of the non-linear parabolic partial differential equation = ∑ ...
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⌈...
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 ) = 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 ( ...
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...
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....
Elena Di Bernardino, Thomas Laloë, Véronique Maume-Deschamps, Clémentine Prieur (2013)
ESAIM: Probability and Statistics
Similarity:
This paper deals with the problem of estimating the level sets () = {() ≥ }, with ∈ (0,1), of an unknown distribution function on ℝ . A plug-in approach is followed. That is, given a consistent estimator of , we estimate () by () = { () ≥ }. In our setting, non-compactness property is required for the level sets to estimate. We state consistency results with respect to the Hausdorff distance and the volume of the symmetric...
Sandrine Péché (2012)
Annales de l'I.H.P. Probabilités et statistiques
Similarity:
We consider complex sample covariance matrices = (1/)* where is a × random matrix with i.i.d. entries , 1 ≤ ≤ , 1 ≤ ≤ , with distribution . Under some regularity and decay assumptions on , we prove universality of some local eigenvalue statistics in the bulk of the spectrum in the limit where → ∞ and lim→∞ / = for any real number ∈ (0, ∞).
Frédéric Meunier (2013)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
A simple idea used in many combinatorial algorithms is the idea of . Originally, it comes from the method proposed by Gauss in the 19th century for solving systems of linear equations. This method had been extended in 1947 by Dantzig for the famous simplex algorithm used for solving linear programs. From since, a pivoting algorithm is a method exploring subsets of a ground set and going from one subset to a new one ′ by deleting an element inside and adding an element outside : ′ = ...
Z. Masáková, T. Vávra (2014)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
We consider numeration systems with base and − , for quadratic Pisot numbers and focus on comparing the combinatorial structure of the sets Z and Z of numbers with integer expansion in base , resp. − . Our main result is the comparison of languages of infinite words and coding the ordering of distances between consecutive - and (− )-integers. It turns out that for a class of roots of − − , the languages coincide, while for other...
Denis Belomestny (2010)
ESAIM: Probability and Statistics
Similarity:
Let () be independent identically distributed bivariate vectors and , are two linear forms with positive coefficients. We study two problems: under what conditions does the equidistribution of and imply the same property for and , and under what conditions does the independence of and entail independence of and ? Some analytical sufficient conditions...