Robustness of preferential attachment under deletion of edges
Thomas Vallier
Centre for Mathematical Sciences
Mathematical Statistics
Lund Institute of Technology,
Lund University,
2005
ISSN 14039338

Abstract:

We study the effect of deletion of old edges in the preferential attachment
model. We consider a model where every edge is deleted after a time "delta".
The resulting graph has only "delta" edges and its structure doesn't resemble
the strucutre of the former model even for large "delta". In particular,
we prove that the most attractive vertices are no more the first ones. The
deletion also implies that the degree is uniformly bounded in "delta" by
e^{½}.



Key words:

