Research output: Contribution to journal › Article

Colin Cooper, Andrew McDowell, Tomasz Radzik, Nicolas Rivera Aburto, Takeharu Shiraga

Original language | English |
---|---|

Pages (from-to) | 561-585 |

Journal | RANDOM STRUCTURES AND ALGORITHMS |

Volume | 53 |

Issue number | 4 |

Early online date | 29 Oct 2018 |

DOIs | |

Publication status | Published - Dec 2018 |

Dispersion_RSA_Ver_3_accepted.pdf, 417 KB, application/pdf

24/01/2019

Accepted author manuscript

We study a synchronous process called dispersion. Initially M particles are placed at a distinguished origin vertex of a graph G. At each time step, at each vertex v occupied by more than one particle at the beginning of this step, each of these particles moves to a neighbour of v chosen independently and uniformly at random. The process ends at the first step when no vertex is occupied by more than one particle.For the complete graph K_n, for any constant d > 1, with high probability, if M <= n/2(1 - d), the dispersion process finishes in O(log n) steps, whereas if M >= n/2(1 + d), the process needs e^Omega(n) steps to complete, if ever. A lazy variant of the process exhibits analogous behaviour but at a higher threshold, thus allowing faster dispersion of more particles.For paths, trees, grids, hypercubes and Abelian Cayley graphs of large enough size, we give bounds on the time to finish and the maximum distance traveled from the origin as a function of M.

King's College London - Homepage

© 2018 King's College London | Strand | London WC2R 2LS | England | United Kingdom | Tel +44 (0)20 7836 5454