1 We consider a bipartite stochastic block model on vertex sets V1 and V2, with planted partitions in each, and ask at what densities efficient algorithms can recover the partition of the smaller… (More)

Rotor walk is a deterministic analogue of random walk. We study its recurrence and transience properties on Z for the initial configuration of all rotors aligned. If n particles in turn perform rotor… (More)

In a rotor walk the exits from each vertex follow a prescribed periodic sequence. On an infinite Eulerian graph embedded periodically in R, we show that any simple rotor walk, regardless of rotor… (More)

Consider “Frozen Random Walk” on Z: n particles start at the origin. At any discrete time, the leftmost and rightmost bn4 c particles are “frozen” and do not move. The rest of the particles in the… (More)

PURPOSE
Elekta recently developed a solution for in-vivo EPID dosimetry (iViewDose, Elekta AB, Stockholm, Sweden) in conjunction with the Netherlands Cancer Institute (NKI). This uses a simplified… (More)

We consider the subgroup of the abelian sandpile group of the grid graph consisting of configurations of sand that are symmetric with respect to central vertical and horizontal axes. We compute the… (More)