Results 1 
4 of
4
Slow Convergence in Bootstrap Percolation
, 2007
"... In the bootstrap percolation model, sites in an L by L square are initially infected independently with probability p. At subsequent steps, a healthy site becomes infected if it has at least 2 infected neighbours. As (L, p) → (∞, 0), the probability that the entire square is eventually infected is ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
In the bootstrap percolation model, sites in an L by L square are initially infected independently with probability p. At subsequent steps, a healthy site becomes infected if it has at least 2 infected neighbours. As (L, p) → (∞, 0), the probability that the entire square is eventually infected is known to undergo a phase transition in the parameter p log L, occurring asymptotically at λ = π 2 /18 [15]. We prove that the discrepancy between the critical parameter and its limit λ is at least Ω((log L) −1/2). In contrast, the critical window has width only Θ((log L) −1). For the socalled modified model, we prove rigorous explicit bounds which imply for example that the relative discrepancy is at least 1 % even when L = 10 3000. Our results shed some light on the observed differences between simulations and rigorous asymptotics.
Analysis of TopSwap Shuffling for Genome Rearrangements
"... Abstract: We study Markov chains which model genome rearrangements. These models are useful for studying the equilibrium distribution of chromosomal lengths, and are used in methods for estimating genomic distances. The primary Markov chain studied in this paper is the topswap Markov chain. The top ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract: We study Markov chains which model genome rearrangements. These models are useful for studying the equilibrium distribution of chromosomal lengths, and are used in methods for estimating genomic distances. The primary Markov chain studied in this paper is the topswap Markov chain. The topswap chain is a cardshuffling process with n cards divided over k decks, where the cards are ordered within each deck. A transition consists of choosing a random pair of cards, and if the cards lie in different decks, we cut each deck at the chosen card and exchange the tops of the two decks. We prove precise bounds on the relaxation time (inverse spectral gap) of the topswap chain. In particular, we prove the relaxation time is Θ(n + k). This resolves an open question of Durrett.
Astonishing Cellular Automata
, 2007
"... Cellular automata arise naturally in the study of physical systems, and exhibit a seemingly limitless range of intriguing behaviour. Such models lend themselves naturally to simulation, yet rigorous analysis can be notoriously difficult, and can yield highly unexpected results. Bootstrap percolation ..."
Abstract
 Add to MetaCart
Cellular automata arise naturally in the study of physical systems, and exhibit a seemingly limitless range of intriguing behaviour. Such models lend themselves naturally to simulation, yet rigorous analysis can be notoriously difficult, and can yield highly unexpected results. Bootstrap percolation is a very simple model, originally introduced in [13], which turns out to hold many surprises. Cells arranged in an L by L square grid can be either infected or healthy. Initially, we flip a biased coin for each cell, declaring it infected with probability p. At each subsequent time step, any healthy cell with 2 or more infected neighbours becomes infected, while infected cells remain infected forever. (A cell’s neighbours are the cells immediately to its North, South, East and West interior cells have 4 neighbours while boundary cells have fewer). See Figures 1 and 2. 0 1 2 3 4 5 6 Figure 1: Bootstrap percolation on a square of size 5 at time steps