6 citations · 9 across the 4 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2019★ 1 cited
Best-of-Three Voting on Dense Graphs
Nan Kang, Nicolas Rivera
Given a graph of vertices, where each vertex is initially attached an opinion of either red or blue. We investigate a random process known as the Best-of-three voting. In t…
cs.DM2018
The dispersion time of random walks on finite graphs
Nicolas Rivera, Alexandre Stauffer, Thomas Sauerwald +1
We study two random processes on an -vertex graph inspired by the internal diffusion limited aggregation (IDLA) model. In both processes particles start from an arbitrary bu…
cs.DM2017★ 2 cited
Dispersion processes
Colin Cooper, Andrew McDowell, Tomasz Radzik +2
We study a synchronous dispersion process in which particles are initially placed at a distinguished origin vertex of a graph . At each time step, at each vertex occupie…