Ghirlanda-Guerra identities and ultrametricity: An elementary proof in the discrete case
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.