The tipping model and the minimum seed problem

Paulo Shakarian, Abhinav Bhatnagar, Ashkan Aleali, Elham Shaabani, Ruocheng Guo

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

In a “tipping” model, each node in a social network, representing an individual, adopts a property or behavior if a certain number of his incoming neighbors currently exhibit the same. A key problem, with respect to this model, is to select an initial “seed” set from the network such that the entire network adopts any behavior given to the seed. In this chapter, we investigate the problem of identifying a seed set of minimum size—which is NP-hard. We provide exact and heuristic methods for solving this problem as well as a suite of results to not only demonstrate the utility of these methods, but provide insight into the dynamics of the tipping model also.

Original languageEnglish (US)
Title of host publicationSpringerBriefs in Computer Science
PublisherSpringer
Pages19-33
Number of pages15
Edition9783319231044
DOIs
StatePublished - Jan 1 2015

Publication series

NameSpringerBriefs in Computer Science
Number9783319231044
ISSN (Print)2191-5768
ISSN (Electronic)2191-5776

Keywords

  • Academic collaboration network
  • Centrality measure
  • Federal energy regulatory commission
  • Maximum influence problem
  • Social media network

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'The tipping model and the minimum seed problem'. Together they form a unique fingerprint.

  • Cite this

    Shakarian, P., Bhatnagar, A., Aleali, A., Shaabani, E., & Guo, R. (2015). The tipping model and the minimum seed problem. In SpringerBriefs in Computer Science (9783319231044 ed., pp. 19-33). (SpringerBriefs in Computer Science; No. 9783319231044). Springer. https://doi.org/10.1007/978-3-319-23105-1_3