Reducing interchange comparisons to two label-mixing bounds
Statement
Comparison of interchange to SRW and Exclusion
Consider the interchange process with particles on vertices. Can you say the following?
\begin{align*} t_{\mbox{mix}}^{IP}\lesssim & t_{\mbox{mix}}^{SRW} \log n,, \ t_{\mbox{mix}}^{IP} \lesssim & t_{\mbox{mix}}^{SRW,n},, \ t_{\mbox{mix}}^{IP} \asymp & t_{\mbox{mix}}^{SSEP,n/2},. \end{align*}
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.