This is the authors' abstract. We don't add key points for this paper.
This article presents different recent theoretical results illustrating the interactions between probability and algorithmics. These contributions deal with various topics: cellular automata and calculability, variable length Markov chains and persistent random walks, perfect sampling via coupling from the past. All of them involve discrete dynamics on complex random structures.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Cénac et al. (2017) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: