Timeline for subrandom walkers
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Feb 7, 2017 at 8:31 | history | suggested | Nikita Kalinin |
added a tag
|
|
| Feb 7, 2017 at 8:06 | review | Suggested edits | |||
| S Feb 7, 2017 at 8:31 | |||||
| Jun 12, 2010 at 1:55 | comment | added | James Propp | Roland: Your variation looks sensible. So do some others that can be derived from the various rules for rounding described in en.wikipedia.org/wiki/Rounding . E.g., the odd-chip-moves-randomly rule is related to stochastic rounding, aka dithering, and the rotor-router rule described in arxiv4.library.cornell.edu/abs/0904.4507 is related to the round-half-alternatingly rule. All such variants are of potential interest to me. My question is "What's already known?" | |
| Jun 12, 2010 at 1:47 | comment | added | James Propp | Tom: I have a number of specific questions in mind. One is, how big could the discrepancy be between the number of chips at $n$ at time $t$ under odd-chip-moves-randomly and the expected number of chips at $n$ at time $t$ under every-chip-moves-randomly, starting from the same initial state? This is a question I already know the answer to, thanks to private email from Joel Spencer. But has Joel rediscovered something that's already in the literature? | |
| Jun 11, 2010 at 18:06 | comment | added | Roland Bacher | What about the following deterministic variation? ... if the number of chips at $n$ is odd, say $2k+1$ then $k$ go left and $k+1$ go right if $n$ is even, respectively $k$ go right and $k+1$ go left if $n$ is odd. | |
| Jun 11, 2010 at 5:15 | comment | added | Tom LaGatta | Do you have a specific question in mind, James? | |
| Jun 11, 2010 at 2:00 | history | asked | James Propp | CC BY-SA 2.5 |