Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 46 min ago
PreprintCC BY-NC-ND 4.0arXiv

C-networks and the planar Ising inverse problem

  • Yassine Elmaazouz
  • Terrence George
Open at sourcePDFDOICite

Abstract

We solve the inverse problem for Ising models on reduced planar graphs in a disk, i.e., recovering the edge coupling constants from the boundary spin correlations. A recursive solution to this problem was provided by Galashin--Pylyavskyy. Our solution is nonrecursive. It is based on an Ising analog of the chamber ansatz which asserts that the inverse map factors through variables on the graph that transform under the Ising Y-Δ move according to the discrete CKP equation.

Related

  1. A Schiffer-type inverse obstacle problem for the planar Schrödinger equation with a single measurement
    Tony Liimatainen, Yi-Hsuan Lin, Petri Ola
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  2. On the planar Neumann--Poincaré inverse spectral problem
    Habib Ammari, Matthew J. Colbrook
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsMathematical physicsarXiv
  3. Gauss--Chebyshev Quadrature, 𝕊1-Designs, and the Planar Minkowski Inverse Problem: A One-Dimensional Model for Design-Induced Convex Geometry
    Congpei An
    arXivPreprintCC BY 4.0Full textGeometry & topologyNumerical analysis & scientific computingarXiv
  4. Comparing the Lee-Yang gap with the mass gap in the sub-critical planar Ising model
    Noam Borgnia, Jui-Hui Chung, Jacob Shapiro
    arXivPreprintCC BY 4.0Full textMathematical physicsProbabilityarXiv
  5. Universal Critical Jump for Inverse-Square Ising Ferromagnets
    Dyuman Bhattacharya
    arXivPreprintarXiv licenceFull textMathematical physicsStatistical & nonlinear physicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{elmaazouz2026cnetworks,
  title = {{$C$-networks and the planar Ising inverse problem}},
  author = {Yassine Elmaazouz and Terrence George},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2606.15082},
  eprint = {2606.15082},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2606.15082},
  note = {CC BY-NC-ND 4.0},
}
RIS
TY  - UNPB
TI  - C-networks and the planar Ising inverse problem
AU  - Yassine Elmaazouz
AU  - Terrence George
PY  - 2026
DA  - 2026/10/23
PB  - arXiv
DO  - 10.48550/arxiv.2606.15082
UR  - https://arxiv.org/abs/2606.15082
AB  - We solve the inverse problem for Ising models on reduced planar graphs in a disk, i.e., recovering the edge coupling constants from the boundary spin correlations. A recursive solution to this problem was provided by Galashin--Pylyavskyy. Our solution is nonrecursive. It is based on an Ising analog of the chamber ansatz which asserts that the inverse map factors through variables on the graph that transform under the Ising Y-Δ move according to the discrete CKP equation.
ER  -