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.
| Translated title of the contribution | Preferential duplication graphs |
|---|---|
| Original language | English |
| Pages (from-to) | 572 - 585 |
| Number of pages | 13 |
| Journal | Journal of Applied Probability |
| Volume | 47 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 2010 |
Research Groups and Themes
- Engineering Mathematics Research Group