Related papers: Eigenvalue Statistics for higher rank Anderson mod…
The random connection model is a random graph whose vertices are given by the points of a Poisson process and whose edges are obtained by randomly connecting pairs of Poisson points in a position dependent but independent way. We study…
We report on recent results on the spectral statistics of the discrete Anderson model in the localized phase. Our results show, in particular, that, for the discrete Anderson Hamiltonian with smoothly distributed random potential at…
We consider eigenvalue problems for elliptic operators of arbitrary order $2m$ subject to Neumann boundary conditions on bounded domains of the Euclidean $N$-dimensional space. We study the dependence of the eigenvalues upon variations of…
A numerical study of Anderson transition on random regular graphs (RRG) with diagonal disorder is performed. The problem can be described as a tight-binding model on a lattice with N sites that is locally a tree with constant connectivity.…
We develop a new approach for the Anderson localization problem. The implementation of this method yields strong numerical evidence leading to a (surprising to many) conjecture: The two dimensional discrete random Schroedinger operator with…
We introduce a natural way to construct a random subset of a homogeneous Cantor set $C$ in $[0,1]$ via random labelings of an infinite $M$-ary tree, where $M\geq 2$. The Cantor set $C$ is the attractor of an equicontractive iterated…
Consider the Erd\H{o}s-Renyi random graph on n vertices where each edge is present independently with probability c/n, with c>0 fixed. For large n, a typical random graph locally behaves like a Galton-Watson tree with Poisson offspring…
We prove a probabilistic level-spacing estimate at the bottom of the spectrum for continuum alloy-type random Schr\"odinger operators, assuming sign-definiteness of a single-site bump function and absolutely continuous randomness. More…
It was shown in [J. A. Ram\'irez, B. Rider and B. Vir\'ag. J. Amer. Math. Soc. 24, 919-944 (2011)] that the edge of the spectrum of $\beta$ ensembles converges in the large $N$ limit to the bottom of the spectrum of the stochastic Airy…
We consider the Anderson model on the finite grid $G = \mathbb Z/L_1\mathbb Z\times\cdots\times\mathbb Z/L_d\mathbb Z$, defined by the random Hamiltonian $H_t=\Delta+tV$, where $\Delta$ is the discrete Laplacian and…
By using the method of orthogonal polynomials we analyze the statistical properties of complex eigenvalues of random matrices describing a crossover from Hermitian matrices characterized by the Wigner- Dyson statistics of real eigenvalues…
Motivated by applications of the discrete random Schr\"odinger operator, mathematical physicists and analysts, began studying more general Anderson-type Hamiltonians; that is, the family of self-adjoint operators $$H_\omega = H + V_\omega$$…
We give a general framework for approximations to combinatorial assemblies, especially suitable to the situation where the number $k$ of components is specified, in addition to the overall size $n$. This involves a Poisson process, which,…
As in random matrix theories, eigenvector/value distributions are important quantities of random tensors in their applications. Recently, real eigenvector/value distributions of Gaussian random tensors have been explicitly computed by…
In this paper we describe a strategy to study the Anderson model of an electron in a random potential at weak coupling by a renormalization group analysis. There is an interesting technical analogy between this problem and the theory of…
We study the bottom of the spectrum of the Anderson Hamiltonian $\mathcal{H}_L := -\partial_x^2 + \xi$ on $[0,L]$ driven by a white noise $\xi$ and endowed with either Dirichlet or Neumann boundary conditions. We show that, as…
We propose a wave operator method to calculate eigenvalues and eigenvectors of large parameter-dependent matrices, using an adaptative active subspace. We consider a hamiltonian which depends on external adjustable or adiabatic parameters,…
One of the most used approaches in simulating materials is the tight-binding approximation. When using this method in a material simulation, it is necessary to compute the eigenvalues and eigenvectors of the Hamiltonian describing the…
Via operator theoretic methods, we formalize the concentration phenomenon for a given observable `$r$' of a discrete time Markov chain with `$\mu_{\pi}$' as invariant ergodic measure, possibly having support on an unbounded state space. The…
The Anderson Hamiltonian $H_0=-\Delta+V(x,\omega)$ is considered, where $V$ is a random potential of Bernoulli type. The operator $H_0$ is perturbed by a non-random, continuous potential $-w(x) \leq 0$, decaying at infinity. It will be…