Related papers: New relations between discrete and continuous tran…
We first develop a general framework for Laplace operators defined in terms of the combinatorial structure of a simplicial complex. This includes, among others, the graph Laplacian, the combinatorial Laplacian on simplicial complexes, the…
We develop eigenvalue estimates for the Laplacians on discrete and metric graphs using different types of boundary conditions at the vertices of the metric graph. Via an explicit correspondence of the equilateral metric and discrete graph…
We observe that the Laplacian of a random graph G on N vertices represents and explicitly solvable model in the limit of infinitely increasing N. Namely, we derive recurrent relations for the limiting averaged moments of the adjacency…
The processing of signals on simplicial and cellular complexes defined by nodes, edges, and higher-order cells has recently emerged as a principled extension of graph signal processing for signals supported on more general topological…
This article introduces a new approach to discrete curvature based on the concept of effective resistances. We propose a curvature on the nodes and links of a graph and present the evidence for their interpretation as a curvature. Notably,…
This is an introduction to graph theory, from a geometric and analytic viewpoint. A finite graph $X$ is described by its adjacency matrix $d\in M_N(0,1)$, which can be thought of as being a kind of discrete Laplacian, and we first discuss…
In network science, the interplay between dynamical processes and the underlying topologies of complex systems has led to a diverse family of models with different interpretations. In graph signal processing, this is manifested in the form…
A periodic linear graph operator acts on states (functions) defined on the vertices of a graph equipped with a free translation action. Fourier transform with respect to the translation group reveals the central spectral objects, Bloch and…
Applying a well-known theorem due to Eidelheit, we give a short proof of the surjectivity of the combinatorial Laplacian on connected locally finite undirected simplicial graph $G$ with countably infinite vertex set $V$, established by…
We define the harmonic evolution of states of a graph by iterative application of the harmonic operator (Laplacian over $Z_2$). This provides graphs with a new geometric context and leads to a new tool to analyze them. The digraphs of…
Focusing on coupling between edges, we generalize the relationship between the normalized graph Laplacian and random walks on graphs by devising an appropriate normalization for the Hodge Laplacian -- the generalization of the graph…
Operator learning has been highly successful for continuous mappings between infinite-dimensional spaces, such as PDE solution operators. However, many operators of interest-including differential operators-are discontinuous or set-valued,…
For a compact, connected metric graphs with a boundary that consists of $k$ vertices, we prove that an arbitrary symmetric $k\times k$ matrix with real entries can be realized as the Dirichlet-to-Neumann operator for the Laplacian plus a…
We define a number of natural (from geometric and combinatorial points of view) deformation spaces of valuations on finite graphs, and study functions over these deformation spaces. These functions include both direct metric invariants…
A metrized graph is a finite weighted graph whose edges are thought of as line segments. In this expository paper, we study the Laplacian operator on a metrized graph and some important functions related to it, including the ``j-function'',…
We introduce a transfer matrix method for the spectral analysis of discrete Hermitian operators with locally finite hopping. Such operators can be associated with a locally finite graph structure and the method works in principle on any…
We consider a combinatorial Laplace operator on a sequence of discrete graphs which approximates the m-dimensional torus when the discretization parameter tends to infinity. We establish a polyhomogeneous expansion of the resolvent trace…
We express the tau constant of a metrized graph in terms of the discrete Laplacian matrix and its pseudo inverse.
On finite metric graphs the set of all realizations of the Laplace operator in the edgewise defined $L^2$-spaces are studied. These are defined by coupling boundary conditions at the vertices most of which define non-self-adjoint operators.…
Nowadays a great attention has been focused on the discrete fractional Laplace operator as the natural counterpart of the continuous one. In this paper, we discretize the fractional Laplace operator $(-\Delta)^{s}$ for an arbitrary finite…