Related papers: Generalized eigenvalue problems for meet and join …
This work is concerned with finite range bounds on the variance of individual eigenvalues of random covariance matrices, both in the bulk and at the edge of the spectrum. In a preceding paper, the author established analogous results for…
In this manuscript, a generalized inverse eigenvalue problem is considered that involves a linear pencil $(z\mathcal{J}_{[0,n]}-\mathcal{H}_{[0,n]})$ of matrices arising in the theory of rational interpolation and biorthogonal rational…
In this paper, we analyze nonlinear differential equations subject to generalized boundary conditions. More specifically, we provide a framework from which we can provide conditions, which are straightforward to check, for the solvability…
This paper proposes a rational filtering domain decomposition technique for the solution of large and sparse symmetric generalized eigenvalue problems. The proposed technique is purely algebraic and decomposes the eigenvalue problem…
We discuss a class of problems which we call lattice exit models. At one level, these problems provide undergraduate level exercises in labeling the vertices of graphs (e.g., depth first search). At another level (theorems about large scale…
We present Gerschgorin-type eigenvalue inclusion sets applicable to generalized eigenvalue problems.Our sets are defined by circles in the complex plane in the standard Euclidean metric, and are easier to compute than known similar…
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 define a new average - termed the resolvent average - for positive semidefinite matrices. For positive definite matrices, the resolvent average enjoys self-duality and it interpolates between the harmonic and the arithmetic averages,…
The smallest nonzero eigenvalue of the normalized Laplacian matrix of a graph has been extensively studied and shown to have many connections to properties of the graph. We here study a generalization of this eigenvalue, denoted $\lambda(G,…
Lattices are a popular field of study in mathematical research, but also in more practical areas like cryptology or multiple-input/multiple-output (MIMO) transmission. In mathematical theory, most often lattices over real numbers are…
The eigenvalue spacing of a uniformly chosen random finite unipotent matrix in its permutation action on lines is studied. We obtain bounds for the mean number of eigenvalues lying in a fixed arc of the unit circle and offer an approach…
The generalized eigenvalue problem (GEP) serves as a cornerstone in a wide range of applications in numerical linear algebra and scientific computing. However, traditional approaches that aim to maximize the classical Rayleigh quotient…
Some extremely low-dimensional yet crucial geometric eigen-lengths often determine the success of some geometric tasks. For example, the height of an object is important to measure to check if it can fit between the shelves of a cabinet,…
This thesis deals with the geometric and integrable aspects associated with random matrix models. Its purpose is to provide various applications of random matrix theory, from algebraic geometry to partial differential equations of…
Equivariant neural networks play a pivotal role in analyzing datasets with symmetry properties, particularly in complex data structures. However, integrating equivariance with Markov properties presents notable challenges due to the…
We introduce a general method for transforming the equations of motion following from a Das-Jevicki-Sakita Hamiltonian, with boundary conditions, into a boundary value problem in one-dimensional quantum mechanics. For the particular case of…
The term interlacing refers to systematic inequalities between the sequences of eigenvalues of two operators defined on objects related by a specific oper- ation. In particular, knowledge of the spectrum of one of the objects then implies…
Recently, Gottlob, Lee, Valiant, and Valiant (GLVV) presented an output size bound for join queries with functional dependencies (FD), based on a linear program on polymatroids. GLVV bound strictly generalizes the bound of Atserias, Grohe…
Joint network topology inference represents a canonical problem of jointly learning multiple graph Laplacian matrices from heterogeneous graph signals. In such a problem, a widely employed assumption is that of a simple common component…
In this paper, we present a unified analysis of matrix completion under general low-dimensional structural constraints induced by {\em any} norm regularization. We consider two estimators for the general problem of structured matrix…