Related papers: Approximation of the average of some random matric…

We show that any big line bundle on a smooth projective variety admits a special Fujita approximation: the volume and the first Riemann-Roch coefficient are both approximated by those of ample $\mathbb{Q}$-line bundles on higher models.…

We introduce the notions of $\varepsilon$-approximate fixed point and weak $\varepsilon$-approximate fixed point. We show that for a group of unitary matrices even the existence of a nontrivial weak $\varepsilon$-approximate fixed point for…

Given $d \in \mathbb{N}$, we establish sum-product estimates for finite, non-empty subsets of $\mathbb{R}^d$. This is equivalent to a sum-product result for sets of diagonal matrices. In particular, let $A$ be a finite, non-empty set of $d…

In the Fermi Lectures on the obstacle problem in 1998, Caffarelli gave a proof of the mean value theorem which extends to general divergence form uniformly elliptic operators. In the general setting, the result shows that for any such…

We compute averages of products and ratios of characteristic polynomials associated with Orthogonal, Unitary, and Symplectic Ensembles of Random Matrix Theory. The pfaffian/determinantal formulas for these averages are obtained, and the…

We prove normal approximation bounds for statistics of randomly weighted (simplicial) complexes. In particular, we consider the complete $d$-dimensional complex on $n$ vertices with $d$-simplices equipped with i.i.d. weights. Our normal…

We extend the Matom\"{a}ki-Radziwi\l\l{} theorem to a large collection of unbounded multiplicative functions that are uniformly bounded, but not necessarily bounded by 1, on the primes. Our result allows us to estimate averages of such a…

Let A be an n by n matrix with determinant 1. We show that for all n > 2 there exist dimensional strictly positive constants C_n such that the average over the orthogonal group of log rho(A X) d X > C_n log ||A||, where ||A|| denotes the…

Let $U\subseteq\mathbb{R}^d$ be open and convex. We prove that every (not necessarily Lipschitz or strongly) convex function $f:U\to\mathbb{R}$ can be approximated by real analytic convex functions, uniformly on all of $U$. We also show…

We present an estimator of the covariance matrix $\Sigma$ of random $d$-dimensional vector from an i.i.d. sample of size $n$. Our sole assumption is that this vector satisfies a bounded $L^p-L^2$ moment assumption over its one-dimensional…

We study the problem of estimating the mean of a random vector in $\mathbb{R}^d$ based on an i.i.d.\ sample, when the accuracy of the estimator is measured by a general norm on $\mathbb{R}^d$. We construct an estimator (that depends on the…

A few matrix-vector multiplications with random vectors are often sufficient to obtain reasonably good estimates for the norm of a general matrix or the trace of a symmetric positive semi-definite matrix. Several such probabilistic…

The average properties of the well-known Subset Sum Problem can be studied by the means of its randomised version, where we are given a target value $z$, random variables $X_1, \ldots, X_n$, and an error parameter $\varepsilon > 0$, and we…

Randomized SVD has become an extremely successful approach for efficiently computing a low-rank approximation of matrices. In particular the paper by Halko, Martinsson, and Tropp (SIREV 2011) contains extensive analysis, and has made it a…

Let $\M$ be a type ${\rm II_1}$ factor and let $\tau$ be the faithful normal tracial state on $\M$. In this paper, we prove that given finite elements $X_1,\cdots X_n \in \M$, there is a finite decomposition of the identity into $N \in…

Let $U_c(H)={u: u is unitary and u-1 is compact}$ stand for the unitary Fredholm group. We prove the following convexity result. Denote by $d_\infty$ the rectifiable distance induced by the Finsler metric given by the operator norm in…

Using a recent Mergelyan type theorem, we show the existence of universal Taylor series on products of planar simply connected domains Oi that extend continuously on the product of the union of Oi with Si , where Si are subsets of the…

It is shown that at least 50% of the probability mass of a sum of independent Rademacher random variables is within one standard deviation from its mean. This lower bound is sharp, it is much better than for instance the bound that can be…

Mat\'ern covariance functions are ubiquitous in spatial statistics, valued for their interpretable parameters and well-understood sample path properties in Euclidean settings. This paper examines whether these desirable properties transfer…

Positive semi-definite matrices commonly occur as normal matrices of least squares problems in statistics or as kernel matrices in machine learning and approximation theory. They are typically large and dense. Thus algorithms to solve…