196 citations · 319 across the 19 of their papers we have counts for
5 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…
Randomized Rumor Spreading in Poorly Connected Small-World Networks
Abbas Mehrabian, Ali Pourmiri
Push-Pull is a well-studied round-robin rumor spreading protocol defined as follows: initially a node knows a rumor and wants to spread it to all nodes in a network quickly. In eac…
Justifying the small-world phenomenon via random recursive trees
Abbas Mehrabian
We present a new technique for proving logarithmic upper bounds for diameters of evolving random graph models, which is based on defining a coupling between random graphs and varia…
It's a Small World for Random Surfers
Abbas Mehrabian, Nick Wormald
We prove logarithmic upper bounds for the diameters of the random-surfer Webgraph model and the PageRank-based selection Webgraph model, confirming the small world phenomenon holds…
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…