Inverse problem in cylindrical electrical networks
From MaRDI portal
Publication:2910862
DOI10.1137/110846476zbMATH Open1250.94072arXiv1104.4998OpenAlexW1995854863MaRDI QIDQ2910862FDOQ2910862
Authors: Thomas Lam, Pavlo Pylyavskyy
Publication date: 12 September 2012
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Abstract: In this paper we study the inverse Dirichlet-to-Neumann problem for certain cylindrical electrical networks. We define and study a birational transformation acting on cylindrical electrical networks called the electrical -matrix. We use this transformation to formulate a general conjectural solution to this inverse problem on the cylinder. This conjecture extends work of Curtis, Ingerman, and Morrow, and of de Verdi`ere, Gitler, and Vertigan for circular planar electrical networks. We show that our conjectural solution holds for certain "purely cylindrical" networks. Here we apply the grove combinatorics introduced by Kenyon and Wilson.
Full work available at URL: https://arxiv.org/abs/1104.4998
Recommendations
Cited In (19)
- Discrete dynamics in cluster integrable systems from geometric \(R\)-matrix transformations
- Electrical varieties as vertex integrable statistical models
- Spectra of biperiodic planar networks
- The hyperbolicity problem in electrical circuit theory
- On the solvability of the discrete conductivity and Schrödinger inverse problems
- Title not available (Why is that?)
- Matrix valued inverse problems on graphs with application to mass-spring-damper systems
- Inverse dynamo problem in a cylinder
- Title not available (Why is that?)
- Functional relations on anisotropic Potts models: from Biggs formula to the tetrahedron equation
- Matroids arising from electrical networks
- Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on planar graphs
- The twist for electrical networks and the inverse problem
- Toric networks, geometric \(R\)-matrices and generalized discrete Toda lattices
- Overdetermined partial resolvent kernels for finite networks
- Total positivity in loop groups. I: Whirls and curls
- Algebraic properties of generalized graph Laplacians: resistor networks, critical groups, and homological algebra
- On the equivalence of cylinder tilings and planar electric networks
- An algorithm for delta-wye reduction of almost-planar graphs
This page was built for publication: Inverse problem in cylindrical electrical networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2910862)