The tipping model and the minimum seed problem

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

doi:10.1007/978-3-319-23105-1_3

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 proceeding › Chapter

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 language	English (US)
Title of host publication	SpringerBriefs in Computer Science
Publisher	Springer
Pages	19-33
Number of pages	15
Edition	9783319231044
DOIs	https://doi.org/10.1007/978-3-319-23105-1_3
State	Published - 2015

Publication series

Name	SpringerBriefs in Computer Science
Number	9783319231044
Volume	0
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

General Computer Science

Access to Document

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

Cite this

@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",

note = "Publisher Copyright: {\textcopyright} 2015, The Author(s).",

year = "2015",

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

Y1 - 2015

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 -

The tipping model and the minimum seed problem

Abstract

Publication series

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this