相关论文: Nodal domain theorem of signed hypergraphs

Spatial autocorrelation and spatial heterogeneity widely exist in spatial data, which make the traditional machine learning model perform badly. Spatial domain generalization is a spatial extension of domain generalization, which can…

We establish several new relations between the discrete transition operator, the continuous Laplacian and the averaging operator associated with combinatorial and metric graphs. It is shown that these operators can be expressed through each…

We present a generalization of graph convolutional networks by generalizing the diffusion operation underlying this class of graph neural networks. These sheaf neural networks are based on the sheaf Laplacian, a generalization of the graph…

Nodal sets of eigenfunctions of elliptic operators on compact manifolds have been studied extensively over the past decades. In this note, we initiate the study of nodal sets of eigenfunctions of hypoelliptic operators on compact manifolds,…

We study the symmetry properties of the spectra of normalized Laplacians on signed graphs. We find a new machinery that generates symmetric spectra for signed graphs, which includes bipartiteness of unsigned graphs as a special case.…

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…

We propose a generalization of transformer neural network architecture for arbitrary graphs. The original transformer was designed for Natural Language Processing (NLP), which operates on fully connected graphs representing all connections…

In a paper by Nishikawa and Motter, a quantity called the normalized spread of the Laplacian eigenvalues is used to measure the synchronizability of certain network dynamics. Through simulations, and without theoretical validation, it is…

It is conjectured that the Laplacian spectrum of a graph is majorized by its conjugate degree sequence. In this paper, we prove that this majorization holds for a class of graphs including trees. We also show that a generalization of this…

Let $G$ be a connected undirected graph with $n$, $n\ge 3$, vertices and $m$ edges. Denote by $\rho_1 \ge \rho_2 \ge \cdots > \rho_n =0$ the normalized Laplacian eigenvalues of $G$. Upper and lower bounds of $\rho_i$, $i=1,2,\ldots , n-1$,…

We consider a combinatorial Laplace operator on a sequence of discrete graphs which approximates the m-dimensional torus when the discretization parameter tends to infinity. We establish a polyhomogeneous expansion of the resolvent trace…

The study of Markov chains on discrete spaces, such as digraphs, has captivated mathematicians in recent decades due to its interconnectedness with topology, geometry, dynamics, spectral theory, and differential equations. Furthermore,…

For a $k$-uniform hypergraph $H$, we obtain some trace formulas for the Laplacian tensor of $H$, which imply that $\sum_{i=1}^nd_i^s$ ($s=1,\ldots,k$) is determined by the Laplacian spectrum of $H$, where $d_1,\ldots,d_n$ is the degree…

In this short note we provide a relatively simple proof of the Erd\H{o}s-Hajnal conjecture for families of finite (hyper-)graphs without the $k$-order property. It was originally proved by M. Malliaris and S. Shelah in "Regularity lemmas…

The purpose of this paper is to generalize a very famous result on products of normal operators, due to I. Kaplansky. The context of generalization is that of bounded hyponormal and unbounded normal operators on complex separable Hilbert…

In this article, we extend the notion of the Laplacian spread to simple directed graphs (digraphs) using the restricted numerical range. First, we provide Laplacian spread values for several families of digraphs. Then, we prove sharp upper…

This paper deals with dynamical networks for which the relations between node signals are described by proper transfer functions and external signals can influence each of the node signals. We are interested in graph-theoretic conditions…

To address the peculiarities of directed and/or signed graphs, new Laplacian operators have emerged. For instance, in the case of directionality, we encounter the magnetic operator, dilation (which is underexplored), operators based on…

Let d = (d1, d2, ..., dn) be a vector of non-negative integers with even sum. We prove some basic facts about the structure of a random graph with degree sequence d, including the probability of a given subgraph or induced subgraph.…

We introduce an abstract framework for the study of clustering in metric graphs: after suitably metrising the space of graph partitions, we restrict Laplacians to the clusters thus arising and use their spectral gaps to define several…