Suppose each new unit block independently selects one of two columns with equal probability. On the taller column it increases the maximum height; on the shorter column it sticks level with the other column, leaving the maximum unchanged. If the columns have equal height, the next block increases the maximum. Their absolute height difference is the reset-or-increment Markov chain with .
For the maximum height , each increment obeys . The stationary distribution has . Applying the countable-state Markov chain ergodic theorem to the bounded indicator function of the positive states gives
almost surely, from any fixed finite starting configuration. The reward average depends only on whether a reset occurred, even though the difference chain has infinitely many states.
Figure 1.
Reset-or-increment differences determine the long-run column growth rate
. Original calculations and simulations. The accompanying proof establishes the limiting result; finitely many simulated paths illustrate it. Details.

Articles by others on the same topic (0)

There are currently no matching articles.