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

Fingerprint

Seed
Heuristic methods

Keywords

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

ASJC Scopus subject areas

  • Computer Science(all)

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

The tipping model and the minimum seed problem. / Shakarian, Paulo; Bhatnagar, Abhinav; Aleali, Ashkan; Shaabani, Elham; Guo, Ruocheng.

SpringerBriefs in Computer Science. 9783319231044. ed. Springer, 2015. p. 19-33 (SpringerBriefs in Computer Science; No. 9783319231044).

Research output: Chapter in Book/Report/Conference proceedingChapter

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 edn, SpringerBriefs in Computer Science, no. 9783319231044, Springer, pp. 19-33. https://doi.org/10.1007/978-3-319-23105-1_3
Shakarian P, Bhatnagar A, Aleali A, Shaabani E, Guo R. The tipping model and the minimum seed problem. In SpringerBriefs in Computer Science. 9783319231044 ed. Springer. 2015. p. 19-33. (SpringerBriefs in Computer Science; 9783319231044). https://doi.org/10.1007/978-3-319-23105-1_3
Shakarian, Paulo ; Bhatnagar, Abhinav ; Aleali, Ashkan ; Shaabani, Elham ; Guo, Ruocheng. / The tipping model and the minimum seed problem. SpringerBriefs in Computer Science. 9783319231044. ed. Springer, 2015. pp. 19-33 (SpringerBriefs in Computer Science; 9783319231044).
@inbook{fd1c6ed9d6f646b6b1efe845c94a5c15,
title = "The tipping model and the minimum seed problem",
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.",
keywords = "Academic collaboration network, Centrality measure, Federal energy regulatory commission, Maximum influence problem, Social media network",
author = "Paulo Shakarian and Abhinav Bhatnagar and Ashkan Aleali and Elham Shaabani and Ruocheng Guo",
year = "2015",
month = "1",
day = "1",
doi = "10.1007/978-3-319-23105-1_3",
language = "English (US)",
series = "SpringerBriefs in Computer Science",
publisher = "Springer",
number = "9783319231044",
pages = "19--33",
booktitle = "SpringerBriefs in Computer Science",
edition = "9783319231044",

}

TY - CHAP

T1 - The tipping model and the minimum seed problem

AU - Shakarian, Paulo

AU - Bhatnagar, Abhinav

AU - Aleali, Ashkan

AU - Shaabani, Elham

AU - Guo, Ruocheng

PY - 2015/1/1

Y1 - 2015/1/1

N2 - 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.

AB - 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.

KW - Academic collaboration network

KW - Centrality measure

KW - Federal energy regulatory commission

KW - Maximum influence problem

KW - Social media network

UR - http://www.scopus.com/inward/record.url?scp=85044942073&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85044942073&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-23105-1_3

DO - 10.1007/978-3-319-23105-1_3

M3 - Chapter

AN - SCOPUS:85044942073

T3 - SpringerBriefs in Computer Science

SP - 19

EP - 33

BT - SpringerBriefs in Computer Science

PB - Springer

ER -