相关论文: Anderson Localization for radial tree-like random …
We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…
We study complex networks under random matrix theory (RMT) framework. Using nearest-neighbor and next-nearest-neighbor spacing distributions we analyze the eigenvalues of adjacency matrix of various model networks, namely, random,…
We study phenomena where some eigenvectors of a graph Laplacian are largely confined in small subsets of the graph. These localization phenomena are similar to those generally termed Anderson Localization in the Physics literature, and are…
Anderson model of noninteracting disordered electrons is studied in high spatial dimensions. We find that off-diagonal one- and two-particle propagators behave as gaussian random variables w.r.t. momentum summations. With this…
We consider a system of two discrete quasiperiodic 1D particles as an operator on $\ell^2(\mathbb Z^2)$ and establish Anderson localization at large disorder, assuming the potential has no cosine-type symmetries. In the presence of…
Anderson localization is a universal phenomenon affecting non-interacting quantum particles in disorder. In three spatial dimensions it becomes particularly interesting to study because of the presence of a quantum phase transition from…
Random graphs are more and more used for modeling real world networks such as evolutionary networks of proteins. For this purpose we look at two different models and analyze how properties like connectedness and degree distributions are…
We consider a random Schr\"odinger operator on the binary tree with a random potential which is the sum of a random radially symmetric potential, $Q_r$, and a random transversally periodic potential, $\kappa Q_t$, with coupling constant…
Random intersection graphs have received much interest and been used in diverse applications. They are naturally induced in modeling secure sensor networks under random key predistribution schemes, as well as in modeling the topologies of…
We present the relativistic analogue of Anderson localization in one dimension. We use Dirac equation to calculate the transmission probability for a spin-$\frac{1}{2}$ particle incident upon a rectangular barrier. Using the transfer matrix…
In this paper, we use recent breakthroughs in the study of coupled subwavelength resonator systems to reveal new insight into the mechanisms responsible for the fundamental features of Anderson localization. The occurrence strong…
For random operators it is conjectured that spectral properties of an infinite-volume operator are related to the distribution of spectral gaps of finite-volume approximations. In particular, localization and pure point spectrum in infinite…
The real trees form a class of metric spaces that extends the class of trees with edge lengths by allowing behavior such as infinite total edge length and vertices with infinite branching degree. Aldous's Brownian continuum random tree, the…
For Anderson localization on the Cayley tree, we study the statistics of various observables as a function of the disorder strength $W$ and the number $N$ of generations. We first consider the Landauer transmission $T_N$. In the localized…
We study asymptotic percolation as $N\to \infty$ in an infinite random graph ${\cal G}_N$ embedded in the hierarchical group of order $N$, with connection probabilities depending on an ultrametric distance between vertices. ${\cal G}_N$ is…
We study a generalisation of the random recursive tree (RRT) model and its multigraph counterpart, the uniform directed acyclic graph (DAG). Here, vertices are equipped with a random vertex-weight representing initial inhomogeneities in the…
We introduce a new class of countably infinite random geometric graphs, whose vertices are points in a metric space, and vertices are adjacent independently with probability p if the metric distance between the vertices is below a given…
In 1986, Janson showed that the number of edges in the union of $k$ random spanning trees in the complete graph $K_n$ is a shifted Poisson distribution. Using results from the theory of electrical networks, we provide a new proof of this…
Anderson localization describes disorder-induced phase transitions, distinguishing between localized and extended states. In quasiperiodic systems, a third multifractal state emerges, characterized by unique energy and wave functions.…
In this article, we consider the problem of testing whether two latent position random graphs are correlated. We propose a test statistic based on the kernel method and introduce the estimation procedure based on the spectral decomposition…