Related papers: Spectrally arbitrary pattern extensions
We study some spectral properties of a matrix that is constructed as a combination of a Laplacian and an adjacency matrix of simple graphs. The matrix considered depends on a positive parameter, as such we consider the implications in…
In this work, we present a new approach for constructing models for correlation matrices with a user-defined graphical structure. The graphical structure makes correlation matrices interpretable and avoids the quadratic increase of…
The spectral properties of signed directed graphs, which may be naturally obtained by assigning a sign to each edge of a directed graph, have received substantially less attention than those of their undirected and/or unsigned counterparts.…
Pseudospectra and structured pseudospectra are important tools for the analysis of matrices. Their computation, however, can be very demanding for all but small matrices. A new approach to compute approximations of pseudospectra and…
Multiplication of a sparse matrix with another (dense or sparse) matrix is a fundamental operation that captures the computational patterns of many data science applications, including but not limited to graph algorithms, sparsely connected…
The standard approach for computing the trace of the inverse of a very large, sparse matrix $A$ is to view the trace as the mean value of matrix quadratures, and use the Monte Carlo algorithm to estimate it. This approach is heavily used in…
The notion of a spectral geometry on a compact metric space X is introduced. This notion serves as a discrete approximation of X motivated by the notion of a spectral triple from non-commutative geometry. A set of axioms charaterising…
When constructing finite frames for a given application, the most important consideration is the spectrum of the frame operator. Indeed, the minimum and maximum eigenvalues of the frame operator are the optimal frame bounds, and the frame…
Two dimensional matrices with binary (0/1) entries are a common data structure in many research fields. Examples include ecology, economics, mathematics, physics, psychometrics and others. Because the columns and rows of these matrices…
We consider the dynamics of bodies with "active" microstructure described by vector-valued phase fields. For waves with time-varying amplitude, the associated evolution equation involves a matrix that can be non-normal, depending on the…
The iterative method of Sinkhorn allows, starting from an arbitrary real matrix with non-negative entries, to find a so-called 'scaled matrix' which is doubly stochastic, i.e. a matrix with all entries in the interval (0, 1) and with all…
Spectral hypergraph theory mainly concerns using hypergraph spectra to obtain structural information about the given hypergraphs. The study of cospectral hypergraphs is important since it reveals which hypergraph properties cannot be…
We characterize the spectrum (and its parts) of operators which can be represented as G=A+BC for a simpler operator A and a structured perturbation BC. The interest in this kind of perturbations is motivated, e.g., by perturbations of the…
We derive an efficient way to obtain generating functions of bipartite maps of arbitrary genus and boundary length using a spectral curve as initial data for the framework of topological recursion. Based on an earlier result of Chapuy and…
Given a plane graph $G$ (i.e., a planar graph with a fixed planar embedding) and a simple cycle $C$ in $G$ whose vertices are mapped to a convex polygon, we consider the question whether this drawing can be extended to a planar…
A necessary and sufficient condition is presented for a graph algebra to satisfy a bracketing identity. The associative spectrum of an arbitrary graph algebra is shown to be either constant or exponentially growing.
In this paper, we introduce a matrix for a mixed graph, called the integrated adjacency matrix. This matrix uniquely determines a mixed graph, as long as the indices of the matrix are specified. Additionally, we associate an (undirected)…
Two examples of spectral triples with non-integer dimension spectrum are considered. These triples involve commutative C*-algebras. The first example has complex dimension spectrum and trivial differential algebra. The other is a parameter…
It is possible, for homogeneously broadened lines, to excite selectively the response signals, which are orders of magnitude narrower than the original lines. The new type of echo, which allows detecting such signals, and the formalism,…
We derive a message passing method for computing the spectra of locally tree-like networks and an approximation to it that allows us to compute closed-form expressions or fast numerical approximates for the spectral density of random graphs…