Article contents
Preferential duplication graphs
Published online by Cambridge University Press: 14 July 2016
Abstract
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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Applied Probability Trust 2010
References
- 4
- Cited by