On the Itô formula in a Banach space.
We consider n × n real symmetric and hermitian random matrices Hₙ that are sums of a non-random matrix and of mₙ rank-one matrices determined by i.i.d. isotropic random vectors with log-concave probability law and real amplitudes. This is an analog of the setting of Marchenko and Pastur [Mat. Sb. 72 (1967)]. We prove that if mₙ/n → c ∈ [0,∞) as n → ∞, and the distribution of eigenvalues of and the distribution of amplitudes converge weakly, then the distribution of eigenvalues of Hₙ converges...
In this work, we provide non-asymptotic bounds for the average speed of convergence of the empirical measure in the law of large numbers, in Wasserstein distance. We also consider occupation measures of ergodic Markov chains. One motivation is the approximation of a probability measure by finitely supported measures (the quantization problem). It is found that rates for empirical or occupation measures match or are close to previously known optimal quantization rates in several cases. This is notably...
This paper introduces the notion of pairwise and coordinatewise negative dependence for random vectors in Hilbert spaces. Besides giving some classical inequalities, almost sure convergence and complete convergence theorems are established. Some limit theorems are extended to pairwise and coordinatewise negatively dependent random vectors taking values in Hilbert spaces. An illustrative example is also provided.
We study the probability that two elements which are selected at random with replacement from a finite semigroup have the same right matrix.
For p ≤ n, let b1(n),...,bp(n) be independent random vectors in with the same distribution invariant by rotation and without mass at the origin. Almost surely these vectors form a basis for the Euclidean lattice they generate. The topic of this paper is the property of reduction of this random basis in the sense of Lenstra-Lenstra-Lovász (LLL). If is the basis obtained from b1(n),...,bp(n) by Gram-Schmidt orthogonalization, the quality of the reduction depends upon the sequence of ratios...
We present an approach that allows one to bound the largest and smallest singular values of an random matrix with iid rows, distributed according to a measure on that is supported in a relatively small ball and linear functionals are uniformly bounded in for some , in a quantitative (non-asymptotic) fashion. Among the outcomes of this approach are optimal estimates of not only in the case of the above mentioned measure, but also when the measure is log-concave or when it a product measure...