The space of circular planar electrical networks
From MaRDI portal
Publication:2953403
DOI10.1137/140997798zbMATH Open1357.90022arXiv1411.7425OpenAlexW2962986186MaRDI QIDQ2953403FDOQ2953403
Authors: Richard Kenyon, David B. Wilson 
Publication date: 4 January 2017
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Abstract: We discuss several parametrizations of the space of circular planar electrical networks. For any circular planar network we associate a canonical minimal network with the same response matrix, called a "standard" network. The conductances of edges in a standard network can be computed as a biratio of Pfaffians constructed from the response matrix. The conductances serve as coordinates that are compatible with the cell structure of circular planar networks in the sense that one conductance degenerates to 0 or infinity when moving from a cell to a boundary cell. We also show how to test if a network with n nodes is well-connected by checking that minors of the response matrix are positive; Colin de Verdi`ere had previously shown that it was sufficient to check the positivity of exponentially many minors. For standard networks with m edges, positivity of the conductances can be tested by checking the positivity of m+1 Pfaffians.
Full work available at URL: https://arxiv.org/abs/1411.7425
Recommendations
Cites Work
- The Schur complement and its applications
- Alternating-sign matrices and domino tilings. I
- Double-dimer pairings and skew Young diagrams
- The cube recurrence
- Planar electric networks. II
- Circular planar graphs and resistor networks
- Total positivity for cominuscule Grassmannians.
- Positroid stratification of orthogonal Grassmannian and ABJM amplitudes
- The positive orthogonal Grassmannian and loop amplitudes of ABJM
- The uncrossing partial order on matchings is Eulerian
- Dimers and cluster integrable systems
- Total positivity: tests and parametrizations.
- Applications of graphical condensation for enumerating matchings and tilings
- Path representation of maximal parabolic Kazhdan-Lusztig polynomials.
- Title not available (Why is that?)
- Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on planar graphs
- Combinatorics of tripartite boundary connections for trees and dimers
- Boundary partitions in trees and dimers
- Fully packed loops in a triangle: matchings, paths and puzzles
- Dyck tilings, increasing trees, descents, and inversions
- Proofs of two conjectures of Kenyon and Wilson on Dyck tilings
- Electrical impedance tomography with resistor networks
- Finding the conductors in circular networks from boundary measurements
- Circular planar electrical networks: posets and positivity
- The Laplacian on planar graphs and graphs on surfaces
- Dyck tilings and the homogeneous Garnir relations for graded Specht modules
- Electrical networks and Lie theory
- Planar electric networks. I
Cited In (17)
- Electrical varieties as vertex integrable statistical models
- Knots, tangles, and electrical networks
- Planar electric networks. I
- Proof of a conjecture of Kenyon and Wilson on semicontiguous minors
- A \(q\)-enumeration of lozenge tilings of a hexagon with four adjacent triangles removed from the boundary
- Shellability of face posets of electrical networks and the CW poset property
- Matroids arising from electrical networks
- Pfaffian Formulas for Spanning Tree Probabilities
- Lozenge tilings of hexagons with central holes and dents
- Tiling enumeration of hexagons with off-central holes
- Circular Planar Electrical Networks, Split Systems, and Phylogenetic Networks
- Beyond Aztec castles: toric cascades in the \(dP_3\) quiver
- Stable recovery of piecewise constant conductance on spider networks
- Dungeons and dragons: combinatorics for the \(dP_3\) quiver
- Circuit Theory in Projective Space and Homogeneous Circuit Models
- Electrical networks and hyperplane arrangements
- Proof of a refinement of Blum's conjecture on hexagonal dungeons
This page was built for publication: The space of circular planar electrical networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2953403)
