Related papers: Neumann Domains on Quantum Graphs

The paper deals with some spectral properties of (mostly infinite) quantum and combinatorial graphs. Quantum graphs have been intensively studied lately due to their numerous applications to mesoscopic physics, nanotechnology, optics, and…

We consider eigenfunctions of the Laplace-Beltrami operator on special surfaces of revolution. For this separable system, the nodal domains of the (real) eigenfunctions form a checker-board pattern, and their number $\nu_n$ is proportional…

A finite discrete graph is turned into a quantum (metric) graph once a finite length is assigned to each edge and the one-dimensional Laplacian is taken to be the operator. We study the dependence of the spectral gap (the first positive…

We introduce the notion of Benjamini-Schramm convergence for quantum graphs. This notion of convergence, intended to play the role of the already existing notion for discrete graphs, means that the restriction of the quantum graph to a…

We study the spectral statistics of quantum (metric) graphs whose vertices are equipped with preferred orientation vertex conditions. When comparing their spectral statistics to those predicted by suitable random matrix theory ensembles,…

The Dirichlet problem and Dirichlet to Neumann map are analyzed for elliptic equations on a large collection of infinite quantum graphs. For a dense set of continuous functions on the graph boundary, the Dirichlet to Neumann map has values…

We study the nodal deficiency of pairs of Neumann eigenfunctions defined over symmetric dumbbell domains. As the width of the connecting neck shrinks, these eigenfunctions converge to Neumann eigenfunctions defined over the ends of the…

The aim of this paper is to establish a theory of random variables on domains. Domain theory is a fundamental component of theoretical computer science, providing mathematical models of computational processes. Random variables are the…

In this paper we analyze the behavior of solutions of the Neumann problem posed in a thin domain of the type $R^\epsilon = \{(x_1,x_2) \in \R^2 \; | \; x_1 \in (0,1), \, - \, \epsilon \, b(x_1) < x_2 < \epsilon \, G(x_1,…

In this paper, we define the quotinet graphs. In particular, we introduce the boundary quotient graphs, admissible boundary quotient graphs and subgraph boundary qoutient graphs. By the property of the quotient spaces, the boundary…

We introduce and study Laplacians on a finite metric graph endowed with generalized densities, that is, measures of finite mass. One important motivation is that this setting provides a common framework for several interesting classes of…

One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a truly random one. In the context of graphs, Chung, Graham, and Wilson…

We study the $\bar{\partial}_b$-Neumann problem for domains $\Omega$ contained in a strictly pseudoconvex manifold M^{2n+1} whose boundaries are noncharacteristic and have defining functions depending solely on the real and imaginary parts…

Let $G$ be a graph and let $g, f$ be nonnegative integer-valued functions defined on $V(G)$ such that $g(v) \le f(v)$ and $g(v) \equiv f(v) \pmod{2}$ for all $v \in V(G)$. A $(g,f)$-parity factor of $G$ is a spanning subgraph $H$ such that…

This paper treats subelliptic estimates for the $\bar{\partial}$-Neumann problem on a class of domains known as regular coordinate domains. Our main result is that the largest subelliptic gain for a regular coordinate domain is bounded…

Quantum graphity is a background independent model for emergent locality, spatial geometry and matter. The states of the system correspond to dynamical graphs on N vertices. At high energy, the graph describing the system is highly…

Let $(M, g)$ be a closed Riemannian manifold, where g is $C^1$-smooth metric. Consider the sequence of eigenfunctions $u_k$ of the Laplace operator on M. Let $B$ be a ball on $M$. We prove a sharp estimate of the number of nodal domains of…

Quantum graphs are defined by having a Laplacian defined on the edges of a metric graph with boundary conditions on each vertex such that the resulting operator, $\mathbf{L}$, is self-adjoint. We use Neumann boundary conditions although we…

Consider the setting of \emph{randomly weighted graphs}, namely, graphs whose edge weights are chosen independently according to probability distributions with finite support over the non-negative reals. Under this setting, properties of…

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,…