We establish several new relations between the discrete transition operator, the continuous Laplacian and the averaging operator associ-ated with combinatorial and metric graphs. It is shown that these oper-ators can be expressed through each other using explicit expressions. In particular, we show that the averaging operator is closely related with the solutions of the associated wave equation. The machinery used al-lows one to study a class of infinite graphs without assumption on the local finiteness.
Abstract. For a given infinite connected graph G = (V,E) and an arbitrary but fixed conductance func...
Like the adjacency, incidence matrix and other matrices associated with graphs, the Laplacian matrix...
A graph operator is a mapping F : Γ → Γ ′ , where Γ and ...
Laplace operators on metric graphs are considered. It is proven that for compact graphs the spectrum...
Anybody who has ever read a mathematical text of the author would agree that his way of presenting c...
In discrete systems graphs represent a basic tool to study links between agents. There has been rece...
This book contains contributions from the participants of the research group hosted by the ZiF - Cen...
We analyze properties of semigroups generated by Schrödinger operators Δ−V or polyharmonic operators...
This thesis consists of two papers, enumerated by Roman numerals. The main focus is on the spectral ...
AbstractWe develop eigenvalue estimates for the Laplacians on discrete and metric graphs using vario...
Examples are constructed of Laplace-Beltrami operators and graph Laplacians with singular continuous...
Abstract—There are several classes of operators on graphs to consider in deciding on a collection of...
Discussions about different graph Laplacian, mainly normalized and unnormalized versions of graph La...
We study the fourth order differential operator acting on a connected network G along with the squ...
We give a generalization to a continuous setting of the classic Markov chain tree Theorem. In partic...
Abstract. For a given infinite connected graph G = (V,E) and an arbitrary but fixed conductance func...
Like the adjacency, incidence matrix and other matrices associated with graphs, the Laplacian matrix...
A graph operator is a mapping F : Γ → Γ ′ , where Γ and ...
Laplace operators on metric graphs are considered. It is proven that for compact graphs the spectrum...
Anybody who has ever read a mathematical text of the author would agree that his way of presenting c...
In discrete systems graphs represent a basic tool to study links between agents. There has been rece...
This book contains contributions from the participants of the research group hosted by the ZiF - Cen...
We analyze properties of semigroups generated by Schrödinger operators Δ−V or polyharmonic operators...
This thesis consists of two papers, enumerated by Roman numerals. The main focus is on the spectral ...
AbstractWe develop eigenvalue estimates for the Laplacians on discrete and metric graphs using vario...
Examples are constructed of Laplace-Beltrami operators and graph Laplacians with singular continuous...
Abstract—There are several classes of operators on graphs to consider in deciding on a collection of...
Discussions about different graph Laplacian, mainly normalized and unnormalized versions of graph La...
We study the fourth order differential operator acting on a connected network G along with the squ...
We give a generalization to a continuous setting of the classic Markov chain tree Theorem. In partic...
Abstract. For a given infinite connected graph G = (V,E) and an arbitrary but fixed conductance func...
Like the adjacency, incidence matrix and other matrices associated with graphs, the Laplacian matrix...
A graph operator is a mapping F : Γ → Γ ′ , where Γ and ...