Related papers: Mobility Edge for the Anderson Model on Random Reg…
The aim of this paper is twofold. First, we study eigenvalues and eigenvectors of the adjacency matrix of a bond percolation graph when the base graph is finite and well approximated locally by an infinite regular graph. We relate…
Random graphs defined by an occurrence probability that is invariant under node aggregation have been identified recently in the context of network renormalization. The invariance property requires that edges are drawn with a specific…
A technically convenient signature of Anderson localization is exponential decay of the fractional moments of the Green function within appropriate energy ranges. We consider a random Hamiltonian on a lattice whose randomness is generated…
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…
We consider self-loops and multiple edges in the configuration model as the size of the graph tends to infinity. The interest in these random variables is due to the fact that the configuration model, conditioned on being simple, is a…
We prove that for each $d\geq 3$ and $k\geq 2$, the set of limit points of the first $k$ eigenvalues of sequences of $d$-regular graphs is \[ \{(\mu_1,\dots,\mu_k): d=\mu_1\geq \dots\geq \mu_{k}\geq2\sqrt{d-1}\}. \] The result for $k=2$ was…
We present new degree-sequence lower bounds on the expected size of an independent set from the hard-core model. For arbitrary graphs, we establish a multivariate lower bound inspired by a conjecture of the first author and Kang and a…
The average nearest neighbor degree (ANND) of a node of degree $k$ is widely used to measure dependencies between degrees of neighbor nodes in a network. We formally analyze ANND in undirected random graphs when the graph size tends to…
A strong-coupling-perturbation theory around the Atomic Limit of the Anderson model with large $U$ for a localized $f$-orbital coupled to a conduction-electron band is presented. Although an auxiliary-particle representation is {\em not}…
Consider the geometric graph on $n$ independent uniform random points in a connected compact region $A$ of ${\bf R}^d, d \geq 2$, with $C^2$ boundary, or in the unit square, with distance parameter $r_n$. Let $K_n$ be the number of…
We establish tight lower and upper bounds on the number of edges in traceable graphs in several classes of dense graphs. A graph is traceable if it has a Hamiltonian path. We show that the bound is: - quadratic for the class of graphs of…
We analyse the eigenvectors of the adjacency matrix of a random inhomogeneous graph constructed from a specified degree sequence. We assume that the empirical degree sequence has bounded mean and variance. We show that near the edges of the…
Motivated by the link between Anderson localisation on high-dimensional graphs and many-body localisation, we study the effect of periodic driving on Anderson localisation on random trees. The time dependence is eliminated in favour of an…
Let a random geometric graph be defined in the supercritical regime for the existence of a unique infinite connected component in Euclidean space. Consider the first-passage percolation model with independent and identically distributed…
Using the density matrix renormalization group algorithm, we investigate the lattice model for spinless fermions in one dimension in the presence of a strong interaction and disorder. The phase sensitivity of the ground state energy is…
We introduce the Density Formula for (topological) drawings of graphs in the plane or on the sphere, which relates the number of edges, vertices, crossings, and sizes of cells in the drawing. We demonstrate its capability by providing…
In this work we introduce the notion of an angular spectrum for a linear discrete time nonautonomous dynamical system. The angular spectrum comprises all accumulation points of longtime averages formed by maximal principal angles between…
As disorder strength increases in quantum many-body systems a new phase of matter, the so-called anybody localization, emerges across the whole spectrum. This transition is energy dependent, a phenomenon known as mobility edge, such that…
We study the asymptotic behavior of the number of paths of length $N$ on several classes of infinite graphs with a single special vertex. This vertex can work as an entropic trap for the path, i.e. under certain conditions the dominant part…
We study the localization properties of a disordered tight-binding Hamiltonian on a generic bipartite lattice close to the band center. By means of a fermionic replica trick method, we derive the effective non-linear $\sigma$-model…