Related papers: Mobility Edge for the Anderson Model on Random Reg…
We find an asymptotic enumeration formula for the number of simple $r$-uniform hypergraphs with a given degree sequence, when the number of edges is sufficiently large. The formula is given in terms of the solution of a system of equations.…
The mobility edges (MEs) that separate localized, multifractal and ergodic states in energy are a central concept in understanding Anderson localization. In this work we study the effect of several mutually commensurate quasiperiodic…
The Aubry-Andr\'e-Harper (AAH) model with a self-dual symmetry plays an important role in studying the Anderson localization. Here we find a self-dual symmetry determining the quantum phase transition between extended and localized states…
We introduce and analyse ensembles of 2-regular random graphs with a tuneable distribution of short cycles. The phenomenology of these graphs depends critically on the scaling of the ensembles' control parameters relative to the number of…
We are concerned with sequences of graphs having a grid geometry, with a uniform local structure in a bounded domain $\Omega\subset {\mathbb R}^d$, $d\ge 1$. We assume $\Omega$ to be Lebesgue measurable with regular boundary and contained,…
In this work, we study some statistical properties of the extreme eigenstates of the randomly-weighted adjacency matrices of random graphs. We focus on two random graph models: Erd\H{o}s-R\'{e}nyi (ER) graphs and random geometric graphs…
We find an upper bound for the asymptotic dimension of a hyperbolic metric space with a set of geodesics satisfying a certain boundedness condition studied by Bowditch. The primary example is a collection of tight geodesics on the curve…
For random $d$-regular graphs on $N$ vertices with $1 \ll d \ll N^{2/3}$, we develop a $d^{-1/2}$ expansion of the local eigenvalue distribution about the Kesten-McKay law up to order $d^{-3}$. This result is valid up to the edge of the…
Let $G$ be a connected graph in which almost all vertices have linear degrees and let $T$ be a uniform spanning tree of $G$. For any fixed rooted tree $F$ of height $r$ we compute the asymptotic density of vertices $v$ for which the…
Given a graph G = (V,E), a vertex subset S is called t-stable (or t-dependent) if the subgraph G[S] induced on S has maximum degree at most t. The t-stability number of G is the maximum order of a t-stable set in G. We investigate the…
Let $R_T$ be the Ricci matrix of a finite tree $T$ introduced in \cite{BaiChengHua2026}, the largest eigenvalue $\lambda_{\max}(R_T)$ determines the sign of a discrete Einstein metric curvature on the tree. This paper investigates the…
Uncertainty principles present an important theoretical tool in signal processing, as they provide limits on the time-frequency concentration of a signal. In many real-world applications the signal domain has a complicated irregular…
We give a new proof of a version of Klein's theorem on the existence of absolutely continuous spectrum for the Anderson model on the Bethe Lattice at weak disorder.
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…
A Bose-Hubbard model on a dynamical lattice was introduced in previous work as a spin system analogue of emergent geometry and gravity. Graphs with regions of high connectivity in the lattice were identified as candidate analogues of…
We study one-dimensional optical lattices described by generalized Aubry-Andr\'e models that include both commensurate and incommensurate modulations of the hopping amplitude. This brings together two interesting features of this class of…
Large graphs are sometimes studied through their degree sequences (power law or regular graphs). We study graphs that are uniformly chosen with a given degree sequence. Under mild conditions, it is shown that sequences of such graphs have…
We study Ising spin models on finitely connected random interaction graphs which are drawn from an ensemble in which not only the degree distribution $p(k)$ can be chosen arbitrarily, but which allows for further fine-tuning of the topology…
A method of resummation of infinite series of perturbation theory diagrams is applied for studying the properties of random band matrices. The topological classification of Feynman diagrams, which was actively used in last years for matrix…
We study numerically Anderson localization on lattices that are tree-like except for the presence of one loop of varying length $L$. The resulting expressions allow us to compute corrections to the Bethe lattice solution on i)…