Enumeration of walks in multidimensional orthants and reflection groups
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910778864435200 |
|---|---|
| author | Gohier, Léa Humbert, Emmanuel Raschel, Kilian |
| author_facet | Gohier, Léa Humbert, Emmanuel Raschel, Kilian |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_05654 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Enumeration of walks in multidimensional orthants and reflection groups Gohier, Léa Humbert, Emmanuel Raschel, Kilian Probability Combinatorics Spectral Theory 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. |
| title | Enumeration of walks in multidimensional orthants and reflection groups |
| topic | Probability Combinatorics Spectral Theory |
| url | https://arxiv.org/abs/2501.05654 |