相关论文: Estimates for the asymptotic convergence factor of…

This paper studies the extreme gaps between eigenvalues of random matrices. We give the joint limiting law of the smallest gaps for Haar-distributed unitary matrices and matrices from the Gaussian unitary ensemble. In particular, the kth…

If a real harmonic function inside the open unit disk $B(0,1) \subset \mathbb{R}^2$ has its level set $\left\{x: u(x) = u(0)\right\}$ diffeomorphic to an interval, then we prove the sharp bound $\kappa \leq 8$ on the curvature of the level…

Given a quadruple of finite index subfactors we explicitly compute the Pimsner-Popa probabilistic constant for the pair of intermediate subfactors and relate it with the corresponding Connes-St{\o}rmer relative entropy between them. This…

A popular method in combinatorial optimization is to express polytopes P, which may potentially have exponentially many facets, as solutions of linear programs that use few extra variables to reduce the number of constraints down to a…

In many iterative optimization methods, fixed-point theory enables the analysis of the convergence rate via the contraction factor associated with the linear approximation of the fixed-point operator. While this factor characterizes the…

Let $p(z)$ be a monic polynomial of degree $n$, with complex coefficients, and let $q(z)$ be its monic factor. We prove an asymptotically sharp inequality of the form $\|q\|_{E} \le C^n \|p\|_E$, where $\|\cdot\|_E$ denotes the sup norm on…

A convenient framework for dealing with asymptotic limit problems of probabilistic nature is provided. These problems include questions such as finding the asymptotic proportion of terms of a sequence falling inside a given interval, or the…

This paper presents a lower bound for optimizing a finite sum of $n$ functions, where each function is $L$-smooth and the sum is $\mu$-strongly convex. We show that no algorithm can reach an error $\epsilon$ in minimizing all functions from…

We study sparse principal components analysis in the high-dimensional setting, where $p$ (the number of variables) can be much larger than $n$ (the number of observations). We prove optimal, non-asymptotic lower and upper bounds on the…

We provide several asymptotic expansions of the prime counting function $\pi(x)$ and related functions. We define an {\it asymptotic continued fraction expansion} of a complex-valued function of a real or complex variable to be a possibly…

In this article we present a new technique to obtain a lower bound for the principal Dirichlet eigenvalue of a fully nonlinear elliptic operator. We ilustrate the construction of an appropriate radial function required to obtain the bound…

We propose a general method for optimization with semi-infinite constraints that involve a linear combination of functions, focusing on the case of the exponential function. Each function is lower and upper bounded on sub-intervals by…

Let $j:V_\lambda---> V_\lambda$ be an elementary embedding, with critical point $\kappa$, and let $f(n)$ be the number of critical points of embeddings in the algebra generated by $j$ which lie between $j^n(\kappa)$ and $j^{n+1}(\kappa)$.…

We establish an upper bound on the asymptotic probability of an SLE(kappa) curve hitting two small intervals on the real line as the interval width goes to zero, for the range 4 < kappa < 8. As a consequence we are able to prove that the…

Consider the discrete maximal function acting on finitely supported functions on the integers, \[ \mathcal{C}_\Lambda f(n) := \sup_{\lambda \in \Lambda} | \sum_{p \in \pm \mathbb{P}} f(n-p) \log |p| \frac{e^{2\pi i \lambda p}}{p} |,\] where…

Uniform convergence rates are provided for asymptotic representations of sample extremes. These bounds which are universal in the sense that they do not depend on the extreme value index are meant to be extended to arbitrary samples…

In this article, we give an asymptotic bound for the exponential sum of the M\"obius function $\sum_{n \le x} \mu(n) e(\alpha n)$ for a fixed irrational number $\alpha\in\mathbb{R}$. This exponential sum was originally studied by Davenport…

Let $f$ be a nonincreasing function defined on $[0,1]$. Under standard regularity conditions, we derive the asymptotic distribution of the supremum norm of the difference between $f$ and its Grenander-type estimator on sub-intervals of…

The function $\inf_n nx^{1/n}$ has the asymptotics $eu+e d^2(u)/(2u)+O(1/u^2)$ as $x\to\infty$, where $u=\log x$ and $d(u)$ is the distance from $u$ to the nearest integer. We generalize this observation. First, the curves $y=nx^{1/n}$ can…

We propose an iterative estimating equations procedure for analysis of longitudinal data. We show that, under very mild conditions, the probability that the procedure converges at an exponential rate tends to one as the sample size…