## Journal of Applied Probability

### >Bit flipping and time to recover

#### Abstract

We call bits' a sequence of devices indexed by positive integers, where every device can be in two states: 0 (idle) and 1 (active). Start from the ground state' of the system when all bits are in 0-state. In our first binary flipping (BF) model the evolution of the system behaves as follows. At each time step choose one bit from a given distribution P on the positive integers independently of anything else, then flip the state of this bit to the opposite state. In our second damaged bits (DB) model a `damaged' state is added: each selected idling bit changes to active, but selecting an active bit changes its state to damaged in which it then stays forever. In both models we analyse the recurrence of the system's ground state when no bits are active. We present sufficient conditions for both the BF and DB models to show recurrent or transient behaviour, depending on the properties of the distribution P. We provide a bound for fractional moments of the return time to the ground state for the BF model, and prove a central limit theorem for the number of active bits for both models.

#### Article information

Source
J. Appl. Probab. Volume 53, Number 3 (2016), 650-666.

Dates
First available in Project Euclid: 13 October 2016

https://projecteuclid.org/euclid.jap/1476370768

Mathematical Reviews number (MathSciNet)
MR3570086

Zentralblatt MATH identifier
1351.60104

#### Citation

Muratov, Anton; Zuyev, Sergei. &gt;Bit flipping and time to recover. J. Appl. Probab. 53 (2016), no. 3, 650--666.https://projecteuclid.org/euclid.jap/1476370768

#### References

• Aspandiiarov, S., Iasnogorodski, R. and Menshikov, M. (1996). Passage-time moments for nonnegative stochastic processes and an application to reflected random walks in a quadrant. Ann. Prob. 24, 932–960.
• Athreya, K. B. and Karlin, S. (1968). Embedding of urn schemes into continuous time Markov branching process and related limit theorems. Ann. Math. Statist. 39, 1801–1817.
• Balogh, J. and Pemantle, R. (2007). The Klee–Minty random edge chain moves with linear speed. Random Structures Algorithms 30, 464–483.
• Benjamini, I., Häggström, O., Peres, Y. and Steif, J. E. (2003). Which properties of a random sequence are dynamically sensitive? Ann. Prob. 31, 1–34.
• Borovkov, A. A. (1998). Probability Theory. Gordon and Breach, Amsterdam.
• Lyons, R., Pemantle, R. and Peres, Y. (1996). Random walks on the lamplighter group. Ann. Prob. 24, 1993–2006.
• Steif, J. E. (2009). A survey of dynamical percolation. In Fractal Geometry and Stochastics IV (Progr. Prob. 61), Birkhäuser, Basel, pp. 145–174.
• Woess, W. (2000). Random Walks on Infinite Graphs and Groups (Camb. Tracts Math. 138). Cambridge University Press.