Ghirlanda-Guerra identities and ultrametricity: An elementary proof in the discrete case
classification
🧮 math.PR
math-phmath.MP
keywords
ghirlanda-guerraidentitiesproofelementaryrandomadditionalgebraicanother
read the original abstract
In this paper we give another proof of the fact that a random overlap array, which satisfies the Ghirlanda-Guerra identities and whose elements take values in a finite set, is ultrametric with probability one. The new proof bypasses random change of density invariance principles for directing measures of such arrays and, in addition to the Dobvysh-Sudakov representation, is based only on elementary algebraic consequences of the Ghirlanda-Guerra identities.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.