Regenerative representation for one-dimensional Gibbs states (Q1088310): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q105584337, #quickstatements; #temporary_batch_1712190744730
Import241208061232 (talk | contribs)
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1214/aop/1176992367 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1214/AOP/1176992367 / rank
 
Normal rank

Latest revision as of 15:21, 10 December 2024

scientific article
Language Label Description Also known as
English
Regenerative representation for one-dimensional Gibbs states
scientific article

    Statements

    Regenerative representation for one-dimensional Gibbs states (English)
    0 references
    1986
    0 references
    Dynamical systems determined by a stationary Gibbs state on \(\Omega =\{1,...,m\}^{{\mathbb{R}}}\) and the forward shift are isomorphic to a Bernoulli shift. The coding for the isomorphism depends on the infinite past and future. The main result of this paper states that a Gibbs process may always be obtained by stringing together i.i.d. words of symbols from the underlying alphabet, with the word length having finite exponential moments.
    0 references
    stationary Gibbs state
    0 references
    Bernoulli shift
    0 references
    coding
    0 references
    Gibbs process
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references