Configurational Information Measures, Phase Transitions, and an Upper Bound on Complexity

March 04, 2025 Β· Declared Dead Β· πŸ› arXiv.org

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Damian R Sowinski, Sean Kelty, Gourab Ghoshal arXiv ID 2503.02980 Category cond-mat.stat-mech Cross-listed cs.IT, math-ph, nlin.AO, nlin.PS Citations 0 Venue arXiv.org Last Checked 6 months ago
Abstract
Configurational entropy (CE) and configurational complexity (CC) are recently popularized information theoretic measures used to study the stability of solitons. This paper examines their behavior for 2D and 3D lattice Ising Models, where the quasi-stability of fluctuating domains is controlled by proximity to the critical temperature. Scaling analysis lends support to an unproven conjecture that these configurational information measures (CIMs) can detect (in)stability in field theories. The primary results herein are the derivation of a model dependent CC-CE relationship, as well as a model independent upper bound on CC. CIM phenomenology in the Ising universality class reveals multiple avenues for future research.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” cond-mat.stat-mech

Died the same way β€” πŸ‘» Ghosted