Related papers: The spectrum of the averaging operator on a networ…
For a network consisting of a graph with edge weights prescribed by a given conductance function $c$, we consider the effects of replacing these weights with a new function $b$ that satisfies $b \leq c$ on each edge. In particular, we…
Here we introduce connectivity operators, namely, diffusion operators, general Laplacian operators, and general adjacency operators for hypergraphs. These operators are generalisations of some conventional notions of apparently different…
Metric networks are network-shaped, one-dimensional structures on which one can solve differential equations to simulate a wide range of physical systems including conjugated molecules, photonic crystals, quantum mechanics in waveguide…
We consider normalized Laplacians and their perturbations by periodic potentials (Schr\"odinger operators) on periodic discrete graphs. The spectrum of the operators consists of an absolutely continuous part (a union of a finite number of…
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 consider a metric graph $\mathcal{G}$ made of two graphs $\mathcal{G}_1$ and $\mathcal{G}_2$ attached at one point. We derive a formula relating the spectral determinant of the Laplace operator $S_\mathcal{G}(\gamma)=\det(\gamma-\Delta)$…
The spectrum of network is an important tool to study the function and dynamic properties of network, and graph operation and product is an effective mechanism to construct a specific local and global topological structure. In this study, a…
We establish several new relations between the discrete transition operator, the continuous Laplacian and the averaging operator associated with combinatorial and metric graphs. It is shown that these operators can be expressed through each…
The $p$-Laplacian for graphs, as well as the vertex Laplace operator and the hyperedge Laplace operator for the general setting of oriented hypergraphs, are generalized. In particular, both a vertex $p$-Laplacian and a hyperedge…
A graph $G = (V, E)$ of bounded degree has an adjacency operator~$A$ which acts on the Hilbert space $\ell^2(V)$. There are different kinds of measures of interest on the spectrum $\Sigma (A)$ of $A$. In particular, each vector $\xi \in…
Here we study the spectral properties of an underlying weighted graph of a non-uniform hypergraph by introducing different connectivity matrices, such as adjacency, Laplacian and normalized Laplacian matrices. We show that different…
It is known that electrical networks with resistors are related to the Laplace operator and random walk on weighted graphs. In this paper we consider more general electrical networks with coils, capacitors, and resistors. We give two…
The main goal of this paper is to build a measurable analogue to the theory of weighted networks on infinite graphs. Our basic setting is an infinite $\sigma$-finite measure space $(V, \mathcal B, \mu)$ and a symmetric measure $\rho$ on…
The aim of the present paper is to analyse the spectrum of Laplace and Dirac type operators on metric graphs. In particular, we show for equilateral graphs how the spectrum (up to exceptional eigenvalues) can be described by a natural…
In this work we introduce a concept of complexity for undirected graphs in terms of the spectral analysis of the Laplacian operator defined by the incidence matrix of the graph. Precisely, we compute the norm of the vector of eigenvalues of…
The Schr\"odinger operator on a metric tree is a family of ordinary differential operators on its edges complemented by certain matching conditions at the vertices. The regular trees are highly symmetric. This allows one to construct an…
In graph signal processing, the graph adjacency matrix or the graph Laplacian commonly define the shift operator. The spectral decomposition of the shift operator plays an important role in that the eigenvalues represent frequencies and the…
In this paper, we treat some weighted line digraphs which are induced by a connected and undirected graph. For a given graph $G$, the adjacency matrix of the weighted line digraph $W$ is determined by a boundary operator from an arc-based…
The theory of random sets is demonstrated to prove useful for the theory of random operators. A random operator is here defined by requiring the graph to be a random set. It is proved that the spectrum and the set of eigenvalues of random…
We generalize the normalized combinatorial Laplace operator for graphs by defining two Laplace operators for hypergraphs that can be useful in the study of chemical reaction networks. We also investigate some properties of their spectra.