Related papers: Neumann Domains on Quantum Graphs
The spectral properties of signed directed graphs, which may be naturally obtained by assigning a sign to each edge of a directed graph, have received substantially less attention than those of their undirected and/or unsigned counterparts.…
Let $1 \leq k \leq n$ be a positive integer. A {\em nonnegative signed $k$-subdominating function} is a function $f:V(G) \rightarrow \{-1,1\}$ satisfying $\sum_{u\in N_G[v]}f(u) \geq 0$ for at least $k$ vertices $v$ of $G$. The value…
Determining and analyzing the spectra of graphs is an important and exciting research topic in theoretical computer science. The eigenvalues of the normalized Laplacian of a graph provide information on its structural properties and also on…
We use the theory of graph limits to study several quasi-random properties, mainly dealing with various versions of hereditary subgraph counts. The main idea is to transfer the properties of (sequences of) graphs to properties of graphons,…
We give inequalities relating the eigenvalues of the adjacency matrix and the Laplacian of a graph, and its minimum and maximum degrees. The results are applied to derive new conditions for quasi-randomness of graphs.
Let $(n^+, n^0, n^-)$ denote the inertia of a graph $G$ with $n$ vertices. Nordhaus-Gaddum bounds are known for inertia, except for an upper bound for $n^-$. We conjecture that for any graph \[ n^-(G) + n^-(\bar{G}) \le 1.5(n - 1), \] and…
We address two fundamental questions about graph neural networks (GNNs). First, we prove that several important graph properties cannot be computed by GNNs that rely entirely on local information. Such GNNs include the standard message…
Given a Laplace eigenfunction on a surface, we study the distribution of its extrema on the nodal domains. It is classically known that the absolute value of the eigenfunction is asymptotically bounded by the 4-th root of the eigenvalue. It…
A one-parameter random matrix model is proposed for describing the statistics of the local amplitudes and phases of electron eigenfunctions in a mesoscopic quantum dot in an arbitrary magnetic field. Comparison of the statistics obtained…
We prove the Pleijel theorem in non-collapsed RCD spaces, providing an asymptotic upper bound on the number of nodal domains of Laplacian eigenfunctions. As a consequence, we obtain that the Courant nodal domain theorem holds except at most…
A factor-graph representation of quantum-mechanical probabilities (involving any number of measurements) is proposed. Unlike standard statistical models, the proposed representation uses auxiliary variables (state variables) that are not…
This thesis deals with Partial Differential Equations in Several Complex Variables and especially focuses on a general estimate for the $\bar\partial$-Neumann problem on a domain which is $q$-pseudoconvex or $q$-pseudoconcave at a boundary…
We discuss Neumann problems for self-adjoint Laplacians on (possibly infinite) graphs. Under the assumption that the heat semigroup is ultracontractive we discuss the unique solvability for non-empty subgraphs with respect to the vertex…
We study spectral stability of the $\bar\partial$-Neumann Laplacian on a bounded domain in $\mathbb{C}^n$ when the underlying domain is perturbed. In particular, we establish upper semi-continuity properties for the variational eigenvalues…
We analyze the behavior of the eigenvalues and eigenfunctions of the Laplace operator with homogeneous Neumann boundary conditions when the domain is perturbed. We focus on exterior perturbations of the domain, that is, the limit domain is…
Random planar graphs have been the subject of much recent work. Many basic properties of the standard uniform random planar graph P_{n}, by which we mean a graph chosen uniformly at random from the set of all planar graphs with vertex set…
We study the location of the spectrum of the Laplacian on compact metric graphs with complex Robin-type vertex conditions, also known as $\delta$ conditions, on some or all of the graph vertices. We classify the eigenvalue asymptotics as…
A statistical model M is a family of probability distributions, characterised by a set of continuous parameters known as the parameter space. This possesses natural geometrical properties induced by the embedding of the family of…
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…
We consider two-dimensional N=(2,2) supersymmetric gauge theory on discretized Riemann surfaces. We find that the discretized theory can be efficiently described by using graph theory, where the bosonic and fermionic fields are regarded as…