4 citations · 7 across the 3 of their papers we have counts for
4 papers
Sharper analysis of the random graph -process via a balls-in-bins model
Andrzej Rucinski, Nick Wormald
A graph -process starts with an empty graph on vertices, and adds one edge at each time step, chosen uniformly at random from those pairs which are not yet edges and whose b…
The number of satisfying assignments of random regular k-SAT formulas
Amin Coja-Oghlan, Nick Wormald
Let be a random -SAT formula in which every variable occurs precisely times positively and times negatively. Assuming that is sufficiently large and that is…
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…
On the Stretch Factor of Randomly Embedded Random Graphs
Abbas Mehrabian, Nick Wormald
We consider a random graph G(n,p) whose vertex set V has been randomly embedded in the unit square and whose edges are given weight equal to the geometric distance between their en…