Uniqueness vs non-uniqueness in complete connections with modified majority rules
classification
🧮 math.PR
keywords
uniquenesscompleteconnectionsmajoritynon-uniquenessalwaysarbitrarilyberger
read the original abstract
We take a closer look at a class of chains with complete connections introduced by Berger, Hoffman and Sidoravicius. Besides giving a sharper description of the uniqueness and non-uniqueness regimes, we show that if the pure majority rule used to fix the dependence on the past is replaced with a function that is Lipschitz at the origin, then uniqueness always holds, even with arbitrarily slow decaying variation.
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.