An **electrical network** can be defined as a weighted graph with boundary

The weight function defined on the edges of the graph is called **conductivity**. The Laplacian matrix of an electrical matrix is semi-positive definite. It is often called **Kirchhoff matrix**. The boundary measurements for inverse problems can be expressed conveniently in terms of the matrix blocks.

### Dirtichlet-to-Neumann operatorEdit

The Dirichlet-to-Neumann operator is a special type of Poincaré–Steklov operator. On a manifold w/boundary it is the pseudo-differential operator from the Dirichlet boundary values (potential) to the Neumann boundary values (current) of harmonic functions. It is well-defined because of uniqueness and existence of the solution of the Dirichlet problem.

**Exercise (*).** Prove that the Dirichlet-to-Neumann operator of an electrical network is symmetric and equal to the Schur complement of its Kirchhoff matrix.

The Laplace equation gives the direct connection between the hitting probability of the random walk started at the boundary and the value of a harmonic function at a vertex/point, see [10]. The connection can be expressed using the sum of the geometric series identity applied to the blocks of the Kirchhoff matrix of the network/graph.

This is a special case of the convergent geometric Neumann series applied to the diagonally dominated matrix.

### Effective conductivitiesEdit

The **effective conductivity** between two distinct nodes of an electrical network *G* without the boundary is equal to the ratio between the total current flowing between the nodes and the difference in potentials between the two nodes. The effective conductivities can be calculated in terms of the Schur complement of the Kirchhoff matrix of the network.

**Exercise (*)**. Prove that the effective conductivities between all pairs of nodes of a subset *∂G* of a network *G*. determine the Dirichlet-to-Neumann operator of *{G,∂G}*, and vice versa.

**Exercise (***)**. Prove that the effective conductivities between all pairs of nodes of a network *G* determine the individual conductivities of the edges of the network *G*, and vice versa.

The following problem is classical:

**Exercise (**).** Find the effective conductivity between two neighboring nodes of the electrical network that is an infinite rectangular grid *Z ^{n}* w/all conductivities equal to

*1*.