Preferential duplication graphs

Netta Cohen, Jonathan Jordan and Margaritis Voliotis
To appear in Journal of Applied Probability, June 2010.

We consider a preferential duplication model for growing random graphs, extending previous models of duplication graphs by selecting the vertex to be duplicated with probability proportional to its degree. We show that a special case of this model can be analysed using the same stochastic approximation as for vertex-reinforced random walks, and show that ``trapping'' behaviour can occur, such that the descendants of a particular group of initial vertices come to dominate the graph.

White Rose version of paper

Back to my research page.
Last updated 1 August 2014.