A q-Eulerian last-site law for cycle IDLA
Statement
(3) Persi Diaconis: "Say you play the explorers game [16] on a circle with n vertices labeled cyclically 0 through n − 1 and you repeatedly explore from 0. The probability that the last point occupied before the circle is filled is j is given by A(n, j )/n!, where A(n, j ) are the Eulerian numbers. 2 This fact was shown to me by Andrea Sportiello during the lunch break. What is interesting is that the situation is very different from a random walk, in which the distribution is uniform. It may be worth looking at the probability distribution of last occupied spot in the explorers game for other sets (for example in higher dimensions or on circulant graphs)." (a) Lionel Levine: "Jim Propp made this observation about the Eulerian numbers a while ago." (b) James Propp: "There are connections here to other models such as P´ olya's urn and Bernard Friedman's urn. Are these connec-tions useful?" (c) Andrea Sportiello: "If you change the graph to something like Z2,I would guess that things become ugly very fast." (d) Lionel Levine: "It is not clear how to generalize to higher di-mensions because so much is going on, but sticking to the one-dimensional case and putting weights on the edges may give some new q-analog."
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.