Related papers: Mobility Edge for the Anderson Model on Random Reg…
Many physical systems -- such as optical waveguide lattices and dense neuronal or vascular networks -- can be modeled by metric graphs, where slender "wires" (edges) support wave or diffusion equations subject to Kirchhoff conditions at the…
Consider the normalized adjacency matrices of random $d$-regular graphs on $N$ vertices with fixed degree $d\geq3$. We prove that, with probability $1-N^{-1+{\varepsilon}}$ for any ${\varepsilon} >0$, the following two properties hold as $N…
We study Anderson localisation on high-dimensional graphs with spatial structure induced by long-ranged but distance-dependent hopping. To this end, we introduce a class of models that interpolate between the short-range Anderson model on a…
We study connected graphs with a fixed degree sequence, in the sparse setting where the number of edges grows linearly in the number of vertices. Using the relation to the configuration model, we identify the number of such connected graphs…
We exploit a result by Nerman which shows that conditional limit theorems hold when a certain monotonicity condition is satisfied. Our main result is an application to vertex degrees in random graphs, where we obtain asymptotic normality…
We consider a one-dimensional Anderson model where the potential decays in average like $n^{-\alpha}$, $\alpha>0$. This simple model is known to display a rich phase diagram with different kinds of spectrum arising as the decay rate…
We consider the multi-particle Anderson tight-binding model and prove that its lower spectral edge is non-random under some mild assumptions on the inter-particle interaction and the random external potential. We also adapt to the low…
It is shown, using high-precision numerical simulations, that the mobility edge of the 3d Anderson model depends on the boundary hopping term t in the infinite size limit. The critical exponent is independent of it. The renormalized…
It is shown that, an entire class of off-diagonally disordered linear lattices composed of two basic building blocks and described within a tight binding model can be tailored to generate absolutely continuous energy bands. It can be…
In this paper, we investigate the Anderson model on the Bethe lattice, focusing on the localized regime. Employing the cavity approach, we derive compact expressions for the inverse participation ratios (IPRs) that are equivalent to those…
We use dynamic coherent backscattering to study one of the Anderson mobility gaps in the vibrational spectrum of strongly disordered three-dimensional mesoglasses. Comparison of experimental results with the self-consistent theory of…
Using the phenomenological expression for the level spacing distribution with only one parameter, $0 \leq \beta \leq \infty$, covering all regimes of chaos and complexity in a quantum system, we show that transport properties of the…
Hyperbolic lattices, formed by tessellating the hyperbolic plane with regular polygons, exhibit a diverse range of exotic physical phenomena beyond conventional Euclidean lattices. Here, we investigate the impact of disorder on hyperbolic…
Consider a random regular graph of fixed degree $d$ with $n$ vertices. We study spectral properties of the adjacency matrix and of random Schr\"odinger operators on such a graph as $n$ tends to infinity. We prove that the integrated density…
We study the Anderson localization of atomic gases exposed to three-dimensional optical speckles by analyzing the statistics of the energy-level spacings. This method allows us to consider realistic models of the speckle patterns, taking…
Tight-binding 1D random system with long-range correlations is studied numerically using the localisation criterium, which represents the number of sites, covered by the wave function. At low degrees of disorder the signs of a mobility…
We derive a message passing method for computing the spectra of locally tree-like networks and an approximation to it that allows us to compute closed-form expressions or fast numerical approximates for the spectral density of random graphs…
In this paper we derive results concerning the connected components and the diameter of random graphs with an arbitrary i.i.d. degree sequence. We study these properties primarily, but not exclusively, when the tail of the degree…
We deal with a general preferential attachment graph model with multiple type edges. The types are chosen randomly, in a way that depends on the evolution of the graph. In the $N$-type case, we define the (generalized) degree of a given…
We propose a simplified version of the Multi-Scale Analysis of tight-binding Anderson models with strongly mixing random potentials which leads directly to uniform exponential bounds on decay of eigenfunctions in arbitrarily large finite…