Related papers: Nodal domain theorem of signed hypergraphs

We study the Laplace operator on domains subject to Dirichlet or Neumann boundary conditions. We show that these operators admit a bounded $H^{\infty}$-functional calculus on weighted Sobolev spaces, where the weights are powers of the…

Incidence-based generalizations of cycle covers, called contributors, extend the Harary-Sachs coefficient theorem for characteristic polynomials of the adjacency matrix of graphs. All minors of the Laplacian resulting from an integer matrix…

We introduce a notion of a noncommutative function defined on a domain of $d$-tuples of bounded operators on an infinite dimensional Hilbert space. Inverse and implicit function theorems in this setting are established. When these…

In this paper, we introduce three operations on hypergraphs by using tensors. We show that these three formulations are equivalent and we commonly call them as the tensor join. We show that any hypergraph can be viewed as a tensor join of…

We propose an algebraic framework for generalized graph Laplacians which unifies the study of resistor networks, the critical group, and the eigenvalues of the Laplacian and adjacency matrices. Given a graph with boundary $G$ together with…

We prove sharp upper bounds for sums of eigenvalues (and other spectral functionals) of Laplace-like operators, including bi-Laplacian and fractional Laplacian. We show that among linear images of a highly symmetric domain, our spectral…

In graph neural networks (GNNs), both node features and labels are examples of graph signals, a key notion in graph signal processing (GSP). While it is common in GSP to impose signal smoothness constraints in learning and estimation tasks,…

We are concerned in this paper with the real eigenfunctions of Schr\"odinger operators. We prove an asymptotic upper bound for the number of their nodal domains, which implies in particular that the inequality stated in Courant's theorem is…

This paper studies signed graphs with possible outer-edges. We introduce and investigate the chain group, the boundary operator, the co-boundary operator, the flow group, the tension group, the homology group, the cohomology group, with…

This paper deals with spectral graph theory issues related to questions of monotonicity and comparison of eigenvalues. We consider finite directed graphs with non symmetric edge weights and we introduce a special self-adjoint operator as…

Concerning the Laplace operator with homogeneous Dirichlet boundary conditions, the classical notion of isospectrality assumes that two domains are related when they give rise to the same spectrum. In two dimensions, non isometric,…

We prove a central limit theorem for the components of the eigenvectors corresponding to the $d$ largest eigenvalues of the normalized Laplacian matrix of a finite dimensional random dot product graph. As a corollary, we show that for…

Locally checkable labeling problems (LCLs) form the foundation of the modern theory of distributed graph algorithms. First introduced in the seminal paper by Naor and Stockmeyer [STOC 1993], these are graph problems that can be described by…

Signal processing on graphs is a recent research domain that aims at generalizing classical tools in signal processing, in order to analyze signals evolving on complex domains. Such domains are represented by graphs, for which one can…

Controlling real-world networked systems, including ecological, biomedical, and engineered networks that exhibit higher-order interactions, remains challenging due to inherent nonlinearities and large system scales. Despite extensive…

In this paper spectral theorems for not necessarily continuous normal and self-adjoint random operators on a complex separable Hilbert space are proved.

Spectral graph convolutional networks are generalizations of standard convolutional networks for graph-structured data using the Laplacian operator. A common misconception is the instability of spectral filters, i.e. the impossibility to…

We prove some rigidity and classification results for graphs with prescribed mean curvature and locally constant Dirichlet and Neumann data, for instance as they appear in capillarity problems. We consider domains in Riemannian manifolds,…

In this note we elaborate on some notions of surface area for discrete graphs which are closely related to the inverse degree. These notions then naturally lead to associated connectivity measures of graphs and to the definition of a…

A sign is introduced in the usual Laplacian on graphs and the corresponding analogue of the isoperimetric constant for this Laplacian is presented, i.e. a geometric quantity which enables to bound from above and below the first eigenvalue.…