REVIEW 1 cited by
Sensitivity of mixing times of Cayley graphs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
We show that the total variation mixing time is not quasi-isometry invariant, even for Cayley graphs. Namely, we construct a sequence of pairs of Cayley graphs with maps between them that twist the metric in a bounded way, while the ratio of the two mixing times goes to infinity. The Cayley graphs serving as an example have unbounded degrees. For non-transitive graphs we construct bounded degree graphs for which the mixing time from the worst starting point for one graph is asymptotically smaller than the mixing time from the best starting point of the random walk on a network obtained by increasing some of the edge weights from 1 to $1+o(1)$.
Forward citations
Cited by 1 Pith paper
-
Some inequalities for reversible Markov chains and branching random walks via spectral optimization
For reversible finite Markov chains, the L-infinity mixing time is at most trel log(e thit / trel), so the mixing time is comparable to the maximal hitting time exactly when the spectral gap times the hitting time rem...
Discussion (0). Continue with ORCID to comment.