Related papers: Spectral Sets
Many common methods for data analysis rely on linear algebra. We provide new results connecting data analysis error to numerical accuracy, which leads to the first meaningful stopping criterion for two way spectral partitioning. More…
We use techniques from relative algebraic geometry and homotopical algebraic geometry in order to construct several categories of schemes defined "under Spec Z". We define this way the categories of N-schemes, F_1-schemes, S-schemes,…
The notion of spectrum of first-order properties introduced by J. Spencer for Erdos-Renyi random graph is considered in relation to random uniform hypergraphs. We study properties of spectrum for first-order formulae with bounded quantifier…
Hermitian linear matrix pencils are ubiquitous in control theory, operator systems, semidefinite optimization, and real algebraic geometry. This survey reviews the fundamental features of the matricial solution set of a linear matrix…
The spectral symbols are useful tools to analyse the eigenvalue distribution when dealing with high dimensional linear systems. Given a matrix sequence with an asymptotic symbol, the last one depends only on the spectra of the individual…
We show that the K-theory spectra of many assemblers, such as the assembler of polytopes in euclidean, hyperbolic or spherical geometry, as well as the assembler of definable sets, are equivalent to the K-theory spectrum of a squares…
The density function of the limiting spectral distribution of general sample covariance matrices is usually unknown. We propose to use kernel estimators which are proved to be consistent. A simulation study is also conducted to show the…
The growth of sky surveys and the large amount of stellar spectra in the current databases, has generated the necessity of developing new methods to estimate atmospheric parameters, a fundamental task on stellar research. In this work we…
In many areas of machine learning, it becomes necessary to find the eigenvector decompositions of large matrices. We discuss two methods for reducing the computational burden of spectral decompositions: the more venerable Nystom extension…
We present a flexible framework for uncertainty principles in spectral graph theory. In this framework, general filter functions modeling the spatial and spectral localization of a graph signal can be incorporated. It merges several…
The aim of this paper is to give an overview of the spectral theories associated with the notions of holomorphicity in dimension greater than one. A first natural extension is the theory of several complex variables whose Cauchy formula is…
Graph neural networks (GNNs) have attracted considerable attention from the research community. It is well established that GNNs are usually roughly divided into spatial and spectral methods. Despite that spectral GNNs play an important…
Various spectral notions have been employed to grasp the structure of point sets, in particular non-periodic ones. In this article, we present them in a unified setting and explain the relations between them. For the sake of readability, we…
We develop a practical approach to semidefinite programming (SDP) that includes the von Neumann entropy, or an appropriate variant, as a regularization term. In particular we solve the dual of the regularized program, demonstrating how a…
We give an efficient algorithm which can obtain a relative error approximation to the spectral norm of a matrix, combining the power iteration method with some techniques from matrix reconstruction which use random sampling.
We extend Ueda's peak set theorem for subdiagonal subalgebras of tracial finite von Neumann algebras, to sigma-finite von Neumann algebras (that is, von Neumann algebras with a faithful state; which includes those on a separable Hilbert…
We study the spectra of mixed graphs about its Hermitian adjacency matrix of the second kind (i.e. N-matrix) introduced by Mohar [1]. We extend some results and define one new Hermitian adjacency matrix, and the entry corresponding to an…
The theory of finite-rank perturbations allows for the determination of spectral information for broad classes of operators using the tools of analytic function theory. In this work, finite-rank perturbations are applied to powers of the…
The authors study the spectral theory of self-adjoint operators that are subject to certain types of perturbations. An iterative introduction of infinitely many randomly coupled rank-one perturbations is one of our settings. Spectral…
We establish a general link between integrable systems in algebraic geometry (expressed as Jacobian flows on spectral curves) and soliton equations (expressed as evolution equations on flat connections). Our main result is a natural…