Related papers: Localization on quantum graphs with random edge le…
This paper studies how close random graphs are typically to their expectations. We interpret this question through the concentration of the adjacency and Laplacian matrices in the spectral norm. We study inhomogeneous Erd\"os-R\'enyi random…
Disorder in a 1D quantum lattice induces Anderson localization of the eigenstates and drastically alters transport properties of the lattice. In the original Anderson model, the addition of a periodic driving increases, in a certain range…
We consider the quantum site percolation model on graphs with an amenable group action. It consists of a random family of Hamiltonians. Basic spectral properties of these operators are derived: non-randomness of the spectrum and its…
In an attempt to characterize the structure of eigenvectors of random regular graphs, we investigate the correlations between the components of the eigenvectors associated to different vertices. In addition, we provide numerical…
Effective Hamiltonians can explain in a much simpler way the physics behind a scattering process. Chaotic scattering is directly related to Lorentzian Hamiltonians which, because of their properties, can be reduced to a $2\times 2$ matrix…
We consider the density matrices derived from combinatorial laplacian matrix of graphs. Specifically, the star-relevant graph, which means adding certain edges on peripheral vertices of star graph, is the focus of this paper. Initially, we…
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…
We study the symmetry classes of graphene quantum dots, both open and closed, through the conductance and energy level statistics. For abrupt termination of the lattice, these properties are well described by the standard orthogonal and…
We study numerically the eigenmode spectrum of the covariant lattice Laplacian, in the fundamental SU(2) color group representation. It is found that eigenmodes at the lower and upper ends of the spectrum are localized, and that the…
If the number of lattice sites is odd, a quantum particle hopping on a bipartite lattice with random hopping between the two sublattices only is guaranteed to have an eigenstate at zero energy. We show that the localization length of this…
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…
We study spectra and localization properties of Euclidean random matrices. The problem is approximately mapped onto that of a matrix defined on a random graph. We introduce a powerful method to find the density of states and the…
We study multi-particle interactive quantum disordered systems on a polynomially-growing countable connected graph (Z,E). The novelty is to give localization bounds uniform in finite or infinite volumes (subgraphs) in Z^N as well as for the…
Continuous-time quantum walks are typically effected by either the discrete Laplacian or the adjacency matrix. In this paper, we explore a third option: the signless Laplacian, which has applications in algebraic graph theory and may arise…
Dynamical localization phenomena of monochromatically perturbed standard map (SM) and Anderson map (AM), which are both identified with a two-dimensional disordered system under suitable conditions, are investigated by the numerical…
Using exact numerical diagonalization, we investigate localization in two classes of random matrices corresponding to random graphs. The first class comprises the adjacency matrices of Erdos-Renyi (ER) random graphs. The second one…
Not necessarily self-adjoint quantum graphs -- differential operators on metric graphs -- are considered. Assume in addition that the underlying metric graph possesses an automorphism (symmetry) $ \mathcal P $. If the differential operator…
We consider network models of quantum localisation in which a particle with a two-component wave function propagates through the nodes and along the edges of an arbitrary directed graph, subject to a random SU(2) rotation on each edge it…
We introduce a non-backtracking Laplace operator for graphs and we investigate its spectral properties. With the use of both theoretical and computational techniques, we show that the spectrum of this operator captures several structural…
We study the spectrum of a quantum star graph with a non-selfadjoint Robin condition at the central vertex. We first prove that, in the high frequency limit, the spectrum of the Robin Laplacian is close to the usual spectrum corresponding…