20 citations · 23 across the 4 of their papers we have counts for
1 paper · 2 filters
Richard Elwes
We consider a simple Preferential Attachment graph process, which begins with a finite graph, and in which a new (t+1)st vertex is added at each subsequent time step t, and con…