Related papers: Eigenvalues in microeconomics
We investigate traces of powers of random matrices whose distributions are invariant under rotations (with respect to the Hilbert--Schmidt inner product) within a real-linear subspace of the space of $n\times n$ matrices. The matrices we…
Dynamical networks are powerful tools for modeling a broad range of complex systems, including financial markets, brains, and ecosystems. They encode how the basic elements (nodes) of these systems interact altogether (via links) and evolve…
Spectral methods have myriad applications in high-dimensional statistics and data science, and while previous works have primarily focused on $\ell_2$ or $\ell_{2,\infty}$ eigenvector and singular vector perturbation theory, in many…
The aim of this paper is to show how free probability theory sheds light on spectral properties of deformed matricial models and provides a unified understanding of various asymptotic phenomena such as spectral measure description,…
This paper introduces a novel framework that combines traditional centrality measures with eigenvalue spectra and diffusion processes for a more comprehensive analysis of complex networks. While centrality measures such as degree,…
We study a class of heterogeneous agent-based models which are based on a basic set of principles, and the most fundamental operations of an economic system: trade and product transformations. A basic guiding principle is scale invariance,…
We construct a real-analytic circle map for which the corresponding Perron-Frobenius operator has a real-analytic eigenfunction with an eigenvalue outside the essential spectral radius when acting upon $C^1$-functions.
Random matrix theory allows for the deduction of stability criteria for complex systems using only a summary knowledge of the statistics of the interactions between components. As such, results like the well-known elliptical law are…
The technique of Weinberg's spectral-function sum rule is a powerful tool for a study of models in which global symmetry is dynamically broken. It enables us to convert information on the short-distance behavior of a theory to relations…
Eigenvalue analysis is a well-established tool for stability analysis of dynamical systems. However, there are situations where eigenvalues miss some important features of physical models. For example, in models of incompressible fluid…
Spectral algorithms are some of the main tools in optimization and inference problems on graphs. Typically, the graph is encoded as a matrix and eigenvectors and eigenvalues of the matrix are then used to solve the given graph problem.…
Eigenvector centrality is a standard network analysis tool for determining the importance of (or ranking of) entities in a connected system that is represented by a graph. However, many complex systems and datasets have natural multi-way…
Training of neural networks can be reformulated in spectral space, by allowing eigenvalues and eigenvectors of the network to act as target of the optimization instead of the individual weights. Working in this setting, we show that the…
Neural networks represent more features than they have dimensions via superposition, forcing features to share representational space. Current methods decompose activations into sparse linear features but discard geometric structure. We…
The isospectral reduction of matrix, which is closely related to its Schur complement, allows to reduce the size of a matrix while maintaining its eigenvalues up to a known set. Here we generalize this procedure by increasing the number of…
In the first part of this manuscript a relationship between the spectrum of self-adjoint operator matrices and the spectra of their diagonal entries is found. This leads to enclosures for spectral points and in particular, enclosures for…
We discuss the problems arising when computing eigenvalues of self-adjoint operators which lie in a gap between two parts of the essential spectrum. Spectral pollution, i.e. the apparent existence of eigenvalues in numerical computations,…
The Schur-Horn theorem is a well-known result that characterizes the relationship between the diagonal elements and eigenvalues of a symmetric (Hermitian) matrix. In this paper, we extend this theorem by exploring the eigenvalue…
We describe extensive computational experiments on spectral properties of random objects - random cubic graphs, random planar triangulations, and Voronoi and Delaunay diagrams of random (uniformly distributed) point sets on the sphere). We…
This contribution to the proceedings of the Cracow meeting on `Applications of Random Matrix Theory' summarizes a series of studies, some old and others more recent on financial applications of Random Matrix Theory (RMT). We first review…