# Solving Boundary Value Problems on Networks Using Equilibrium Measures

@article{Bendito2000SolvingBV, title={Solving Boundary Value Problems on Networks Using Equilibrium Measures}, author={Enrique Bendito and {\'A}ngeles Carmona and Andr{\'e}s M. Encinas}, journal={Journal of Functional Analysis}, year={2000}, volume={171}, pages={155-176} }

Abstract The purpose of this paper is to construct solutions of self-adjoint boundary value problems on finite networks. To this end, we obtain explicit expressions of the Green functions for all different boundary value problems. The method consists of reducing each boundary value problem either to a Dirichlet problem or to a Poisson equation on a new network closely related with the former boundary value problem. In this process we also get an explicit expression of the Poisson kernel for the…

## Figures from this paper

## 67 Citations

Green functions for boundary value problems on product networks

- Mathematics
- 2019

Green's functions on a connected network are closely related with self-adjoint boundary value problems for positive semide nite Schrödinger operators (BVP in the sequel). Since the matrices…

POTENTIAL THEORY FOR BOUNDARY VALUE PROBLEMS ON FINITE NETWORKS

- Mathematics
- 2007

We aim here at analyzing self-adjoint boundary value problems on finite networks associated with positive semi-definite Schroperators. In addition, we study the existence and uniqueness of solutions…

The inverse problem on finite networks

- Mathematics
- 2014

The aim of this thesis is to contribute to the field of discrete boundary value problems on finite networks. Boundary value problems have been considered both on the continuum and on the discrete…

Vector Calculus on weighted networks

- Mathematics
- 2005

In this work we study the different type of regular boundary value
problems on a path associated with the Schr\"odinger operator. In
particular, we get the Poisson kernel and the Green function for…

Potential Theory for boundary value problems on finite networks

- Mathematics
- 2006

We aim here at analyzing self-adjoint boundary value problems
on finite networks associated with positive semi-definite
Schrodinger operators. In addition, we study the existence
and uniqueness of…

Discrete trace function and Poincaré inequality for the study of some linear systems

- Mathematics
- 2019

where D is a diagonal matrix with positive diagonal entries, C ≥ 0 and L is a symmetric Z-matrix. This class of linear systems appears in relation to self-adjoint Dirichlet-Robin boundary value…

Positive solutions for discrete boundary value problems involving the p-Laplacian with potential terms

- MathematicsComput. Math. Appl.
- 2011

Running head : Vector Calculus on Networks

- Mathematics
- 2006

We present here a vector calculus on weighted networks following the guidelines of Differential Geometry. The key to develop an efficient calculus on weighted networks which mimetizes the calculus in…

Bounds on the first nonzero eigenvalue for self-adjoint boundary value problems on networks

- Mathematics
- 2008

We aim here at obtaining bounds on the first nonzero eigenvalue for self-adjoint boundary value problems on a weighted network by means of equilibrium measures, that include the study of Dirichlet,…

## References

SHOWING 1-10 OF 14 REFERENCES

Upper Bounds for Eigenvalues of the Discrete and Continuous Laplace Operators

- Mathematics
- 1996

In this paper, we are concerned with upper bounds of eigenvalues of Laplace operator on compact Riemannian manifolds and finite graphs. While on the former the Laplace operator is generated by the…

Dirichlet finite solutions of Poisson equations on an infinite network

- Mathematics
- 1982

Let X be a countable set of nodes, Y be a countable set of arcs, K be the node-arc incidence function and r be a strictly positive function on Y. The quartet N = {X, Y, K, r} is called an infinite…

Heat kernel and Green kernel comparison theorems for infinite graphs

- Mathematics
- 1997

Abstract For an infinite graph, general lower and upper estimates of the Green kernel and the heat kernel are given. The estimates are optimal in the case of the homogeneous regular trees. As their…

Classification of infinite networks and its application

- Mathematics
- 1993

In this paper we consider nonlinear, infinite networks of purely resistive type where the voltage across a branch of the network is proportional to a fixed power of the current flowing in the branch.…

Shortest Paths in Distance-regular Graphs

- MathematicsEur. J. Comb.
- 2000

This work considers L as a kernel on the finite space V(?), in the context of the Potential Theory, and proves that L is a nice kernel, since it verifies some fundamental properties such as maximum and energy principles and the equilibrium principle on any proper subset of V(?).

Eigenvalue inequalities for graphs and convex subgraphs

- Mathematics
- 1997

For an induced subgraph S of a graph, we show that its Neumann eigenvalue λS can be lower-bounded by using the heat kernel Ht(x, y) of the subgraph. Namely, λS ≥ 1 2t ∑ x∈S inf y∈S Ht(x, y) √ dx √ dy…

Harmonic functions on planar and almost planar graphs and manifolds, via circle packings

- Mathematics
- 1996

Abstract.The circle packing theorem is used to show that on any bounded valence transient planar graph there exists a non constant, harmonic, bounded, Dirichlet function. If
$P$ is a bounded circle…

Potential Theory on Infinite Networks

- Mathematics
- 1994

Kirchhoff's laws.- Finite networks.- Currents and potentials withfinite energy.- Uniqueness and related topics.- Some examples and computations.- Royden's compactification.- Rough isometries.

Bounding the diameter of a distance regular graph by a function ofkd

- MathematicsGraphs Comb.
- 1991

It is shown that the diameterd is bounded above by a function depending only onkd, which is the cardinality ofΓd(α), ifΓ is not thin, and investigates thin distance regular graphs withad ≠ 0.