Related papers: Substructure Analysis and Cycle Enumeration Method…
A metrized graph is a compact singular 1-manifold endowed with a metric. A given metrized graph can be modelled by a family of weighted combinatorial graphs. If one chooses a sequence of models from this family such that the vertices become…
Learning the graph Laplacian from observed data is one of the most investigated and fundamental tasks in Graph Signal Processing (GSP). Different variants of the Laplacian, such as the combinatorial, signless or signed Laplacians have been…
We determine and explicitly parametrize the isomorphism classes of nonassociative quaternion algebras over a field of characteristic different from two, as well as the isomorphism classes of nonassociative cyclic algebras of odd prime…
A graph is called "Laplacian integral" if the eigenvalues of its Laplacian matrix are all integers. We investigate the subset of these graphs whose Laplacian is furthermore diagonalized by a matrix with entries coming from a fixed set, in…
We provide upper and lower bounds on the smallest eigenvalue of grounded Laplacian matrices (which are matrices obtained by removing certain rows and columns of the Laplacian matrix of a given graph). The gap between the upper and lower…
The Laplacian eigenvalues of a network play an important role in the analysis of many structural and dynamical network problems. In this paper, we study the relationship between the eigenvalue spectrum of the normalized Laplacian matrix and…
In data science, hypergraphs are natural models for data exhibiting multi-way relations, whereas graphs only capture pairwise. Nonetheless, many proposed hypergraph neural networks effectively reduce hypergraphs to undirected graphs via…
We consider the W-extended logarithmic minimal model WLM(p,p'). As in the rational minimal models, the so-called fundamental fusion algebra of WLM(p,p') is described by a simple graph fusion algebra. The fusion matrices in the regular…
Restrictions of incidence-preserving path maps produce an oriented hypergraphic All Minors Matrix-tree Theorems for Laplacian and adjacency matrices. The images of these maps produce a locally signed graphic, incidence generalization, of…
Pseudo-hermitian matrices are matrices hermitian with respect to an indefinite metric. They can be thought of as the truncation of pseudo-hermitian operators, defined over some Krein space, together with the associated metric, to a finite…
We consider a Laplacian on periodic discrete graphs. Its spectrum consists of a finite number of bands. In a class of periodic 1-forms, i.e., functions defined on edges of the periodic graph, we introduce a subclass of minimal forms with a…
The inverse eigenvalue problem of a graph $G$ studies the possible spectra of matrices associated with $G$, including as an important subproblem the possible nullities of such a matrix. Much research in this area to date has focused only on…
For a simple and connected graph, a new graph invariant $s_{\alpha}^{*}(G)$, defined as the sum of powers of the eigenvalues of the normalized Laplacian matrix, has been introduced by Bozkurt and Bozkurt in [7]. Lower and upper bounds have…
An oriented hypergraph is an oriented incidence structure that allows for the generalization of graph theoretic concepts to integer matrices through its locally signed graphic substructure. The locally graphic behaviors are formalized in…
We present a geometric setting for the differential Galois theory of $G$-invariant connections with parameters. As an application of some classical results on differential algebraic groups and Lie algebra bundles, we see that the Galois…
We present an iterative algorithm for computing an invariant subspace associated with the algebraically smallest eigenvalues of a large sparse or structured Hermitian matrix A. We are interested in the case in which the dimension of the…
Let $G$ be a connected simple graph on $n$ vertices. Let $\mathcal{L}(G)$ be the normalized Laplacian matrix of $G$ and $\rho_{n-1}(G)$ be the second least eigenvalue of $\mathcal{L}(G)$. Denote by $\nu(G)$ the independence number of $G$.…
We first obtain the most general and compact parametrization of the unitary transformation diagonalizing any 3 by 3 hermitian matrix H, as a function of its elements and eigenvalues. We then study a special class of fermion mass matrices,…
Conjugation covariants of matrices are applied to study the real algebraic variety consisting of complex Hermitian matrices with a bounded number of distinct eigenvalues. A minimal generating system of the vanishing ideal of degenerate…
For a given graph $G$, we aim to determine the possible realizable spectra for a generalized (or sometimes referred to as a weighted) Laplacian matrix associated with $G$. This new specialized inverse eigenvalue problem is considered for…