Related papers: Subordinacy Theory on Star-Like Graphs
We use topological methods to study various semicontinuity properties of spectra of singular points of plane algebraic curves and of polynomials in two variables at infinity. Using Seifert forms and the Tristram--Levine signatures of links,…
We give some properties of skew spectrum of a graph, especially, we answer negatively a problem concerning the skew characteristic polynomial and matching polynomial in [M. Cavers et al., Skew-adjacency matrices of graphs, Linear Algebra…
We discuss the appearance of Jacobi automorphic forms in the theory of superconformal vertex algebras, explaining it by way of supercurves and formal geometry. We touch on related topics such as Ramanujan's differential equations for…
The partition of graphs into "nice" subgraphs is a central algorithmic problem with strong ties to matching theory. We study the partitioning of undirected graphs into same-size stars, a problem known to be NP-complete even for the case of…
Let $G$ be a graph of order $n$ and $\mu$ be an adjacency eigenvalue of $G$ with multiplicity $k\geq 1$. A star complement $H$ for $\mu$ in $G$ is an induced subgraph of $G$ of order $n-k$ with no eigenvalue $\mu$, and the vertex subset…
We consider the 1D periodic Jacobi matrices. The spectrum of this operator is purely absolutely continuous and consists of intervals separated by gaps. We solve the inverse problem (including characterization) in terms of vertical slits on…
A matrix polynomial is a polynomial in a complex variable $\lambda$ with coefficients in $n \times n$ complex matrices. The spectral curve of a matrix polynomial $P(\lambda)$ is the curve $\{ (\lambda, \mu) \in \mathbb{C}^2 \mid…
Quantum graphs can be extended to scattering systems when they are connected by leads to infinity. It is shown that for certain extensions, the scattering matrices of isospectral graphs are conjugate to each other and their poles…
We present progress on the problem of asymptotically describing the adjacency eigenvalues of random and complete uniform hypergraphs. There is a natural conjecture arising from analogy with random matrix theory that connects these spectra…
Graph-based methods have been quite successful in solving unsupervised and semi-supervised learning problems, as they provide a means to capture the underlying geometry of the dataset. It is often desirable for the constructed graph to…
We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…
Using a simple deterministic model for the Internet graph we show that the eigenvalue power law distribution for its adjacency matrix is a direct consequence of the degree distribution and that the graph must contain many star subgraphs.
Recent work of Lazarovich provides necessary and sufficient conditions on a graph L for there to exist a unique simply-connected (k,L)-complex. The two conditions are symmetry properties of the graph, namely star-transitivity and…
The spectrum of the normalized graph Laplacian yields a very comprehensive set of invariants of a graph. In order to understand the information contained in those invariants better, we systematically investigate the behavior of this…
We show that trace functions on modules of topological N=2 super vertex algebras give rise to conformal blocks on elliptic supercurves. We show that they satisfy a system of linear partial differential equations with respect to the modular…
Spectral operators of matrices proposed recently in [C. Ding, D.F. Sun, J. Sun, and K.C. Toh, Math. Program. {\bf 168}, 509--531 (2018)] are a class of matrix valued functions, which map matrices to matrices by applying a vector-to-vector…
We provide an introductory review of some topics in spectral theory of Laplacians on metric graphs. We focus on three different aspects: the trace formula, the self-adjointness problem and connections between Laplacians on metric graphs and…
Observability of an array of identical LTI systems with incommensurable output matrices is studied, where an array is called observable when identically zero relative outputs imply synchronized solutions for the individual systems. It is…
Sample correlation matrices are employed ubiquitously in statistics. However, quite surprisingly, little is known about their asymptotic spectral properties for high-dimensional data, particularly beyond the case of "null models" for which…
It is shown that for a given infinite graph $G$ on countably many vertices, and a compact, infinite set of real numbers $\Lambda$ there is a real symmetric matrix $A$ whose graph is $G$ and its spectrum is $\Lambda$. Moreover, the set of…