20 citations · 23 across the 4 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2018
Evolving Shelah-Spencer Graphs
Richard Elwes
An \emph{evolving Shelah-Spencer process} is one by which a random graph grows, with at each time a new node incorporated and attached to each previous node with pro…
math.CO2016★ 2 cited
A Preferential Attachment Process Approaching the Rado Graph
Richard Elwes
We consider a simple Preferential Attachment graph process, which begins with a finite graph, and in which a new st vertex is added at each subsequent time step , and con…
math.CO2015
Preferential Attachment Processes Approaching The Rado Multigraph
Richard Elwes
We consider a preferential attachment process in which a multigraph is built one node at a time. The number of edges added at stage , emanating from the new node, is given by so…