196 citations · 319 across the 19 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2014
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…
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…