Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 93 tok/s
Gemini 2.5 Pro 35 tok/s Pro
GPT-5 Medium 28 tok/s
GPT-5 High 30 tok/s Pro
GPT-4o 81 tok/s
GPT OSS 120B 439 tok/s Pro
Kimi K2 197 tok/s Pro
2000 character limit reached

Enumeration of walks in multidimensional orthants and reflection groups (2501.05654v1)

Published 10 Jan 2025 in math.PR, math.CO, and math.SP

Abstract: We consider (random) walks in a multidimensional orthant. Using the idea of universality in probability theory, one can associate a unique polyhedral domain to any given walk model. We use this connection to prove two sets of new results. First, we are interested in a group of transformations naturally associated with any small step model; as it turns out, this group is central to the classification of walk models. We show a strong connection between this group and the reflection group through the walls of the polyhedral domain. As a consequence, we can derive various conditions for the combinatorial group to be infinite. Secondly, we consider the asymptotics of the number of excursions, whose critical exponent is known to be computable in terms of the eigenvalue of the above polyhedral domain. We prove new results from spectral theory on the eigenvalues of polyhedral nodal domains. We believe that these results are interesting in their own right; they can also be used to find new exact asymptotic results for walk models corresponding to these nodal polyhedral domains.

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

Collections

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

Summary

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

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

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

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube