On the precision of the spectral profile
classification
🧮 math.PR
keywords
factorprofilespectralboundcannotcontinuous-timeexaminefind
read the original abstract
We examine the spectral profile bound of Goel, Montenegro and Tetali for the uniform mixing time of continuous-time random walk in reversible settings. We find that it is precise up to a log log factor, and that this log log factor cannot be improved.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.