2021
DOI: 10.3150/20-bej1299
|View full text |Cite
|
Sign up to set email alerts
|

Variable Length Memory Chains: Characterization of stationary probability measures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 25 publications
0
1
0
Order By: Relevance
“…The set τ g is sometimes assumed to be countable, which amounts to saying that g is piecewise constant on a countable number of cylinders. By using the combinatorial structure brought by the context tree, precise results on existence and uniqueness of g-measures (in some cases necessary and sufficient conditions) are obtained in [49] and [17], without requiring global continuity of g.…”
Section: Variable Length Markov Chains Parsimonious Random Fields And...mentioning
confidence: 99%
“…The set τ g is sometimes assumed to be countable, which amounts to saying that g is piecewise constant on a countable number of cylinders. By using the combinatorial structure brought by the context tree, precise results on existence and uniqueness of g-measures (in some cases necessary and sufficient conditions) are obtained in [49] and [17], without requiring global continuity of g.…”
Section: Variable Length Markov Chains Parsimonious Random Fields And...mentioning
confidence: 99%