Related papers: Mobility Edge for the Anderson Model on Random Reg…
Statistical physics models with hard constraints, such as the discrete hard-core gas model (random independent sets in a graph), are inherently combinatorial and present the discrete mathematician with a relatively comfortable setting for…
We prove spectral and dynamical localization for Anderson models on locally finite graphs using the fractional moment method. Our theorems extend earlier results on localization for the Anderson model on $\ZZ^d$. We establish geometric…
A new type of perturbation expansion in the mixing $V$ of localized orbitals with a conduction-electron band in the $U\to\infty$ Anderson model is presented. It is built on Feynman diagrams obeying standard rules. The local correlations of…
We study preferential attachment mechanisms in random graphs that are parameterized by (i) a constant bias affecting the degree-biased distribution on the vertex set and (ii) the distribution of times at which new vertices are created by…
We study the quantum localization phenomena of noninteracting particles in one-dimensional lattices based on tight-binding models with various forms of hopping terms beyond the nearest neighbor, which are generalizations of the famous…
This work is a generic advance in the study of delocalized (ergodic) to localized (non-ergodic) wave propagation phenomena in the presence of disorder. There is an urgent need to better understand the physics of extreme value process in the…
We study the spectrum of adjacency matrices of random graphs. We develop two techniques to lower bound the mass of the continuous part of the spectral measure or the density of states. As an application, we prove that the spectral measure…
Based on a selfconsistent theory of localization we study the electron transport properties of a disordered system in the framework of the Anderson model on a Bethe lattice. In the calculation of the dc conductivity we separately discuss…
A significant generalization of the Erd\"os-R\'enyi random graph model is an `inhomogeneous' random graph where the edge probabilities vary according to vertex types. We identify the threshold value for this random graph with a finite…
We establish spectral and dynamical localization for several Anderson models on metric and discrete radial trees. The localization results are obtained on compact intervals contained in the complement of discrete sets of exceptional…
Anderson localization describes disorder-induced phase transitions, distinguishing between localized and extended states. In quasiperiodic systems, a third multifractal state emerges, characterized by unique energy and wave functions.…
We provide a well-posedness theory for a class of nonlocal continuity equations on co-evolving graphs. We describe the connection among vertices through an edge weight function and we let it evolve in time, coupling its dynamics with the…
A finite photonic lattice with two bands and a random gap is considered. Using a two-dimensional Dirac equation, the effect of a random sign of the Dirac mass is studied numerically. The edge state at the sample boundary has a strong…
Automata networks can be seen as bare finite dynamical systems, but their growing theory has shown the importance of the underlying communication graph of such networks. This paper tackles the question of what dynamics can be realized up to…
We construct an exact map between a tight-binding model on any bipartite lattice in presence of dephasing noise and a Hubbard model with imaginary interaction strength. In one dimension, the exact many-body Liouvillian spectrum can be…
We investigate the localization properties of atoms moving in a three-dimensional optical lattice in the presence of an uncorrelated disorder potential having the same probability distribution $P(V)$ as laser speckles. We find that the…
The Anderson model on the Bethe lattice is historically among the first for which an energy regime of extended states and a separate regime of localized states could be established. In this paper, we review recently discovered surprises in…
We examine statistical fluctuation of eigenvalues from the near-edge bulk of QCD Dirac spectra above the critical temperature. For completeness we start by reviewing on the spectral property of Anderson tight-binding Hamiltonians as…
For random systems subject to a constraint, the microcanonical ensemble requires the constraint to be met by every realisation ("hard constraint"), while the canonical ensemble requires the constraint to be met only on average ("soft…
Preferential attachment graphs are random graphs designed to mimic properties of typical real world networks. They are constructed by a random process that iteratively adds vertices and attaches them preferentially to vertices that already…