2000 character limit reached
Uniqueness vs non-uniqueness in complete connections with modified majority rules
Published 29 Sep 2013 in math.PR | (1309.7550v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.