Related papers: Nodal domain theorem of signed hypergraphs

In two seminal papers M. Kontsevich introduced graph homology as a tool to compute the homology of three infinite dimensional Lie algebras, associated to the three operads `commutative,' `associative' and `Lie.' We generalize his theorem to…

The classical Loewner's theorem states that operator monotone functions on real intervals are described by holomorphic functions on the upper half-plane. We characterize local order isomorphisms on operator domains by biholomorphic…

We prove a strong form of the hot spots conjecture for a class of domains in $\mathbb{R}^d$ which are a natural generalization of the lip domains of Atar and Burdzy [J. Amer. Math. Soc. 17 (2004), 243-265] in dimension two, as well as for a…

We study the nodal set of eigenfunctions of the Laplace operator on the right angled isosceles triangle. A local analysis of the nodal pattern provides an algorithm for computing the number of nodal domains for any eigenfunction. In…

A new general decomposition theory inspired from modular graph decomposition is presented. This helps unifying modular decomposition on different structures, including (but not restricted to) graphs. Moreover, even in the case of graphs,…

Differential operators acting on functions defined on graphs by different studies do not form a consistent framework for the analysis of real or complex functions in the sense that they do not satisfy the Leibniz rule of any order. In this…

In this paper, we show that equality in Courant's nodal domain theorem can only be reached for a finite number of eigenvalues of the Neumann Laplacian, in the case of an open, bounded and connected set in R n with a C 1,1 boundary. This…

We consider metric graphs with a uniform lower bound on the edge lengths but no further restrictions. We discuss how to describe every local self-adjoint Laplace operator on such graphs by boundary conditions in the vertices given by…

This paper stands at the intersection of two distinct lines of research. One line is "holographic algorithms," a powerful approach introduced by Valiant for solving various counting problems in computer science; the other is "normal factor…

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…

We develop a clear connection between deFinetti's theorem for exchangeable arrays (work of Aldous--Hoover--Kallenberg) and the emerging area of graph limits (work of Lovasz and many coauthors). Along the way, we translate the graph theory…

We are concerned with the analysis of a mean field type equation and its linearization, which is a nonlocal operator, for which we estimate the number of nodal domains for the radial eigenfunctions and the related uniqueness properties.

On finite metric graphs we consider Laplace operators, subject to various classes of non-self-adjoint boundary conditions imposed at graph vertices. We investigate spectral properties, existence of a Riesz basis of projectors and similarity…

Two distinct projections of finite rank $m$ are adjacent if their difference is an operator of rank two or, equivalently, the intersection of their images is $(m-1)$-dimensional. We extend this adjacency relation on other conjugacy classes…

Formal Laplace operators are analyzed for a large class of resistance networks with vertex weights. The graphs are completed with respect to the minimal resistance path metric. Compactness and a novel connectivity hypothesis for the…

We consider the sequence of nodal counts for eigenfunctions of the Laplace-Beltrami operator in two dimensional domains. It was conjectured recently that this sequence stores some information pertaining to the geometry of the domain, and we…

Extending a previous result of the first two authors, we prove a local limit theorem for the joint distribution of subgraph counts in the Erd\H{o}s-R\'{e}nyi random graph $G(n,p)$. This limit can be described as a nonlinear transformation…

We present a unified approach to proving Ramsey-type theorems for graphs with a forbidden induced subgraph which can be used to extend and improve the earlier results of Rodl, Erdos-Hajnal, Promel-Rodl, Nikiforov, Chung-Graham, and…

According to a recent conjecture, isospectral objects have different nodal count sequences. We study generalized Laplacians on discrete graphs, and use them to construct the first non-trivial counter-examples to this conjecture. In…

Learning graphs from sets of nodal observations represents a prominent problem formally known as graph topology inference. However, current approaches are limited by typically focusing on inferring single networks, and they assume that…