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...
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, ∞).
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 = ∑ ...
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...
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 ( ...
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...
Christiane Frougny, Zuzana Masáková, Edita Pelantová (2010)
RAIRO - Theoretical Informatics and Applications
Similarity:
We study the complexity of the infinite word associated with the Rényi expansion of in an irrational base . When is the golden ratio, this is the well known Fibonacci word, which is Sturmian, and of complexity . For such that is finite we provide a simple description of the structure of special factors of the word . When =1 we show that . In the cases when or max} we show that the first difference of the complexity function takes value in for every , and consequently we determine...
Xavier Gendre (2014)
ESAIM: Probability and Statistics
Similarity:
Let ∈ ℝ be a random vector with mean and covariance matrix where is some known × -matrix. We construct a statistical procedure to estimate as well as under moment condition on or Gaussian hypothesis. Both cases are developed for known or unknown . Our approach is free from any prior assumption on and is based on non-asymptotic model selection methods....
Arturo Carpi, Aldo de Luca (2010)
RAIRO - Theoretical Informatics and Applications
Similarity:
For any finite word on a finite alphabet, we consider the basic parameters and of defined as follows: is the minimal natural number for which has no right special factor of length and is the minimal natural number for which has no repeated suffix of length . In this paper we study the distributions of these parameters, here called characteristic parameters, among the words ...
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.
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...