Related papers: Landscape approximation of the ground state eigenv…

We consider an inhomogeneous Erd\H{o}s-R\'enyi random graph $G_N$ with vertex set $[N] = \{1,\dots,N\}$ for which the pair of vertices $i,j \in [N]$, $i\neq j$, is connected by an edge with probability $r_N(\tfrac{i}{N},\tfrac{j}{N})$,…

The upper tail problem for the largest eigenvalue of the Erd\H{o}s--R\'enyi random graph $\mathcal{G}_{n,p}$ is to estimate the probability that the largest eigenvalue of the adjacency matrix of $\mathcal{G}_{n,p}$ exceeds its typical value…

We consider families of finite quantum graphs of increasing size and we are interested in how eigenfunctions are distributed over the graph. As a measure for the distribution of an eigenfunction on a graph we introduce the entropy, it has…

A theorem of Hoffman gives an upper bound on the independence ratio of regular graphs in terms of the minimum $\lambda_{\min}$ of the spectrum of the adjacency matrix. To complement this result we use random eigenvectors to gain lower…

We observe that approximate copies of the function $\Lambda _{n}:\mathbb{R}^{n}\rightarrow (0,\infty )$ defined by \begin{equation*} \Lambda _{n}(x)=\exp \left( -x_{1}-\pi \sum_{i=2}^{n}x_{i}^{2}\right) \end{equation*} appear in the tails…

We study a two-dimensional model of topological superconductor with equal spin pairing and repulsive Hubbard interaction. When the pairing gap equals to the hopping constant, half of the spectrum of this model are flat bands, which makes…

The extrapolation of small-cluster exact-diagonalization calculations is used to examine ferromagnetism in the one-dimensional Hubbard model with long-range and correlated hopping. It is found that the correlated hopping term stabilizes the…

We consider the question of when the Laplace eigenfunctions on an arbitrary flat torus $\mathbf{T}_\Gamma:=\mathbf{R}^d/\Gamma$ are flexible enough to approximate, over the natural length scale of order $1/\sqrt\lambda$, where $\lambda\gg1$…

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…

We show how the localization landscape, originally introduced to bound low energy eigenstates of disordered wave media and many-body quantum systems, can form the basis for hardware-efficient quantum algorithms for solving binary…

Let $H$ be a generalized Schr\"odinger operator on a domain of a non-compact connected Riemannian manifold, and a generalized eigenfunction $u$ for $H$: that is, $u$ satisfies the equation $Hu=\lambda u$ in the weak sense but is not…

We examine the localization properties of the 2D Anderson Hamiltonian with off-diagonal disorder. Investigating the behavior of the participation numbers of eigenstates as well as studying their multifractal properties, we find states in…

One of the best-known results in spectral graph theory is the inequality of Hoffman \[ \chi\left( G\right) \geq1-\frac{\lambda\left( G\right) }{\lambda_{\min }\left( G\right) }, \] where $\chi\left( G\right) $ is the chromatic number of a…

We describe a general framework to depict the space of Lorentz invariant effective field theories, which we call the landscape, given any kind of gauge symmetry and field content. Various operator bases in the landscape can be…

We study a non-relativistic charged particle on the Euclidean plane R^2 subject to a perpendicular constant magnetic field and an R^2-homogeneous random potential in the approximation that the corresponding random Landau Hamiltonian on the…

We examine the interplay between disorder and fractionality in a one-dimensional tight-binding Anderson model. In the absence of disorder, we observe that the two lowest energy eigenvalues detach themselves from the bottom of the band, as…

The optimization of multilayer neural networks typically leads to a solution with zero training error, yet the landscape can exhibit spurious local minima and the minima can be disconnected. In this paper, we shed light on this phenomenon:…

A new efficient numerical algorithm for interacting fermion systems is proposed and examined in detail. The ground state is expressed approximately by a linear combination of numerically chosen basis states in a truncated Hilbert space. Two…

Let G be a random subgraph of the n-cube where each edge appears randomly and independently with probability p. We prove that the largest eigenvalue of the adjacency matrix of G is almost surely \lambda_1(G)= (1+o(1))…

We study Anderson localization in a discrete-time quantum map dynamics in one dimension with nearest-neighbor hopping strength $\theta$ and quasienergies located on the unit circle. We demonstrate that strong disorder in a local phase field…