Adversarial deletion in a scale free random graph process

  • Authors:
  • Abraham D. Flaxman;Alan M. Frieze;Juan Vera

  • Affiliations:
  • Carnegie Mellon University;Carnegie Mellon University;Carnegie Mellon University

  • Venue:
  • SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 neighbors 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 then with high probability at time n the generated graph has a component of size Ω(n).