Dans $L^2({ℝ}^d)$, nous démontrons un résultat de localisation exponentielle pour un opérateur de Schrödinger semi-classique à potentiel périodique perturbé par de petites perturbations aléatoires indépendantes identiquement distribuées placées au fond de chaque puits. Pour ce faire, on montre que notre opérateur, restreint à un intervalle d’énergie convenable, est unitairement équivalent à une matrice aléatoire infinie dont on contrôle bien les coefficients. Puis, pour ce type de matrices, on prouve un résultat...

We consider some random band matrices with band-width $N^{\mu }$ whose entries are independent random variables with distribution tail in $x^{-\alpha }$. We consider the largest eigenvalues and the associated eigenvectors and prove the following phase transition. On the one hand, when $\alpha lt;2(1+{\mu }^{-1})$, the largest eigenvalues have order $N^{(1+\mu )/\alpha }$, are asymptotically distributed as a Poisson process and their associated eigenvectors are essentially carried by two coordinates (this phenomenon has already been remarked for full matrices by Soshnikov...

We propose a new localization result for the leading eigenvalue and eigenvector of a symmetric matrix $A$. The result exploits the Frobenius inner product between $A$ and a given rank-one landmark matrix $X$. Different choices for $X$ may be used, depending on the problem under investigation. In particular, we show that the choice where $X$ is the all-ones matrix allows to estimate the signature of the leading eigenvector of $A$, generalizing previous results on Perron-Frobenius properties of matrices with...

Consider the $n\times n$ matrix with $(i,j)$’th entry $gcd(i,j)$. Its largest eigenvalue ${\lambda }_n$ and sum of entries $s_n$ satisfy ${\lambda }_n>s_n/n$. Because $s_n$ cannot be expressed algebraically as a function of $n$, we underestimate it in several ways. In examples, we compare the bounds so obtained with one another and with a bound from S. Hong, R. Loewy (2004). We also conjecture that ${\lambda }_n>6{\pi }^{-2}nlogn$ for all $n$. If $n$ is large enough, this follows from F. Balatoni (1969).