Related papers: Eigenvalues of Hypergraph Products and Reciprocal …
An oriented hypergraph is an oriented incidence structure that generalizes and unifies graph and hypergraph theoretic results by examining its locally signed graphic substructure. In this paper we obtain a combinatorial characterization of…
We show that the action of conformal vector fields on functions on the sphere determines the spectrum of the Laplacian (or the conformal Laplacian), without further input of information. The spectra of intertwining operators (both…
In this paper, the Laplacian characteristic polynomial of uniform hypergraphs with cut vertices or pendant edges and the Laplacian matching polynomial of uniform hypergraphs are characterized.The multiplicity of the zero Laplacian…
Let $\mathcal{H}$ be a uniform hypergraph. Let $\mathcal{A(H)}$ and $\mathcal{Q(H)}$ be the adjacency tensor and the signless Laplacian tensor of $\mathcal{H}$, respectively. In this note we prove several bounds for the spectral radius of…
We present the spectrum of the (normalized) graph Laplacian as a systematic tool for the investigation of networks, and we describe basic properties of eigenvalues and eigenfunctions. Processes of graph formation like motif joining or…
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…
In this note, we present a structural description of certain connected cographs having $k \geq 2$ main signless Laplacian eigenvalues. This result allows us to characterize the cographs which are quasi-threshold graphs with two main…
Two types of corona products for simple directed graphs are introduced, extending the classical notions from the undirected setting: the vertex-corona and the arc-corona. Their structural and spectral properties are investigated through the…
A number of recent papers have considered signed graph Laplacians, a generalization of the classical graph Laplacian, where the edge weights are allowed to take either sign. In the classical case, where the edge weights are all positive,…
The Laplacian spread of a graph is the difference between the largest eigenvalue and the second-smallest eigenvalue of the Laplacian matrix of the graph. We find that the class of strongly regular graphs attains the maximum of largest…
Heterogeneous graphs can well describe the complex entity relationships in the real world. For example, online shopping networks contain multiple physical types of consumers and products, as well as multiple relationship types such as…
How does coarsening affect the spectrum of a general graph? We provide conditions such that the principal eigenvalues and eigenspaces of a coarsened and original graph Laplacian matrices are close. The achieved approximation is shown to…
The spectral theory of the normalized Laplacian for chemical hypergraphs is further investigated. The signless normalized Laplacian is introduced and it is shown that its spectrum for classical hypergraphs coincides with the spectrum of the…
Contrastive learning has emerged as a premier method for learning representations with or without supervision. Recent studies have shown its utility in graph representation learning for pre-training. Despite successes, the understanding of…
Persistent homology is constrained to purely topological persistence while multiscale graphs account only for geometric information. This work introduces persistent spectral theory to create a unified low-dimensional multiscale paradigm for…
Quantum graphs have attracted attention from mathematicians for some time. A quantum graph is defined by having a Laplacian on each edge of a metric graph and imposing boundary conditions at the vertices to get an eigenvalue problem. A…
The signless Laplacian matrix of a graph $G$ is defined to be the sum of its adjacency matrix and degree diagonal matrix, and its eigenvalues are called $Q$-eigenvalues of $G$. A $Q$-eigenvalue of a graph $G$ is called a $Q$-main eigenvalue…
We give some graph theoretical formulas for the trace $Tr_k(\mathbb {T})$ of a tensor $\mathbb {T}$ which do not involve the differential operators and auxiliary matrix. As applications of these trace formulas in the study of the spectra of…
Spectral graph theory is a captivating area of graph theory that employs the eigenvalues and eigenvectors of matrices associated with graphs to study them. In this paper, we present a collection of $20$ topics in spectral graph theory,…
Dynamical properties of complex networks are related to the spectral properties of the Laplacian matrix that describes the pattern of connectivity of the network. In particular we compute the synchronization time for different types of…