Logarithmic boundary depth and the conditioning of the discrete inverse conductance problem on hyperbolic lattices
Year: 2026
Type: preprint
Abstract: Preprint, data and code. We study the discrete inverse conductance (Calderón) problem on layer-truncated hyperbolic {7,3} tilings and matched square and triangular lattice disks. The condition number of the Dirichlet-to-Neumann sensitivity Jacobian grows polynomially on the hyperbolic lattice (log10 kappa = 3.89 at N = 847, inside a preregistered band) and exceeds float64 resolution by N ~ 400 on flat lattices, because boundary depth scales as O(log N) versus O(sqrt N). Exact GF(p) ranks show all tested networks are identifiable: the difference is conditioning. The advantage persists under probe matching (post hoc identifiable-subspace metric) and for the Neumann-to-Dirichlet map. For the RC version, a preregistered finite-size prediction was refuted; a domain-monotonicity argument shows the Dirichlet spectral gap decreases to a positive limit, bounding the RC relaxation time uniformly in N. The RC dynamics are cross-validated with SciPy BDF and the rusty-SUNDIALS CVODE solver against the exact matrix-exponential solution and the static Dirichlet-to-Neumann map. Files: paper.pdf; dataset.zip (graphs, DtN matrices, conditioning, exact ranks, spectral gaps, integrator controls, RC step responses; CC BY 4.0); code.zip (simulator, analysis scripts, and the RC-network benchmark contributed to rusty-SUNDIALS; MIT).
Author: Callens, Xavier
Language: English
Subfield: Mathematical Physics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7214519637