Mathematics > Dynamical Systems
[Submitted on 5 Dec 2019]
Title:Entropy, Shannon orbit equivalence, and sparse connectivity
View PDFAbstract:We say that two free probability-measure-preserving actions of countable groups are Shannon orbit equivalent if there is an orbit equivalence between them whose associated cocycle partitions have finite Shannon entropy. We show that if the acting groups are sofic and each has a w-normal amenable subgroup which is neither locally finite nor virtually cyclic then Shannon orbit equivalence implies that the actions have the same maximum sofic entropy. This extends a result of Austin beyond the finitely generated amenable setting and has the consequence that two Bernoulli actions of a group with the properties in question are Shannon orbit equivalent if and only if they are measure conjugate. Our arguments apply more generally to actions satisfying a sparse connectivity condition which we call property SC, and yield an entropy inequality under the assumption that one of the actions has this property.
Current browse context:
math.DS
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.