Related papers: A graph discretization of vector Laplace operator
We generalize the notion of Lagrangian subspaces to self-orthogonal subspaces with respect to a (skew-)symmetric form, thus characterizing (skew-)self-adjoint and unitary operators by means of self-ortho-gonal subspaces. By orthogonality…
We consider a non self-adjoint Laplacian on a directed graph with non symmetric weights on edges. We give a criterion for the m-accretiveness and the m-sectoriality of this Laplacian. Our results are based on a comparison of this operator…
The spectrum of the normalized graph Laplacian yields a very comprehensive set of invariants of a graph. In order to understand the information contained in those invariants better, we systematically investigate the behavior of this…
We consider metric graphs with a uniform lower bound on the edge lengths but no further restrictions. We discuss how to describe every local self-adjoint Laplace operator on such graphs by boundary conditions in the vertices given by…
We study combinatorial Laplacians on rectangular subgraphs of $ \epsilon \mathbb{Z}^2 $ that approximate Laplace-Beltrami operators of Riemannian metrics as $ \epsilon \rightarrow 0 $. These laplacians arise as follows: we define the notion…
Given a length function on the edge set of a finite graph, we define a vertex-weight and an edge-weight in terms of it and consider the corresponding graph Laplacian. In this paper, we consider the problem of maximizing the first nonzero…
We consider an arbitrary metric graph, to which we glue another graph with edges of lengths proportional to $\varepsilon$, where $\varepsilon$ is a small positive parameter. On such graph, we consider a general self-adjoint second order…
We investigate an approach for the numerical solution of differential equations which is based on the perfect discretization of actions. Such perfect discretizations show up at the fixed points of renormalization group transformations. This…
In this thesis, we study connections between metric and combinatorial graphs from a Dirichlet space point of view.
Operators are induced on fermion and zeon algebras by the action of adjacency matrices and combinatorial Laplacians on the vector spaces spanned by the graph's vertices. Properties of the algebras automatically give information about the…
In this work we study a linear operator $f$ on a pre-euclidean space $\mathcal{V}$ by using properties of a corresponding graph. Given a basis $\B$ of $\mathcal{V}$, we present a decomposition of $\mathcal{V}$ as an orthogonal direct sum of…
For a given hypergraph, an orientation can be assigned to the vertex-edge incidences. This orientation is used to define the adjacency and Laplacian matrices. In addition to studying these matrices, several related structures are…
We investigate the space complexity of solving linear systems of equations. While all known deterministic or randomized algorithms solving a square system of $n$ linear equations in $n$ variables require $\Omega(\log^2 n)$ space, Ta-Shma…
A scalar field method to obtain transverse solutions of the vector Laplace and Helmholtz equations in spherical coordinates for boundary-value problems with azimuthal symmetry is described. Neither scalar nor vector potentials are used.…
This is the first of two papers on partition functions and the index theory of transversally elliptic operators. In this paper we only discuss algebraic and combinatorial issues related to partition functions. The applications to index…
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…
In this paper authors consider representations of graphs in Hilbert spaces applying a restriction of local scalarity on them. It enables to obtain a theory, similar to the classical theory of representations of graphs in vector spaces. In…
Let G be a finite connected simple graph. We define the moduli space of conformal structures on G. We propose a definition of conformally covariant operators on graphs, motivated by [25]. We provide examples of conformally covariant…
In this partly expository paper we discuss and describe some of our old and recent results on partial orders on the set (m,n)-graphs (i.e. graphs with n vertices and m edges) and some operations on graphs that are monotone with respect to…
Normalized Laplacian matrices of graphs have recently been studied in the context of quantum mechanics as density matrices of quantum systems. Of particular interest is the relationship between quantum physical properties of the density…