23 problems
Brownian motion and cutoff conjecture. For every , the state is not absolutely continuous with respect to the Haar state. Moreover,
Multi-stack and restricted shuffle cutoff conjecture. Both chains exhibit cutoff, with the multi-stack chain around time
Ordered labeled product-chain conjecture. The chains and exhibit cutoff around the…
-ball cutoff conjecture. For , the balanced chain exhibits cutoff around the time
Fix , and for each let be the Burnside process on . Consider starting states whose limiting empirical distribution on assigns a positive propor…
Let be a group, let satisfy and , and let be the Cayley graph of generated by independently and uniformly chos…
Let be a sequence of finite vertex-transitive expander graphs, and consider simple random walk on each . Levin–Peres conjecture. The sequence …
Let be a sequence of graphs with uniformly bounded degrees and diverging sizes. Let be a sequence of constants in , and let be as in the…
Consider the symmetric simple exclusion process with reservoirs on a segment of size , with parameters and , and let denote the characteristic mixing-time scale. In…
Mixing-time and cutoff conjecture. The following claims should hold:
Let be the transition matrix of a lazy random walk on generated by a conjugacy class or a union of conjugacy classes having fixed points. Suppose that exhibi…
Consider the asymmetric simple exclusion process on a segment of size with open boundaries, in which particles have a drift, may move in both directions within the segment, and…
Let be a sequence of Ramanujan graphs, let denote the number of vertices, let be their common degree, and set . Let be the average squared dist…
The entropic-time conjecture. Under conditions similar to those in the paper's total-variation cutoff result, with high probability the random walk on exhibits cutoff in the…
Let and diverge with , let be a group of order , and let . For fixed , write…
Let be the biased one-sided transposition shuffle with weight parameter , and let be the total-variation cutoff…
Let be the biased one-sided transposition shuffle, where is monotonically decreasing, and let and be the quantities used in t…
Let be the biased one-sided transposition shuffle, where is monotonically decreasing, and let denote its normalising quantity. Cutoff c…
Consider the simple exclusion process with open boundaries, with phase parameters and , and let denote its -mixing time. Maxim…
Symmetric cutoff conjecture. The lower bound in the symmetric pre-cutoff estimate is sharp, and cutoff occurs.
Let be a sequence of transitive graphs, and consider the Glauber dynamics for the Ising model on these graphs. Let denote the critical temperature, let …
Let be any family of finite vertex-transitive expander graphs, and let the simple random walk (SRW) be the walk that at each step moves uniformly to a neighboring vertex. V…
Let be a random -regular graph, and consider the lazy random walk on . Its mixing time is measured in total variation and the lazy walk stays in place…