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

We derive a field-theoretical representation for the moments of the eigenstates in the generalized Anderson model. The representation is exact and can be used for the Anderson model with generic non-random hopping elements in any…

We present an improved upper bound for the ground state energy of lattice fermion models with sign problem. The bound can be computed by numerical simulation of a recently proposed family of deformed Hamiltonians with no sign problem. For…

Large-scale eigenvalue problems arise in various fields of science and engineering and demand computationally efficient solutions. In this study, we investigate the subspace approximation for parametric linear eigenvalue problems, aiming to…

We study the problem of finding the maximum of a function defined on the nodes of a connected graph. The goal is to identify a node where the function obtains its maximum. We focus on local iterative algorithms, which traverse the nodes of…

We develop a new sampling method to estimate eigenvector centrality on incomplete networks. Our goal is to estimate this global centrality measure having at disposal a limited amount of data. This is the case in many real-world scenarios…

Let $\Gamma$ be a nonelementary hyperbolic group with a word metric $d$ and $\partial\Gamma$ its hyperbolic boundary equipped with a visual metric $d_a$ for some parameter $a>1$. Fix a superexponential symmetric probability $\mu$ on…

Deep neural networks exhibit a fascinating spectrum of phenomena ranging from predictable scaling laws to the unpredictable emergence of new capabilities as a function of training time, dataset size and network size. Analysis of these…

The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of its connectivity. These eigenvalues can be used to analyze the robustness, resilience, and synchronizability of networks, and are related to…

Several standard processes for searching minima of potential functions, such as thermodynamical strategies (simulated annealing) and biologically motivated selfreproduction strategies, are reduced to Schr\"odinger problems. The properties…

This paper is focused on investigating the effects of a statistical interaction for graphene-like systems, providing Haldane-like properties for topologically trivial lattices. The associated self-energy correction yields an effective…

Inspired by persistent homology in topological data analysis, we introduce the homological eigenvalues of the graph $p$-Laplacian $\Delta_p$, which allows us to analyse and classify non-variational eigenvalues. We show the stability of…

For a fixed positive integer $k$ and a graph $G$, let $\lambda_k(G)$ denote the $k$-th largest eigenvalue of the adjacency matrix of $G$. In 2017, Tait and Tobin proved that the maximum $\lambda_1(G)$ among all outerplanar graphs on $n$…

The aim of this paper is to study asymptotic geometric properties almost surely or/and in probability of extreme order statistics of an i.i.d. random field (potential) indexed by sites of multidimensional lattice cube, the volume of which…

State-specific approximations can provide an accurate representation of challenging electronic excitations by enabling relaxation of the electron density. While state-specific wave functions are known to be local minima or saddle points of…

To study the convergence to equilibrium in random maps we developed the spectral theory of the corresponding transfer (Perron-Frobenius) operators acting in a certain Banach space of generalized functions. The random maps under study in a…

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…

We prove explicit and sharp eigenvalue estimates for Neumann $p$-Laplace eigenvalues in domains that admit a representation in Fermi coordinates. More precisely, if $\gamma$ denotes a non-closed curve in $\mathbb{R}^2$ symmetric with…

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(\tfrac{i}{N},\tfrac{j}{N})$,…

We study the stabilization time of a wide class of processes on graphs, in which each node can only switch its state if it is motivated to do so by at least a $\frac{1+\lambda}{2}$ fraction of its neighbors, for some $0 < \lambda < 1$. Two…

Consider a finite sequence of independent random permutations, chosen uniformly either among all permutations or among all matchings on n points. We show that, in probability, as n goes to infinity, these permutations viewed as operators on…