Related papers: Discrete quantitative nodal theorem

Let $G$ be a simple, connected graph on $n$ vertices, and further assume that $G$ has disjoint cycles. Let $h$ be a real symmetric matrix supported on $G$ (for example, a discrete Schr\"odinger operator). The eigenvalues of $h$ are ordered…

Let $G$ be a graph, and let $\lambda(G)$ denote the smallest eigenvalue of $G$. First, we provide an upper bound for $\lambda(G)$ based on induced bipartite subgraphs of $G$. Consequently, we extract two other upper bounds, one relying on…

A \emph{locally irregular graph} is a graph whose adjacent vertices have distinct degrees. We say that a graph $G$ can be decomposed into $k$ locally irregular subgraphs if its edge set may be partitioned into $k$ subsets each of which…

In this article, we introduce a geometric and a spectral preorder relation on the class of weighted graphs with a magnetic potential. The first preorder is expressed through the existence of a graph homomorphism respecting the magnetic…

It is an important feature of our existing physical theories that observables generate one-parameter groups of transformations. In classical Hamiltonian mechanics and quantum mechanics, this is due to the fact that the observables form a…

The combination of words ``discrete curvature'' is only an apparent contradiction. In this survey we describe curvature notions associated with polygons, polyhedral surfaces, and with abstract polyhedral manifolds. Several theorems about…

In this paper, we derive Li-Yau inequality for unbounded Laplacian on complete weighted graphs with the assumption of the curvature-dimension inequality $CDE'(n,K)$, which can be regarded as a notion of curvature on graphs. Furthermore, we…

The main purpose of this article is to introduce a comprehensive, unified theory of the geometry of all connections. We show that one can study a connection via a certain, closely associated second-order differential equation. One of the…

We propose a new Graph Neural Network that combines recent advancements in the field. We give theoretical contributions by proving that the model is strictly more general than the Graph Isomorphism Network and the Gated Graph Neural…

The original contributions of this paper are twofold: a new understanding of the influence of noise on the eigenvectors of the graph Laplacian of a set of image patches, and an algorithm to estimate a denoised set of patches from a noisy…

This is the first in a series of six articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. Many of…

We show how 'test' vector fields may be used to give lower bounds for the Cheeger constant of a Euclidean domain (or Riemannian manifold with boundary), and hence for the lowest eigenvalue of the Dirichlet Laplacian on the domain. Also, we…

Nonlinear spectral graph theory is an extension of the traditional (linear) spectral graph theory and studies relationships between spectral properties of nonlinear operators defined on a graph and topological properties of the graph…

We prove a Riemann-Roch theorem for real divisors on edge-weighted graphs over the reals, extending the result of Baker and Norine for integral divisors on graphs with multiple edges.

In this paper we show that the $d$-dimensional algebraic connectivity of an arbitrary graph $G$ is bounded above by its $1$-dimensional algebraic connectivity, i.e., $a_d(G) \leq a_1(G)$, where $a_1(G)$ corresponds the well-studied second…

The Cheeger constant of a graph is the smallest possible ratio between the size of a subgraph and the size of its boundary. It is well known that this constant must be at least $\frac{\lambda_1}{2}$, where $\lambda_1$ is the smallest…

In this paper we investigate the behavior of the eigenvalues of the Dirichlet Laplacian on sets in $\mathbb{R}^N$ whose first eigenvalue is close to the one of the ball with the same volume. In particular in our main Theorem we prove that,…

For a given infinite connected graph $G=(V,E)$ and an arbitrary but fixed conductance function $c$, we study an associated graph Laplacian $\Delta_{c}$; it is a generalized difference operator where the differences are measured across the…

We prove a pointwise ergodic theorem for quasi-probability-measure-preserving (quasi-pmp) locally countable measurable graphs, equivalently, Schreier graphs of quasi-pmp actions of countable groups. For ergodic graphs, the theorem gives an…

Let G be a simple graph on $n$ vertices and $e(G)$ edges. Consider $Q(G) = D + A$ as the signless Laplacian of $G$, where $A$ is the adjacency matrix and $D$ is the diagonal matrix of the vertices degree of $G$. Let $q_1(G)$ and $q_2(G)$ be…