相关论文: Landscape approximation of the ground state eigenv…

Random operators may acquire extended states formed from a multitude of mutually resonating local quasi-modes. This mechanics is explored here in the context of the random Schr\"odinger operator on the complete graph. The operators exhibits…

We review how the renormalized force correlator Delta(u), the function computed in the functional RG field theory, can be measured directly in numerics and experiments on the dynamics of elastic manifolds in presence of pinning disorder. We…

This purpose of this write-up is to share an idea for accurate computation of Laplace eigenvalues on a broad class of smooth domains. We represent the eigenfunction $u$ as a linear combination of eigenfunctions corresponding to the common…

This PhD thesis lays out algebraic and topological structures relevant for the study of probabilistic graphical models. Marginal estimation algorithms are introduced as diffusion equations of the form $\dot u = \delta \varphi$. They…

Let $\Lambda=\{\Lambda_0,\Lambda_1,\Lambda_2,\ldots\}$ be the point process that describes the edge scaling limit of either (i) "regular" beta-ensembles with inverse temperature $\beta>0$, or (ii) the top eigenvalues of Wishart or Gaussian…

We study random k-lifts of large, but otherwise arbitrary graphs G. We prove that, with high probability, all eigenvalues of the adjacency matrix of the lift that are not eigenvalues of G are of the order (D ln (kn))^{1/2}, where D is the…

A one-dimensional model of interacting electrons with on-site $U$, nearest-neighbor $V$, and correlated-hopping interaction $T^{\ast}$ is studied at half-filling using the continuum-limit field theory approach. The ground state phase…

Consider the normalized adjacency matrices of random $d$-regular graphs on $N$ vertices with fixed degree $d\geq3$. We prove that, with probability $1-N^{-1+{\varepsilon}}$ for any ${\varepsilon} >0$, the following two properties hold as $N…

We define the independence ratio and the chromatic number for bounded, self-adjoint operators on an L^2-space by extending the definitions for the adjacency matrix of finite graphs. In analogy to the Hoffman bounds for finite graphs, we…

We study the glassy super-rough phase of a class of solid-on-solid models with a disordered substrate in the limit of vanishing temperature by means of exact ground states, which we determine with a newly developed minimum cost flow…

We investigate the relationship between the energy spectrum of a local Hamiltonian and the geometric properties of its ground state. By generalizing a standard framework from the analysis of Markov chains to arbitrary (non-stoquastic)…

We calculate the maximum Lyapunov exponent of the motion in the separatrix map's chaotic layer, along with calculation of its width, as functions of the adiabaticity parameter $\lambda$. The separatrix map is set in natural variables; and…

Let $\lambda_1(G)\ge \lambda_2(G)\ge \cdots \ge \lambda_n(G)$ denote the adjacency eigenvalues of a graph $G$ of order $n$. We prove that for every $k\geq 2$ and every graph $G$ on $n\geq k$ vertices, $$ \lambda_k(G)\le…

We examine the necessary and sufficient complexity of neural networks to approximate functions from different smoothness spaces under the restriction of encodable network weights. Based on an entropy argument, we start by proving lower…

Neural network approaches to approximate the ground state of quantum hamiltonians require the numerical solution of a highly nonlinear optimization problem. We introduce a statistical learning approach that makes the optimization trivial by…

We prove a general upper bound on the $k$-th adjacency eigenvalue of a graph. For $k\ge 2$, we show that \[ \lambda_k(G)\le \frac{(k-2)\sqrt{k+1}+2}{2k(k-1)}\,n-1 \] for every graph $G$ on $n$ vertices. We build on a recent approach that…

We consider a model of a random height function with long-range constraints on a discrete segment. This model was suggested by Benjamini, Yadin and Yehudayoff and is a generalization of simple random walk. The random function is uniformly…

As a prototype model of antiferromagnetism, we propose a repulsive Hubbard Hamiltonian defined on a graph $\L={\cal A}\cup{\cal B}$ with ${\cal A}\cap {\cal B}=\emptyset$ and bonds connecting any element of ${\cal A}$ with all the elements…

By using a recently proposed probabilistic approach, we determine the exact ground state of a class of matrix Hamiltonian models characterized by the fact that in the thermodynamic limit the multiplicities of the potential values assumed by…

We study the problem of approximately counting matchings in hypergraphs of bounded maximum degree and maximum size of hyperedges. With an activity parameter $\lambda$, each matching $M$ is assigned a weight $\lambda^{|M|}$. The counting…