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...
Francesco Ghiraldin (2014)
ESAIM: Control, Optimisation and Calculus of Variations
Similarity:
In this paper we consider a new kind of Mumford–Shah functional () for maps : ℝ → ℝ with ≥ . The most important novelty is that the energy features a singular set of codimension greater than one, defined through the theory of distributional jacobians. After recalling the basic definitions and some well established results, we prove an approximation property for the energy () −convergence, in the same spirit of the work by Ambrosio and Tortorelli [L....
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.
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....
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⌈...
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 = ∑ ...
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, ∞).
Tze Leng Lai, Qi-Man Shao, Qiying Wang (2011)
ESAIM: Probability and Statistics
Similarity:
Let be a Studentized U-statistic. It is proved that a Cramér type moderate deviation ( ≥ )/(1 − Φ()) → 1 holds uniformly in ∈ [0, ( )) when the kernel satisfies some regular conditions.
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 : ′ = ...
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 ( ...
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...
Alberto Bertoni, Maria Paola Bianchi, Flavi D’Alessandro (2012)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Let = { ∈ | () } be the language recognized by a formal series : → ℝ with isolated cut point . We provide new conditions that guarantee the regularity of the language in the case that is rational or is a Hadamard quotient of rational series. Moreover the decidability property of such conditions is investigated.
Alberto Carraro, Antonino Salibra (2012)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A closed -term is if, for any other closed term , the lambda theory generated by = is consistent. Recently, it has been introduced a general technique to prove the easiness of -terms through the semantical notion of simple easiness. Simple easiness implies easiness and allows to prove consistency results construction of suitable filter models of -calculus living in the category of complete partial orderings: given a simple easy term and an arbitrary closed term , it is possible to...
Gengsheng Wang, Yashan Xu (2014)
ESAIM: Control, Optimisation and Calculus of Variations
Similarity:
This paper studies the periodic feedback stabilization of the controlled linear time-periodic ordinary differential equation: () = ()() + ()(), ≥ 0, where [(·)(·)] is a -periodic pair, , (·) ∈ (ℝ; ℝ) and (·) ∈ (ℝ; ℝ) satisfy respectively ( + ) = () for a.e. ≥ 0 and ( + ) = () for a.e. ≥ 0. Two periodic stablization criteria for a -period pair [(·)(·)] are established. One is an analytic criterion which is related to the transformation over time associated...