Adversarial deletion in a scale-free random graph process

A.D. Flaxman, A.M. Frieze, J. Vera

Research output: Contribution to journalArticleScientificpeer-review


We study a dynamically evolving random graph which adds vertices and edges using preferential attachment and is ‘attacked by an adversary’. At time t, we add a new vertex xt and m random edges incident with xt, where m is constant. The neighbours of xt are chosen with probability proportional to degree. After adding the edges, the adversary is allowed to delete vertices. The only constraint on the adversarial deletions is that the total number of vertices deleted by time n must be no larger than δn, where δ is a constant. We show that if δ is sufficiently small and m is sufficiently large then with high probability at time n the generated graph has a component of size at least n/30.
Original languageEnglish
Pages (from-to)261-270
JournalCombinatorics Probability and Computing
Issue number2
Publication statusPublished - 2007
Externally publishedYes


Dive into the research topics of 'Adversarial deletion in a scale-free random graph process'. Together they form a unique fingerprint.

Cite this