4 citations · 4 across the 6 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DM2014
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…
math.PR2014
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…