Stable sets of threshold-based cascades on the erdős-rényi random graphs

  • Authors:

  • Ching-Lueh Chang;Yuh-Dauh Lyuu

  • Affiliations:

  • Department of Computer Science and Engineering, Yuan Ze University, Taoyuan, Taiwan;Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan

  • Venue:
  • IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Consider the following reversible cascade on the Erdős-Rényi random graph G(n,p). In round zero, a set of vertices, called the seeds, are active. For a given ρ∈( 0,1 ], a non-isolated vertex is activated (resp., deactivated) in round t∈ℤ+ if the fraction f of its neighboring vertices that were active in round t−1 satisfies f≥ρ (resp., fρ). An irreversible cascade is defined similarly except that active vertices cannot be deactivated. A set of vertices, S, is said to be stable if no vertex will ever change its state, from active to inactive or vice versa, once the set of active vertices equals S. For both the reversible and the irreversible cascades, we show that for any constant ε0, all p∈[ (1+ε) (ln (e/ρ))/n,1 ] and with probability 1−n−Ω(1), every stable set of G(n,p) has size O(⌈ρn⌉) or n−O(⌈ρn⌉).