Skip to main content
Article thumbnail
Location of Repository

Preferential duplication graphs

By N. Cohen, J. Jordan and M. Voliotis


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

Publisher: Applied Probability Trust
Year: 2010
OAI identifier:

Suggested articles

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.