Papers
Topics
Authors
Recent
AI Research Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 83 tok/s
Gemini 2.5 Pro 52 tok/s Pro
GPT-5 Medium 25 tok/s Pro
GPT-5 High 30 tok/s Pro
GPT-4o 92 tok/s Pro
Kimi K2 174 tok/s Pro
GPT OSS 120B 462 tok/s Pro
Claude Sonnet 4 39 tok/s Pro
2000 character limit reached

Limiting directions for random walks in classical affine Weyl groups (2004.13399v2)

Published 28 Apr 2020 in math.PR, math-ph, math.CO, math.GR, math.MP, and math.RT

Abstract: Let $W$ be a finite Weyl group and $\widetilde W$ the corresponding affine Weyl group. A random element of $\widetilde W$ can be obtained as a reduced random walk on the alcoves of $\widetilde W$. By a theorem of Lam (Ann. Prob. 2015), such a walk almost surely approaches one of $|W|$ many directions. We compute these directions when $W$ is $B_n$, $C_n$ and $D_n$ and the random walk is weighted by Kac and dual Kac labels. This settles Lam's questions for types $B$ and $C$ in the affirmative and for type $D$ in the negative. The main tool is a combinatorial two row model for a totally asymmetric simple exclusion process called the $D*$-TASEP, with four parameters. By specializing the parameters in different ways, we obtain TASEPs for each of the Weyl groups mentioned above. Computing certain correlations in these TASEPs gives the desired limiting directions.

Summary

We haven't generated a summary for this paper yet.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.