Related papers: Localization of eigenvectors in random graphs
Whether the many-body mobility edges can exist in a one-dimensional interacting quantum system is a controversial problem, mainly hampered by the limited system sizes amenable to numerical simulations. We investigate the transition from…
The entanglement and localization in eigenstates of strongly chaotic subsystems are studied as a function of their interaction strength. Excellent measures for this purpose are the von-Neumann entropy, Havrda-Charv{\' a}t-Tsallis entropies,…
A numerical study of Anderson transition on random regular graphs (RRG) with diagonal disorder is performed. The problem can be described as a tight-binding model on a lattice with N sites that is locally a tree with constant connectivity.…
The localization is one of the active and fundamental research in topology physics. Based on a generalized Su-Schrieffer-Heeger model with the quasiperiodic non-Hermitian emerging at the off-diagonal location, we propose a novel systematic…
We present a thorough pedagogical analysis of the single particle localization phenomenon in a quasiperiodic lattice in one dimension. Description of disorder in the lattice is represented by the Aubry-Andr\'e model. Characterization of…
We investigate the distribution of eigenvalues of weighted adjacency matrices from a specific ensemble of random graphs. We distribute $N$ vertices across a fixed number $\kappa$ of components, with asymptotically $\alpha_j \dot N$ vertices…
The energy level statistics of uniform random graphs are studied, by treating the graphs as random tight-binding lattices. The inherent random geometry of the graphs and their dynamical spatial dimensionality, leads to various quantum…
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…
The extreme-value statistics of the entanglement spectrum in disordered spin chains possessing a many-body localization transition is examined. It is expected that eigenstates in the metallic or ergodic phase, behave as random states and…
We consider the problem of determining the proportion of edges that are discovered in an Erdos-Renyi graph when one constructs all shortest paths from a given source node to all other nodes. This problem is equivalent to the one of…
In condensed-matter, level statistics has long been used to characterize the phases of a disordered system. We provide evidence within the context of a simple model that in a disordered large-N gauge theory with a gravity dual, there exist…
We study random walks on Erd\"os-R\'enyi random graphs in which, every time the random walk returns to the starting point, first an edge probability is independently sampled according to a priori measure $\mu$, and then an Erd\"os-R\'enyi…
The $N$ vertices of a quantum random graph are each a circle independently punctured at Poisson points of arrivals, with parallel connections derived through for each pair of these punctured circles by yet another independent Poisson…
We consider the bulk eigenvalue statistics of Laplacian matrices of large Erd\H{o}s-R\'enyi random graphs in the regime $p \geq N^{\delta}/N$ for any fixed $\delta >0$. We prove a local law down to the optimal scale $\eta \gtrsim N^{-1}$…
In disordered systems, the amplitudes of the localized states will decrease exponentially away from their centers and the localization lengths are characterizing such decreasing. In this article, we find a model in which each eigenstate is…
We study adjacency and Laplacian matrices of Erd\H{o}s-R\'{e}nyi $r$-uniform hypergraphs on $n$ vertices with hyperedge inclusion probability $p$, in the setting where $r$ can vary with $n$ such that $r / n \to c \in [0, 1)$. Adjacency…
The localization of one-electron states in the large (but finite) disorder limit is investigated. The inverse participation number shows a non--monotonic behavior as a function of energy owing to anomalous behavior of few-site localization.…
We consider random graphs on the set of $N^2$ vertices placed on the discrete $2$-dimensional torus. The edges between pairs of vertices are independent, and their probabilities decay with the distance $\rho$ between these vertices as…
This paper systematically studies the behavior of the leading eigenvectors for independent edge undirected random graphs generated from a general latent position model whose link function is possibly infinite rank and also possibly…
Information of localization properties of eigenvectors of the complex network has applicability in many different areas which include networks centrality measures, spectral partitioning, development of approximation algorithms, and disease…