1 paper
Michael Farber, Alexander Gnedin, Wajid Mannan
A growing random graph is constructed by successively sampling without replacement an element from the pool of virtual vertices and edges. At start of the process the pool contains…