相关论文: Anderson Localization for radial tree-like random …

We have been investigating the problem of the Anderson localization in a disordered one dimensional tight-binding model. The disorder is created by the interaction of mobile particles with other species, immobilized at random positions. We…

We predict Anderson localization of light with nested screw topological dislocations propagating in disordered two-dimensional arrays of hollow waveguides illuminated by vortex beams. The phenomenon manifests itself in the statistical…

Let $d$ be a fixed large integer. For any $n$ larger than $d$, let $A_n$ be the adjacency matrix of the random directed $d$-regular graph on $n$ vertices, with the uniform distribution. We show that $A_n$ has rank at least $n-1$ with…

Quantum site percolation as a limiting case of binary alloy is studied numerically in 2D within the tight-binding model. We address the transport properties in all regimes - ballistic, diffusive (metallic), localized and crossover between…

As a supplement of our previous work, we consider the localized region of the random Schroedinger operators on $l^2({\bf Z}^d)$ and study the point process composed of their eigenvalues and corresponding localization centers. For the…

Emerging experimental platforms use amorphousness, a constrained form of disorder, to tailor meta-material properties. We study localization under this type of disorder in a family of 2D models generalizing recent experiments on photonic…

The mathematical analysis of random phylogenetic networks via analytic and algorithmic methods has received increasing attention in the past years. In the present work we introduce branching process methods to their study. This approach…

It is considered an equation for the Lyapunov exponent $% \gamma $ in a random metric for a scalar propagating wave field. At first order in frequency this equation is solved explicitly. The localization length $L_{c}$ (reciprocal 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 a model of random $\mathcal{R}$-enriched trees that is based on weights on the $\mathcal{R}$-structures and allows for a unified treatment of a large family of random discrete structures. We establish distributional limits…

We prove Anderson localization at the internal band-edges for periodic magnetic Schr{\"o}dinger operators perturbed by random vector potentials of Anderson-type. This is achieved by combining new results on the Lifshitz tails behavior of…

Anderson localization predicts that wave spreading in disordered lattices can come to a complete halt, providing a universal mechanism for {dynamical localization}. In the one-dimensional Hermitian Anderson model with uncorrelated diagonal…

Motivated by the problem of Many-Body Localization and the recent numerical results for the level and eigenfunction statistics on the random regular graphs, a generalization of the Rosenzweig-Porter random matrix model is suggested that…

Quantum transport through disordered structures is inhibited by (Anderson) localization effects. The disorder can be either topological as in random networks or energetical as in the original Anderson model. In both cases the eigenstates of…

In this paper we prove Anderson localization for multi-frequency quasi-periodic extended CMV matrices with analytic Verblunsky coefficients in the regime of positive Lyapunov exponents. By constructing a suitable semialgebraic set and…

Anderson localization is a universal interference phenomenon occurring when a wave evolves through a random medium and it has been observed in a great variety of physical systems, either quantum or classical. The recently developed…

We prove a quantum-ergodicity theorem on large graphs, for eigenfunctions of Schr\"odinger operators in a very general setting. We consider a sequence of finite graphs endowed with discrete Schr\"odinger operators, assumed to have a local…

We consider three classes of random graphs: edge random graphs, vertex random graphs, and vertex-edge random graphs. Edge random graphs are Erdos-Renyi random graphs, vertex random graphs are generalizations of geometric random graphs, and…

Numerical approaches to Anderson localization face the problem of having to treat large localization lengths while being restricted to finite system sizes. We show that by finite-size scaling of the probability distribution of the local…

We compute the distribution function of single-level curvatures, $P(k)$, for a tight binding model with site disorder, on a cubic lattice. In metals $P(k)$ is very close to the predictions of the random-matrix theory (RMT). In insulators…