Vertices arrive sequentially in space and are joined to existing vertices at random according to a preferential rule combining degree and spatial proximity. We investigate phase transitions in the ...

We study the following preferential attachment variant of the classical Erdős–Rényi random graph process. Starting with an empty graph on n vertices, new edges are added one-by-one, and each time an ...