3 citations · 3 across the 1 of their papers we have counts for
2 papers
math.PR2020★ 3 cited
Upper bounds on mixing time of finite Markov chains
John Rhodes, Anne Schilling
We provide a general framework for computing upper bounds on mixing times of finite Markov chains when its minimal ideal is left zero. Our analysis is based on combining results by…
math-ph2011
From polygons and symbols to polylogarithmic functions
Claude Duhr, Herbert Gangl, John R. Rhodes
We present a review of the symbol map, a mathematical tool that can be useful in simplifying expressions among multiple polylogarithms, and recall its main properties. A recipe is…