{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T19:01:01Z","timestamp":1767034861255},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,10,8]],"date-time":"2013-10-08T00:00:00Z","timestamp":1381190400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1007\/s13278-013-0135-7","type":"journal-article","created":{"date-parts":[[2013,10,7]],"date-time":"2013-10-07T10:23:16Z","timestamp":1381141396000},"page":"1225-1248","source":"Crossref","is-referenced-by-count":46,"title":["A scalable heuristic for viral marketing under the tipping model"],"prefix":"10.1007","volume":"3","author":[{"given":"Paulo","family":"Shakarian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sean","family":"Eyre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Damon","family":"Paulo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,10,8]]},"reference":[{"key":"135_CR1","unstructured":"Arenas A (2012) Network data sets. http:\/\/deim.urv.cat\/aarenas\/data\/welcome.htm"},{"key":"135_CR2","doi-asserted-by":"crossref","unstructured":"Baxter GJ, Dorogovtsev SN, Goltsev AV, Mendes JFF (2011) Heterogeneous k-core versus bootstrap percolation on complex networks. Phys Rev E 83(5):051134","DOI":"10.1103\/PhysRevE.83.051134"},{"issue":"1","key":"135_CR3","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.disopt.2010.09.007","volume":"8","author":"O Ben-Zwi","year":"2011","unstructured":"Ben-Zwi O, Hermelin D, Lokshtanov D, Newman I (2011) Treewidth governs the complexity of target set selection. Discrete Optim 8(1):87\u201396","journal-title":"Discrete Optim"},{"key":"135_CR4","doi-asserted-by":"crossref","unstructured":"Blondel VD, Guillaume J-L, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp P10008. doi: 10.1088\/1742-5468\/2008\/10\/P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"135_CR5","doi-asserted-by":"crossref","unstructured":"Boldi P, Rosa M, Vigna S (2013) Robustness of social and web graphs to node removal. Soc Netw Anal Min, pp 1\u201314. doi: 10.1007\/s13278-013-0096-x","DOI":"10.1007\/s13278-013-0096-x"},{"issue":"1","key":"135_CR6","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1080\/0022250X.1972.9989806","volume":"2","author":"P Bonacich","year":"1972","unstructured":"Bonacich P (1972) Factoring and weighting approaches to status scores and clique identification. J Math Soc 2(1):113\u2013120. doi: 10.1080\/0022250X.1972.9989806","journal-title":"J Math Soc"},{"key":"135_CR7","unstructured":"Borgs C, Brautbar M, Chayes J, Lucier B (2012) Influence maximization in social networks: towards an optimal algorithmic solution. arXiv preprint arXiv:1212.0884"},{"key":"135_CR8","doi-asserted-by":"crossref","unstructured":"Brandes U (2001) A faster algorithm for betweenness centrality. J Math Sociol 25(2):163\u2013177. doi: 10.1080\/0022250X.2001.9990249","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"135_CR9","doi-asserted-by":"crossref","unstructured":"Carmi S, Havlin S, Kirkpatrick S, Shavitt Y, Shir E (2007) From the cover: a model of Internet topology using k-shell decomposition. PNAS 104(27):11150\u201311154. doi: 10.1073\/pnas.0701175104","DOI":"10.1073\/pnas.0701175104"},{"key":"135_CR10","doi-asserted-by":"crossref","unstructured":"Catanese S, Ferrara E, Fiumara G (2013) Forensic analysis of phone call networks. Soc Netw Anal Min 3(1):15\u201333 . doi: 10.1007\/s13278-012-0060-1","DOI":"10.1007\/s13278-012-0060-1"},{"issue":"5996","key":"135_CR11","doi-asserted-by":"crossref","first-page":"1194","DOI":"10.1126\/science.1185231","volume":"329","author":"D Centola","year":"2010","unstructured":"Centola D (2010) The spread of behavior in an online social network experiment. Science 329(5996):1194\u20131197. doi: 10.1126\/science.1185231","journal-title":"Science"},{"key":"135_CR12","doi-asserted-by":"crossref","first-page":"1400","DOI":"10.1137\/08073617X","volume":"23","author":"N Chen","year":"2009","unstructured":"Chen N (2009) On the approximability of influence in social networks. SIAM J Discret Math 23:1400\u20131415","journal-title":"SIAM J Discret Math"},{"key":"135_CR13","doi-asserted-by":"crossref","unstructured":"Chen W, Wang C, Wang Y (2010) Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201910. ACM, New York, pp 1029\u20131038","DOI":"10.1145\/1835804.1835934"},{"key":"135_CR14","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms, 2nd edn. MIT Press. http:\/\/mitpress.mit.edu\/catalog\/item\/default.asp?tid=8570&ttype=2"},{"issue":"7","key":"135_CR15","doi-asserted-by":"crossref","first-page":"1615","DOI":"10.1016\/j.dam.2008.09.012","volume":"157","author":"P Dreyer","year":"2009","unstructured":"Dreyer P, Roberts F (2009) Irreversible -threshold processes: graph-theoretical threshold models of the spread of disease and of opinion. Discrete Appl Math 157(7):1615\u20131627. doi: 10.1016\/j.dam.2008.09.012","journal-title":"Discrete Appl Math"},{"key":"135_CR16","doi-asserted-by":"crossref","unstructured":"Dyagilev K, Mannor S, Yom-Tov E (2013) On information propagation in mobile call networks. Soc Netw Anal Min, pp 1\u201321. doi: 10.1007\/s13278-013-0100-5","DOI":"10.1007\/s13278-013-0100-5"},{"key":"135_CR17","doi-asserted-by":"crossref","unstructured":"Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry 40(1):35\u201341. http:\/\/www.jstor.org\/stable\/3033543","DOI":"10.2307\/3033543"},{"key":"135_CR18","doi-asserted-by":"crossref","unstructured":"Freeman LC (1979) Centrality in social networks conceptual clarification. Soc Netw 1(3):215\u2013239. doi: 10.1016\/0378-8733(78)90021-7 . http:\/\/www.sciencedirect.com\/science\/article\/pii\/0378873378900217","DOI":"10.1016\/0378-8733(78)90021-7"},{"key":"135_CR19","unstructured":"Granovetter M (1978) Threshold models of collective behavior. Am J Sociol 83(6):1420\u20131443. doi: 10.2307\/2778111"},{"key":"135_CR20","unstructured":"Jackson M, Yariv L (2005) Diffusion on social networks. Economie Publique 16(1):69\u201382"},{"key":"135_CR21","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos E (2003) Maximizing the spread of influence through a social network. In: KDD \u201903: Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining. ACM, New York, pp 137\u2013146. doi: 10.1145\/956750.956769","DOI":"10.1145\/956750.956769"},{"key":"135_CR22","doi-asserted-by":"crossref","unstructured":"Kitsak M, Gallos LK, Havlin S, Liljeros F, Muchnik L, Stanley HE, Makse HA (2010) Identification of influential spreaders in complex networks. Nat Phys (11):888\u2013893. doi: 10.1038\/nphys1746","DOI":"10.1038\/nphys1746"},{"key":"135_CR23","unstructured":"Leskovec J (2012) Stanford network analysis project (snap). http:\/\/snap.stanford.edu\/index.html"},{"key":"135_CR24","doi-asserted-by":"crossref","unstructured":"Leskovec J, Krause A, Guestrin C, Faloutsos C, VanBriesen J, Glance N (2007) Cost-effective outbreak detection in networks. In: KDD \u201907: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, New York, pp 420\u2013429. doi: 10.1145\/1281192.1281239","DOI":"10.1145\/1281192.1281239"},{"key":"135_CR25","doi-asserted-by":"crossref","unstructured":"Lieberman E, Hauert C, Nowak MA (2005) Evolutionary dynamics on graphs. Nature 433(7023):312\u2013316. doi: 10.1038\/nature03204","DOI":"10.1038\/nature03204"},{"key":"135_CR26","unstructured":"Newman M (2011) Network data. http:\/\/wwwpersonal.umich.edu\/mejn\/netdata\/"},{"issue":"2","key":"135_CR27","first-page":"026","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69(2):026\u2013113. doi: 10.1103\/PhysRevE.69.026113","journal-title":"Phys Rev E"},{"key":"135_CR28","unstructured":"Page L, Brin S, Motwani R, Winograd T (1998) The pagerank citation ranking: bringing order to the web. In: Proceedings of the 7th international world wide web conference, pp 161\u2013172"},{"key":"135_CR29","doi-asserted-by":"crossref","unstructured":"Reichman D (2012) New bounds for contagious sets. Discrete Math. doi: 10.1016\/j.disc.2012.01.016","DOI":"10.1016\/j.disc.2012.01.016"},{"key":"135_CR30","unstructured":"Schelling TC (1978) Micromotives and Macrobehavior. W.W. Norton and Co., Pennsylvania"},{"key":"135_CR31","doi-asserted-by":"crossref","unstructured":"Seidman SB (1983) Network structure and minimum degree. Soc Netw 5(3):269\u2013287. doi: 10.1016\/0378-8733(83)90028-X","DOI":"10.1016\/0378-8733(83)90028-X"},{"key":"135_CR32","unstructured":"Shakarian P, Subrahmanian V, Sapino ML (2010) Using generalized annotated programs to solve social network optimization problems. In: Hermenegildo M, Schaub T (eds) Technical communications of the 26th international conference on logic programming, Leibniz International Proceedings in Informatics (LIPIcs), vol 7, pp 182\u2013191. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany. doi: 10.4230\/LIPIcs.ICLP.2010.182 . http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2010\/2596"},{"key":"135_CR33","doi-asserted-by":"crossref","unstructured":"Wasserman S, Faust K (1994) Social network analysis: methods and applications, 1 edn. No. 8 in Structural analysis in the social sciences. Cambridge University Press, Cambridge","DOI":"10.1017\/CBO9780511815478"},{"key":"135_CR34","doi-asserted-by":"crossref","unstructured":"Watts DJ, Dodds PS (2007) Influentials, networks, and public opinion formation. J Consum Res 34(4):441\u2013458. http:\/\/www.journals.uchicago.edu\/doi\/abs\/10.1086\/518527","DOI":"10.1086\/518527"},{"key":"135_CR35","unstructured":"Zafarani R, Liu H (2009) Social computing data repository at ASU. http:\/\/socialcomputing.asu.edu"},{"key":"135_CR36","doi-asserted-by":"crossref","unstructured":"Zhang L, Marbach P (2011) Two is a crowd: optimal trend adoption in social networks. In: Proceedings of international conference on game theory for networks (GameNets)","DOI":"10.1007\/978-3-642-30373-9_42"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-013-0135-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13278-013-0135-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-013-0135-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T19:37:20Z","timestamp":1564429040000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13278-013-0135-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,8]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["135"],"URL":"https:\/\/doi.org\/10.1007\/s13278-013-0135-7","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"value":"1869-5450","type":"print"},{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,8]]}}}