37 citations · 126 across the 31 of their papers we have counts for
4 papers · 1 filter
On the push&pull protocol for rumour spreading
Huseyin Acan, Andrea Collevecchio, Abbas Mehrabian +1
The asynchronous push&pull protocol, a randomized distributed algorithm for spreading a rumour in a graph , works as follows. Independent Poisson clocks of rate 1 are associated…
The worm algorithm for the Ising model is rapidly mixing
Andrea Collevecchio, Timothy M. Garoni, Timothy Hyndman +1
We prove rapid mixing of the Prokofiev-Svistunov (or worm) algorithm for the zero-field ferromagnetic Ising model, on all finite graphs and at all temperatures. As a corollary, we…
Longest paths in random Apollonian networks and largest -ary subtrees of random -ary recursive trees
Andrea Collevecchio, Abbas Mehrabian, Nick Wormald
Let and be positive integers with . Consider a random -ary tree constructed as follows. Start with a single vertex, and in each time-step choose a uniformly random…
General random walk in a random environment defined on Galton-Watson trees
A. D. Barbour, A. Collevecchio
We consider the motion of a particle on a Galton Watson tree, when the probabilities of jumping from a vertex to any one of its neighbours is determined by a random process. Given…