arXiv · 1905.08131
Longest common substring for random subshifts of finite type
Abstract
In this paper, we study the behaviour of the longest common substring for random subshifts of finite type (for dynamicists) or of the longest common substring for random sequences in random environments (for probabilists). We prove that, under some exponential mixing assumptions, this behaviour is linked to the R\'enyi entropy of the stationary measure. We emphasize that what we establish is a quenched result.
Explore related subjects
Keep this discovery
Jerome Rousseau. 2019-05-20. Longest common substring for random subshifts of finite type. https://arxiv.org/abs/1905.08131
Cite the original work for its findings. Save a collection to share your selection of sources.