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