Related papers: Localization of eigenvectors in random graphs
We study the level spacing distribution p(s) in the spectrum of random networks. According to our numerical results, the shape of p(s) in the Erdos-Renyi (E-R) random graph is determined by the average degree <k>, and p(s) undergoes a…
It is shown that certain ensembles of random matrices with entries that vanish outside a band around the diagonal satisfy a localization condition on the resolvent which guarantees that eigenvectors have strong overlap with a vanishing…
We consider quantum walks defined on arbitrary infinite graphs, parameterized by a family of scattering matrices attached to the vertices. Multiplying each scattering matrix by an i.i.d. random phase, we obtain a random scattering quantum…
In this work, we study the asymptotic behavior of protocols that localize entanglement in large multi-qubit states onto a subset of qubits by measuring the remaining qubits. We use the maximal average n-tangle that can be generated on a…
The spectral properties of the Laplacian on a class of quantum graphs with random metric structure are studied. Namely, we consider quantum graphs spanned by the simple $\ZZ^d$-lattice with $\delta$-type boundary conditions at the vertices,…
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…
We show analytically that the apparent non-analyticity discovered recently in the inverse participation ratio (IPR) of the eigenstates in Anderson's model of localization is also present in a simple two-site model, along with a concurrent…
We present a comprehensive extension of the latent position network model known as the random dot product graph to accommodate multiple graphs -- both undirected and directed -- which share a common subset of nodes, and propose a method for…
The use of data-random graphs in statistical testing of spatial patterns is introduced recently. In this approach, a random directed graph is constructed from the data using the relative positions of the points from various classes.…
We study the local eigenvalue statistics $\xi_{\omega,E}^N$ associated with the eigenvalues of one-dimensional, $(2N+1) \times (2N+1)$ random band matrices with independent, identically distributed, real random variables and band width…
We study the fixation time of the identity of the leader, i.e., the most massive component, in the general setting of Aldous's multiplicative coalescent [4, 5], which in an asymptotic sense describes the evolution of the component sizes of…
We determine the joint limiting distribution of adjacent spacings around a central, intermediate, or an extreme order statistic $X_{k:n}$ of a random sample of size $n$ from a continuous distribution $F$. For central and intermediate cases,…
In a random linear graph, vertices are points on a line, and pairs of vertices are connected, independently, with a link probability that decreases with distance. We study the problem of reconstructing the linear embedding from the graph,…
Level statistics is a crucial tool in the exploration of localization physics. The level spacing distribution of the disordered localized phase follows Poisson statistics, and many studies naturally apply it to the quasiperiodic localized…
We prove localization with high probability on sets of size of order $N/\log N$ for the eigenvectors of non-Hermitian finitely banded $N\times N$ Toeplitz matrices $P_N$ subject to small random perturbations, in a very general setting. As…
We describe the phenomenon of localization in the epidemic SIS model on highly heterogeneous networks in which strongly connected nodes (hubs) play the role of centers of localization. We find that in this model the localized states below…
Recent work on the structure of social networks and the internet has focussed attention on graphs with distributions of vertex degree that are significantly different from the Poisson degree distributions that have been widely studied in…
This paper studies the eigenvalue distribution of the Watts-Strogatz random graph, which is known as the "small-world" random graph. The construction of the small-world random graph starts with a regular ring lattice of n vertices; each has…
This paper focuses on Majority Dynamics in sparse graphs, in particular, as a tool to study internal cuts. It is known that, in Majority Dynamics on a finite graph, each vertex eventually either comes to a fixed state, or oscillates with…
We study the quantum statistical electronic properties of random networks which inherently lack a fixed spatial dimension. We use tools like the density of states (DOS) and the inverse participation ratio(IPR) to uncover various phenomena,…