Solving boundary value problems on networks using equilibrium measures (Q1971935)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1423457
Language Label Description Also known as
default for all languages
No label defined
    English
    Solving boundary value problems on networks using equilibrium measures
    scientific article; zbMATH DE number 1423457

      Statements

      Solving boundary value problems on networks using equilibrium measures (English)
      0 references
      0 references
      0 references
      0 references
      28 August 2000
      0 references
      The authors consider various boundary value problems on finite resistor networks (Poisson, Dirichlet, Neumann, Robin, mixed). Such a network consists of a finite set \(V\) of vertices and a conductance \(c:V^2 \to \mathbb R_+\) which is symmetric and vanishes on the diagonal. An undirected edge \(\{x,y\}\) belongs to the edge set of the network if and only if its conductance is strictly positive. The corresponding discrete ``Laplacian'' \(\Delta\) is then given by \[ \Delta f(x) = \sum_{y\in V} (f(y) - f(x))c(x,y) \qquad (x\in V). \] Standard methods of (discrete) potential theory (e.g. Dirichlet forms or balayage spaces) are used to solve the Poisson problem for the Schrödinger operator in terms of Green's functions or equilibrium measures. In Section~4 formulas for the following Green's functions are calculated: the Poisson equation on distance regular graphs, the Dirichlet problem on an infinite distance regular graph, and the Neumann problem on a ball of a homogeneous tree.
      0 references
      finite electrical network
      0 references
      Green's function
      0 references
      boundary value problems on finite resistor networks
      0 references
      discrete Laplacian
      0 references
      Poisson problem for the Schrödinger operator
      0 references
      infinite distance regular graph
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references