Related papers: Anderson Localization for Radial Tree Graphs With …
We present results on the Anderson localization in a quasi one-dimensional metallic wire in the presence of magnetic impurities. We focus within the same numerical analysis on both the universal localized and metallic regimes, and we study…
We establish Anderson localization for general analytic $k$-frequency quasi-periodic operators on $\mathbb{Z}^d$ for \textit{arbitrary} $k,d$.
Nowadays a great attention has been focused on the discrete fractional Laplace operator as the natural counterpart of the continuous one. In this paper, we discretize the fractional Laplace operator $(-\Delta)^{s}$ for an arbitrary finite…
We prove the complete spectral and the strong dynamical Anderson localization in a two-particle random Schr\"odinger operators with the Poisson potential. The results apply with sufficiently weak interaction between the particle system.
In this work, we study the Anderson model on graphs with Ahlfors $\alpha$-regular volume growth. We show that, under mild regularity assumptions of the random distribution, Lifshitz-tail type estimates near the bottom of the spectrum lead…
Proofs of localization for random Schr\"odinger operators with sufficiently regular distribution of the potential can take advantage of the fractional moment method introduced by Aizenman-Molchanov, or use the classical Wegner estimate as…
The application of Renormalization Group (RG) methods to find perfect discretizations of partial differential equations is a promising but little investigated approach. We calculate the classically perfect fixed-point Laplace operator for…
We propose to observe Anderson localization of ultracold atoms in the presence of a random potential made of atoms of another species and trapped at the nodes of an optical lattice, with a filling factor less than unity. Such systems enable…
For random operators it is conjectured that spectral properties of an infinite-volume operator are related to the distribution of spectral gaps of finite-volume approximations. In particular, localization and pure point spectrum in infinite…
Many of the distributed localization algorithms are based on relaxed optimization formulations of the localization problem. These algorithms commonly rely on first-order optimization methods, and hence may require many iterations or…
It is classical, following Furstenberg's theorem on positive Lyapunov exponent for products of random SL$(2, \mathbb R)$ matrices, that the one dimensional random Schr\"odinger operator has Anderson localization at arbitrary disorder. This…
In this paper, we developed a new parametrization method to calculate the localization length in one-dimensional Anderson model with diagonal disorder. This method can avoid the divergence difficulty encountered in the conventional methods,…
The localization landscape gives direct access to the localization of bottom-of-band eigenstates in non-interacting disordered systems. We generalize this approach to eigenstates at arbitrary energies in systems with or without internal…
We show almost sure simplicity of eigenvalues for several models of Anderson-type random Schr\"odinger operators, extending methods introduced by Simon for the discrete Anderson model. These methods work throughout the spectrum and are not…
Anderson localization is a famous wave phenomenon that describes the absence of diffusion of waves in a disordered medium. Here we generalize the landscape theory of Anderson localization to general elliptic operators and complex boundary…
Anderson localization is a quantum phenomenon in which disorder localizes electronic wavefunctions. In this work, we propose a new approach to study Anderson localization based on the density matrix formalism. Drawing an analogy to the…
In this short note, we show that the continuous intrinsic graph Laplace operator with Gaussian kernel on a compact Riemannian manifold without boundary uniquely determines both the Riemannian metric and the sampling density, provided the…
We extend Edmonds' Branching Theorem to locally finite infinite digraphs. As examples of Oxley or Aharoni and Thomassen show, this cannot be done using ordinary arborescences, whose underlying graphs are trees. Instead we introduce the…
We prove Anderson localization (AL) and dynamical localization in expectation (EDL, also known as strong dynamical localization) for random CMV matrices for arbitrary distribution of i.i.d. Verblunsky coefficients.
Using recent results on uniform large deviation estimates for random matrix products obtained by S. Raman and the author, we prove localization for one dimensional Anderson models with heavy tails.