Electrical Networks and Symplectic Invariants

David Kogan

Consider a finite planar graph with positive real edge weights and designated boundary vertices, called nodes. Such a graph is called a circular planar electrical network. A grove…