{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T15:37:15Z","timestamp":1759937835004,"version":"3.37.3"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T00:00:00Z","timestamp":1598227200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T00:00:00Z","timestamp":1598227200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s13278-020-00680-5","type":"journal-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T13:02:36Z","timestamp":1598274156000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A numerical evaluation of the accuracy of influence maximization algorithms"],"prefix":"10.1007","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5913-0972","authenticated-orcid":false,"given":"Hautahi","family":"Kingi","sequence":"first","affiliation":[]},{"given":"Li-An Daniel","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Tom","family":"Shafer","sequence":"additional","affiliation":[]},{"given":"Minh","family":"Huynh","sequence":"additional","affiliation":[]},{"given":"Mike","family":"Trinh","sequence":"additional","affiliation":[]},{"given":"Aaron","family":"Heuser","sequence":"additional","affiliation":[]},{"given":"George","family":"Rochester","sequence":"additional","affiliation":[]},{"given":"Antonio","family":"Paredes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,24]]},"reference":[{"key":"680_CR1","doi-asserted-by":"crossref","unstructured":"Akbarpour M, Malladi S, Saberi A (2018) Diffusion, seeding, and the value of network information. In: Proceedings of the 2018 ACM conference on economics and computation. ACM, pp 641\u2013641","DOI":"10.1145\/3219166.3219225"},{"issue":"6794","key":"680_CR2","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1038\/35019019","volume":"406","author":"R Albert","year":"2000","unstructured":"Albert R, Jeong H, Barab\u00e1si A-L (2000) Error and attack tolerance of complex networks. Nature 406(6794):378","journal-title":"Nature"},{"key":"680_CR3","doi-asserted-by":"crossref","unstructured":"Bader DA, Madduri K (2008) Snap, small-world network analysis and partitioning: an open-source parallel graph framework for the exploration of large-scale networks. In: 2008 IEEE international symposium on parallel and distributed processing. IEEE, pp 1\u201312","DOI":"10.1109\/IPDPS.2008.4536261"},{"issue":"5439","key":"680_CR4","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A-L Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si A-L, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512","journal-title":"Science"},{"key":"680_CR5","first-page":"544","volume":"2011","author":"J Barnat","year":"2011","unstructured":"Barnat J, Bauch P, Brim L, Ceska M (2011) Computing strongly connected components in parallel on cuda. IEEE Int Parallel Distrib Process Sympos 2011:544\u2013555","journal-title":"IEEE Int Parallel Distrib Process Sympos"},{"key":"680_CR6","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-319-78256-0_4","volume-title":"Social networks and surveillance for society","author":"P Basaras","year":"2019","unstructured":"Basaras P, Katsaros D (2019) Identifying influential spreaders in complex networks with probabilistic links. In: Social networks and surveillance for society. Springer, Cham, pp 57\u201384"},{"issue":"1","key":"680_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/15427951.2004.10129080","volume":"1","author":"B Bollob\u00e1s","year":"2004","unstructured":"Bollob\u00e1s B, Riordan O (2004) Robustness and vulnerability of scale-free random graphs. Internet Math 1(1):1\u201335","journal-title":"Internet Math"},{"key":"680_CR8","doi-asserted-by":"crossref","unstructured":"Borgs C, Brautbar M, Chayes J, Lucier B (2014) Maximizing social influence in nearly optimal time. In: Proceedings of the twenty-fifth annual ACM-SIAM symposium on discrete algorithms. SIAM, pp 946\u2013957","DOI":"10.1137\/1.9781611973402.70"},{"key":"680_CR9","doi-asserted-by":"crossref","unstructured":"Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 199\u2013208","DOI":"10.1145\/1557019.1557047"},{"key":"680_CR10","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. ACM, pp 1029\u20131038","DOI":"10.1145\/1835804.1835934"},{"key":"680_CR11","doi-asserted-by":"publisher","first-page":"6108","DOI":"10.1038\/srep06108","volume":"4","author":"D-B Chen","year":"2014","unstructured":"Chen D-B, Xiao R, Zeng A (2014) Predicting the evolution of spreading on complex networks. Sci Rep 4:6108","journal-title":"Sci Rep"},{"issue":"21","key":"680_CR12","doi-asserted-by":"publisher","first-page":"4626","DOI":"10.1103\/PhysRevLett.85.4626","volume":"85","author":"R Cohen","year":"2000","unstructured":"Cohen R, Erez K, Ben-Avraham D, Havlin S (2000) Resilience of the internet to random breakdowns. Phys Rev Lett 85(21):4626","journal-title":"Phys Rev Lett"},{"key":"680_CR13","doi-asserted-by":"crossref","unstructured":"Domingos P, Richardson M (2001) Mining the network value of customers. In: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 57\u201366","DOI":"10.1145\/502512.502525"},{"key":"680_CR14","doi-asserted-by":"crossref","unstructured":"Domingos P, Richardson M (2002) Mining knowledge-sharing sites for viral marketing. In: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 61\u201370","DOI":"10.1145\/775047.775057"},{"issue":"1","key":"680_CR15","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/s13278-018-0510-5","volume":"8","author":"N Emami","year":"2018","unstructured":"Emami N, Mozafari N, Hamzeh A (2018) Continuous state online influence maximization in social network. Soc Netw Anal Min 8(1):32","journal-title":"Soc Netw Anal Min"},{"issue":"1","key":"680_CR16","first-page":"17","volume":"5","author":"P Erd\u0151s","year":"1960","unstructured":"Erd\u0151s P, R\u00e9nyi A (1960) On the evolution of random graphs. Publ Math Inst Hung Acad Sci 5(1):17\u201360","journal-title":"Publ Math Inst Hung Acad Sci"},{"key":"680_CR17","doi-asserted-by":"crossref","unstructured":"Galhotra S, Arora A, Roy S (2016) Holistic influence maximization: combining scalability and efficiency with opinion-aware models. In: Proceedings of the 2016 international conference on management of data. ACM, pp 743\u2013758","DOI":"10.1145\/2882903.2882929"},{"key":"680_CR18","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LV (2011) Celf++: optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th international conference companion on world wide web. ACM, pp 47\u201348","DOI":"10.1145\/1963192.1963217"},{"key":"680_CR19","doi-asserted-by":"crossref","unstructured":"Harish P, Narayanan P (2007) Accelerating large graph algorithms on the GPU using CUDA. In: International conference on high-performance computing. Springer, pp 197\u2013208","DOI":"10.1007\/978-3-540-77220-0_21"},{"key":"680_CR20","doi-asserted-by":"crossref","unstructured":"He X, Kempe D (2016) Robust influence maximization. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, pp 885\u2013894","DOI":"10.1145\/2939672.2939760"},{"key":"680_CR21","doi-asserted-by":"publisher","first-page":"913","DOI":"10.14778\/3099622.3099623","volume":"10","author":"K Huang","year":"2017","unstructured":"Huang K, Wang S, Bevilacqua G, Xiao X, Lakshmanan L (2017) Revisiting the stop-and-stare algorithms for influence maximization. Proc VLDB Endow 10:913\u2013924","journal-title":"Proc VLDB Endow"},{"key":"680_CR22","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2003) Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"680_CR23","unstructured":"Kim J, Kim SK, Yu H (2013) Scalable and parallelizable processing of influence maximization for large-scale social networks? In: IEEE 29th international conference on data engineering (ICDE). IEEE, pp 266\u2013277"},{"key":"680_CR24","doi-asserted-by":"crossref","unstructured":"LaSalle D, Karypis G (2013) Multi-threaded graph partitioning. In: IEEE 27th international symposium on parallel and distributed processing. IEEE, pp 225\u2013236","DOI":"10.1109\/IPDPS.2013.50"},{"key":"680_CR25","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: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 420\u2013429","DOI":"10.1145\/1281192.1281239"},{"key":"680_CR26","doi-asserted-by":"crossref","unstructured":"Li X, Smith JD, Dinh TN, Thai MT (2017) Why approximate when you can get the exact? Optimal targeted viral marketing at scale. In: IEEE INFOCOM 2017-IEEE conference on computer communications. IEEE, pp 1\u20139","DOI":"10.1109\/INFOCOM.2017.8057069"},{"issue":"2","key":"680_CR27","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1109\/TNET.2019.2898413","volume":"27","author":"X Li","year":"2019","unstructured":"Li X, Smith JD, Dinh TN, Thai MT (2019) Tiptop:(almost) exact solutions for influence maximization in billion-scale networks. IEEE\/ACM Trans Netw 27(2):649\u2013661","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"1","key":"680_CR28","first-page":"136","volume":"25","author":"X Liu","year":"2013","unstructured":"Liu X, Li M, Li S, Peng S, Liao X, Lu X (2013) Imgpu: GPU-accelerated influence maximization in large-scale social networks. IEEE Trans Parallel Distrib Syst 25(1):136\u2013145","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"680_CR29","volume-title":"Nonequilibrium phase transitions in lattice models","author":"J Marro","year":"2005","unstructured":"Marro J, Dickman R (2005) Nonequilibrium phase transitions in lattice models. Cambridge University Press, Al\u00e9a-Saclay"},{"issue":"2\u20133","key":"680_CR30","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1002\/rsa.3240060204","volume":"6","author":"M Molloy","year":"1995","unstructured":"Molloy M, Reed B (1995) A critical point for random graphs with a given degree sequence. Random Struct Algorithms 6(2\u20133):161\u2013180","journal-title":"Random Struct Algorithms"},{"issue":"5","key":"680_CR31","doi-asserted-by":"publisher","first-page":"5678","DOI":"10.1103\/PhysRevE.61.5678","volume":"61","author":"C Moore","year":"2000","unstructured":"Moore C, Newman ME (2000) Epidemics and percolation in small-world networks. Phys Rev E 61(5):5678","journal-title":"Phys Rev E"},{"issue":"1","key":"680_CR32","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s13278-018-0548-4","volume":"9","author":"J More","year":"2019","unstructured":"More J, Lingam C (2019) A gradient-based methodology for optimizing time for influence diffusion in social networks. Soc Netw Anal Min 9(1):5","journal-title":"Soc Netw Anal Min"},{"issue":"7563","key":"680_CR33","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1038\/nature14604","volume":"524","author":"F Morone","year":"2015","unstructured":"Morone F, Makse HA (2015) Influence maximization in complex networks through optimal percolation. Nature 524(7563):65","journal-title":"Nature"},{"issue":"2","key":"680_CR34","doi-asserted-by":"publisher","first-page":"025102","DOI":"10.1103\/PhysRevE.64.025102","volume":"64","author":"ME Newman","year":"2001","unstructured":"Newman ME (2001) Clustering and preferential attachment in growing networks. Phys Rev E 64(2):025102","journal-title":"Phys Rev E"},{"key":"680_CR35","doi-asserted-by":"crossref","unstructured":"Nguyen HT, Thai MT, Dinh TN (2016) Stop-and-stare: optimal sampling algorithms for viral marketing in billion-scale networks. In: Proceedings of the 2016 international conference on management of data. ACM, pp 695\u2013710","DOI":"10.1145\/2882903.2915207"},{"issue":"6","key":"680_CR36","doi-asserted-by":"publisher","first-page":"066117","DOI":"10.1103\/PhysRevE.63.066117","volume":"63","author":"R Pastor-Satorras","year":"2001","unstructured":"Pastor-Satorras R, Vespignani A (2001) Epidemic dynamics and endemic states in complex networks. Phys Rev E 63(6):066117","journal-title":"Phys Rev E"},{"key":"680_CR37","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/s13278-016-0367-4","volume":"6","author":"M Piraveenan","year":"2016","unstructured":"Piraveenan M, Harr\u00e9 M, Kasthurirathna D (2016) Optimising influence in social networks using bounded rationality models. Soc Netw Anal Min 6:54","journal-title":"Soc Netw Anal Min"},{"key":"680_CR38","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/s13278-015-0305-x","volume":"5","author":"A Srivastava","year":"2015","unstructured":"Srivastava A, Chelmis C, Prasanna V (2015) The unified model of social influence and its application in influence maximization. Soc Netw Anal Min 5:66","journal-title":"Soc Netw Anal Min"},{"key":"680_CR39","doi-asserted-by":"crossref","unstructured":"Tang Y, Xiao X, Shi Y (2014) Influence maximization: near-optimal time complexity meets practical efficiency. In: Proceedings of the 2014 ACM SIGMOD international conference on management of data. ACM, pp 75\u201386","DOI":"10.1145\/2588555.2593670"},{"key":"680_CR40","doi-asserted-by":"crossref","unstructured":"Tang Y, Shi Y, Xiao X (2015) Influence maximization in near-linear time: a martingale approach. In: Proceedings of the 2015 ACM SIGMOD international conference on management of data. ACM, pp 1539\u20131554","DOI":"10.1145\/2723372.2723734"},{"key":"680_CR41","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/s13278-018-0489-y","volume":"8","author":"J Tang","year":"2018","unstructured":"Tang J, Tang X, Yuan J (2018) An efficient and effective hop-based approach for influence maximization in social networks. Soc Netw Anal Min 8:10","journal-title":"Soc Netw Anal Min"},{"key":"680_CR42","doi-asserted-by":"crossref","unstructured":"Tsugawa S, Ohsaki H (2018) Robustness of influence maximization against non-adversarial perturbations. In: IEEE\/ACM international conference on advances in social networks analysis and mining. Springer, Cham, pp 193\u2013210","DOI":"10.1007\/978-3-030-02592-2_10"},{"issue":"6684","key":"680_CR43","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of \u2018small-world\u2019 networks. Nature 393(6684):440","journal-title":"Nature"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-020-00680-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13278-020-00680-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-020-00680-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,24]],"date-time":"2021-08-24T01:01:28Z","timestamp":1629766888000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13278-020-00680-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,24]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["680"],"URL":"https:\/\/doi.org\/10.1007\/s13278-020-00680-5","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"type":"print","value":"1869-5450"},{"type":"electronic","value":"1869-5469"}],"subject":[],"published":{"date-parts":[[2020,8,24]]},"assertion":[{"value":"26 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 July 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 August 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"70"}}