Related papers: On the Convergence of Random Tridiagonal Matrices …
Non-Hermitian random matrices with statistical spectral characteristics beyond the standard Ginibre ensembles have recently emerged in the description of dissipative quantum many-body systems as well as in non-ergodic wave transport in…
In this paper we derive an explicit formula for the numerical range of (non-self-adjoint) tridiagonal random operators. As a corollary we obtain that the numerical range of such an operator is always the convex hull of its spectrum, this…
We introduce and study stochastic $N$-particle ensembles which are discretizations for general-$\beta$ log-gases of random matrix theory. The examples include random tilings, families of non-intersecting paths, $(z,w)$-measures, etc. We…
We consider symmetric and Hermitian random matrices whose entries are independent and symmetric random variables with an arbitrary variance pattern. Under a novel Short-to-Long Mixing condition, which is sharp in the sense that it precludes…
In this paper, we show that simple {Stochastic} subGradient Decent methods with multiple Restarting, named {\bf RSGD}, can achieve a \textit{linear convergence rate} for a class of non-smooth and non-strongly convex optimization problems…
This thesis is divided into three parts. The first part deals with cylindric plane partitions. The second with lambda-determinants and the third with commutators in semi-circular systems. For more detailed abstract please see inside.…
Random Matrix Theory (RMT) has successfully modeled diverse systems, from energy levels of heavy nuclei to zeros of $L$-functions. Many statistics in one can be interpreted in terms of quantities of the other; for example, zeros of…
In this paper we derive non-asymptotic Berry-Esseen bounds for Polyak-Ruppert averaged iterates of the Linear Stochastic Approximation (LSA) algorithm driven by the Markovian noise. Our analysis yields $\mathcal{O}(n^{-1/4})$ convergence…
Dual averaging and gradient descent with their stochastic variants stand as the two canonical recipe books for first-order optimization: Every modern variant can be viewed as a descendant of one or the other. In the convex regime, these…
Optimization is important in machine learning problems, and quasi-Newton methods have a reputation as the most efficient numerical schemes for smooth unconstrained optimization. In this paper, we consider the explicit superlinear…
This paper addresses two different but related questions regarding an unbounded symmetric tridiagonal operator: its self-adjointness and the approximation of its spectrum by the eigenvalues of its finite truncations. The sufficient…
In a recent work [DDRZ20], it has been developed a novel framework aimed at studying at a perturbative level a large class of non-linear, scalar, real, stochastic PDEs and inspired by the algebraic approach to quantum field theory. The main…
Recently, the supersymmetry method was extended from Gaussian ensembles to arbitrary unitarily invariant matrix ensembles by generalizing the Hubbard-Stratonovich transformation. Here, we complete this extension by including arbitrary…
This paper deals with measurable stationary symmetric stable random fields indexed by R^d and their relationship with the ergodic theory of nonsingular R^d-actions. Based on the phenomenal work of Rosinski(2000), we establish extensions of…
Gradient-based (a.k.a. `first order') optimization algorithms are routinely used to solve large scale non-convex problems. Yet, it is generally hard to predict their effectiveness. In order to gain insight into this question, we revisit the…
We derive semiclassical expressions for spectra, weighted by matrix elements of a Gaussian observable, relevant to a range of molecular and mesoscopic systems. We apply the formalism to the particular example of the resonant tunneling diode…
In this work, we study some statistical properties of the extreme eigenstates of the randomly-weighted adjacency matrices of random graphs. We focus on two random graph models: Erd\H{o}s-R\'{e}nyi (ER) graphs and random geometric graphs…
By means of an algebraic Bethe ansatz approach we study the Zamolodchikov-Fateev and Izergin-Korepin vertex models with non-diagonal boundaries, characterized by reflection matrices with an upper triangular form. Generalized Bethe vectors…
This paper presents an algorithmic method for generating random orthogonal matrices \(A\) that satisfy the property \(A^t S A = S\), where \(S\) is a fixed real invertible symmetric or skew-symmetric matrix. This method is significant as it…
We present large deviations principles for the moments of the empirical spectral measure of Wigner matrices and empirical measure of $\beta$-ensembles in three cases : the case of Wigner matrices without Gaussian tails, that is Wigner…