Results 1  10
of
309,712
SUPERSYMMETRY ON DISCRETE AND METRIC GRAPHS
"... Abstract. The aim of the present paper is to introduce a unified notion of Laplacians on discrete and metric graphs. In order to cover all selfadjoint boundary conditions for the associated metric graph Laplacian, we develop systematically a new type of discrete graph operators acting on a decorate ..."
Abstract
 Add to MetaCart
Abstract. The aim of the present paper is to introduce a unified notion of Laplacians on discrete and metric graphs. In order to cover all selfadjoint boundary conditions for the associated metric graph Laplacian, we develop systematically a new type of discrete graph operators acting on a
Eigenvalue bracketing for discrete and metric graphs
 J. Math. Anal. Appl
"... Abstract. 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 spectrum (also in the “exceptional” values of the m ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
Abstract. 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 spectrum (also in the “exceptional” values
Statistical Analysis of Metric Graph Reconstruction
"... A metric graph is a 1dimensional stratified metric space consisting of vertices and edges or loops glued together. Metric graphs can be naturally used to represent and model data that take the form of noisy filamentary structures, such as street maps, neurons, networks of rivers and galaxies. We co ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
A metric graph is a 1dimensional stratified metric space consisting of vertices and edges or loops glued together. Metric graphs can be naturally used to represent and model data that take the form of noisy filamentary structures, such as street maps, neurons, networks of rivers and galaxies. We
RANKDETERMINING SETS OF METRIC GRAPHS
, 2009
"... A metric graph is a geometric realization of a finite graph by identifying each edge with a real interval. A divisor on a metric graph Î is an element of the free abelian group on Î. The rank of a divisor on a metric graph is a concept appearing in the RiemannRoch theorem for metric graphs (or t ..."
Abstract

Cited by 24 (1 self)
 Add to MetaCart
A metric graph is a geometric realization of a finite graph by identifying each edge with a real interval. A divisor on a metric graph Î is an element of the free abelian group on Î. The rank of a divisor on a metric graph is a concept appearing in the RiemannRoch theorem for metric graphs (or
Brownian Motions on Metric graphs: . . .
, 2010
"... The construction of the paths of all possible Brownian motions (in the sense of [21]) on a half line or a finite interval is reviewed. ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
The construction of the paths of all possible Brownian motions (in the sense of [21]) on a half line or a finite interval is reviewed.
Contraction semigroups on metric graphs
 Analysis on Graphs and its Applications, volume 77 of Proceedings of Symposia in Pure Mathematics
, 2008
"... Dedicated to Volker Enss on the occasion of his 65th birthday ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Dedicated to Volker Enss on the occasion of his 65th birthday
Results 1  10
of
309,712