2 results
Sensitivity of mixing times of Cayley graphs
- Part of
-
- Journal:
- Canadian Journal of Mathematics / Volume 76 / Issue 4 / August 2024
- Published online by Cambridge University Press:
- 18 July 2023, pp. 1400-1431
- Print publication:
- August 2024
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
-
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)$.
Ordering the Representations of
${{S}_{n}}$ Using the Interchange Process
-
- Journal:
- Canadian Mathematical Bulletin / Volume 56 / Issue 1 / 01 March 2013
- Published online by Cambridge University Press:
- 20 November 2018, pp. 13-30
- Print publication:
- 01 March 2013
-
- Article
-
- You have access
- Export citation
-
Inspired by Aldous' conjecture for the spectral gap of the interchange process and its recent resolution by Caputo, Liggett, and Richthammer, we define an associated order
$\prec $ on the irreducible representations of ${{S}_{n}}$. Aldous' conjecture is equivalent to certain representations being comparable in this order, and hence determining the “Aldous order” completely is a generalized question. We show a few additional entries for this order.
