{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T10:38:49Z","timestamp":1762252729574,"version":"3.37.3"},"reference-count":91,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,4,18]],"date-time":"2018-04-18T00:00:00Z","timestamp":1524009600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s13278-018-0506-1","type":"journal-article","created":{"date-parts":[[2018,4,18]],"date-time":"2018-04-18T15:29:50Z","timestamp":1524065390000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Identifying central nodes for information flow in social networks using compressive sensing"],"prefix":"10.1007","volume":"8","author":[{"given":"Hamidreza","family":"Mahyar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rouzbeh","family":"Hasheminezhad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elahe","family":"Ghalebi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Nazemian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Radu","family":"Grosu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Movaghar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9835-4493","authenticated-orcid":false,"given":"Hamid R.","family":"Rabiee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,18]]},"reference":[{"key":"506_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert R, Barabasi AL (2002) Statistical mechanics of complex networks. Rev Mod Phys 74:47\u201397","journal-title":"Rev Mod Phys"},{"key":"506_CR2","unstructured":"Alexa traffic statistics for Facebook (2016). http:\/\/www.alexa.com\/siteinfo\/facebook.com"},{"key":"506_CR3","unstructured":"Avrachenkov K, Litvak N, Nemirovsky D, Smirnova E, Sokol M (2010) Monte carlo methods for top-k personalized pagerank lists and name disambiguation. INRIA, Tech Report RR-7367 1"},{"key":"506_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/15427951.2013.798601","volume":"10","author":"K Avrachenkov","year":"2014","unstructured":"Avrachenkov K, Litvak N, Sokol M, Towsley D (2014) Quick detection of nodes with large degrees. Internet Math 10:1\u201319","journal-title":"Internet Math"},{"issue":"3","key":"506_CR5","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1109\/TNET.2010.2096429","volume":"19","author":"P Babarczi","year":"2011","unstructured":"Babarczi P, Tapolcai J, Ho PH (2011) Adjacent link failure localization with monitoring trails in all-optical mesh networks. IEEE\/ACM Trans Netw 19(3):907\u2013920","journal-title":"IEEE\/ACM Trans Netw"},{"key":"506_CR6","doi-asserted-by":"crossref","unstructured":"Bader D, Madduri K (2006) Parallel algorithms for evaluating centrality indices in real-world networks. In: International conference on parallel processing (ICPP), pp 539\u2013550","DOI":"10.1109\/ICPP.2006.57"},{"key":"506_CR7","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1016\/j.physa.2013.10.047","volume":"395","author":"J Bae","year":"2014","unstructured":"Bae J, Kim S (2014) Identifying and ranking influential spreaders in complex networks by neighborhood coreness. Phys A 395:549\u2013559","journal-title":"Phys A"},{"issue":"5439","key":"506_CR8","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barabasi","year":"1999","unstructured":"Barabasi AL, Albert R (1999) Emregence of scaling in random networks. Science 286(5439):509\u2013512","journal-title":"Science"},{"key":"506_CR9","doi-asserted-by":"publisher","unstructured":"Benesty J, Chen J, Huang Y, Cohen I (2009) Pearson correlation coefficient. In: Noise reduction in speech processing. Springer Topics in Signal Processing, vol 2. Springer, pp 1\u20134. https:\/\/doi.org\/10.1007\/978-3-642-00296-0_5","DOI":"10.1007\/978-3-642-00296-0_5"},{"issue":"5","key":"506_CR10","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1080\/15427951.2016.1177802","volume":"12","author":"E Bergamini","year":"2016","unstructured":"Bergamini E, Meyerhenke H (2016) Approximating betweenness centrality in fully dynamic networks. Internet Math 12(5):281\u2013314","journal-title":"Internet Math"},{"key":"506_CR11","doi-asserted-by":"crossref","unstructured":"Bergamini E, Borassi M, Crescenzi P, Marino A, Meyerhenke H (2016) Computing top-k closeness centrality faster in unweighted graphs. In: The eighteenth workshop on algorithm engineering and experiments (ALENEX), society for industrial and applied mathematics, vol 1, pp 68\u201380","DOI":"10.1137\/1.9781611974317.6"},{"key":"506_CR12","doi-asserted-by":"crossref","unstructured":"Berinde R, Gilbert A, Indyk P, Karloff H, Strauss M (2008) Combining geometry and combinatorics: a unified approach to sparse signal recovery. In: 46th annual Allerton conference on communication, control, and computing, pp 798\u2013805","DOI":"10.1109\/ALLERTON.2008.4797639"},{"key":"506_CR13","doi-asserted-by":"publisher","first-page":"1170","DOI":"10.1086\/228631","volume":"92","author":"P Bonacich","year":"1987","unstructured":"Bonacich P (1987) Power and centrality: a family of measures. Am J Sociol 92:1170\u20131182","journal-title":"Am J Sociol"},{"key":"506_CR14","doi-asserted-by":"crossref","unstructured":"Bonchi F, De Francisci Morales G, Riondato M (2016) Centrality measures on big graphs: exact, approximated, and distributed algorithms. In: International conference companion on world wide web (WWW), pp 1017\u20131020","DOI":"10.1145\/2872518.2891063"},{"key":"506_CR15","unstructured":"Borassi M, Crescenzi P, Marino A (2015) Fast and simple computation of top-k closeness centralities. arXiv:1507.01490v1"},{"key":"506_CR16","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10588-006-7084-x","volume":"12","author":"SP Borgatti","year":"2006","unstructured":"Borgatti SP (2006) Identifying sets of key players in a social network. Comput Math Organ Theory 12:21\u201334","journal-title":"Comput Math Organ Theory"},{"key":"506_CR17","doi-asserted-by":"publisher","first-page":"026116","DOI":"10.1103\/PhysRevE.85.026116","volume":"85","author":"J Borge-Holthoefer","year":"2012","unstructured":"Borge-Holthoefer J, Moreno Y (2012) Absence of influential spreaders in rumor dynamics. Phys. Rev. E 85:026116","journal-title":"Phys. Rev. E"},{"key":"506_CR18","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1080\/0022250X.2001.9990249","volume":"25","author":"U Brandes","year":"2001","unstructured":"Brandes U (2001) A faster algorithm for betweenness centrality. J Math Sociol 25:163\u2013177","journal-title":"J Math Sociol"},{"key":"506_CR19","doi-asserted-by":"publisher","first-page":"2303","DOI":"10.1142\/S0218127407018403","volume":"17","author":"U Brandes","year":"2007","unstructured":"Brandes U, Pich C (2007) Centrality estimation in large networks. Int J Bifurc Chaos 17:2303\u20132318","journal-title":"Int J Bifurc Chaos"},{"key":"506_CR20","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin S, Page L (1998) The anatomy of a large-scale hypertextual web search engine. Comput Netw ISDN Syst 30:107\u2013117","journal-title":"Comput Netw ISDN Syst"},{"key":"506_CR21","doi-asserted-by":"publisher","first-page":"1723","DOI":"10.1137\/S0097539702405292","volume":"31","author":"H Buhrman","year":"2002","unstructured":"Buhrman H, Miltersen PB, Radhakrishnan J, Venkatesh S (2002) Are bitvectors optimal? SIAM J Comput 31:1723\u20131744","journal-title":"SIAM J Comput"},{"issue":"12","key":"506_CR22","doi-asserted-by":"publisher","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"EJ Candes","year":"2005","unstructured":"Candes EJ, Tao T (2005) Decoding by linear programming. IEEE Trans Inf Theory 51(12):4203\u20134215","journal-title":"IEEE Trans Inf Theory"},{"issue":"8","key":"506_CR23","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1002\/cpa.20124","volume":"59","author":"EJ Candes","year":"2006","unstructured":"Candes EJ, Romberg JK, Tao T (2006) Stable signal recovery from incomplete and inaccurate measurements. Commun Pure Appl Math 59(8):1207\u20131223","journal-title":"Commun Pure Appl Math"},{"issue":"1","key":"506_CR24","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1137\/S003614450037906X","volume":"43","author":"SS Chen","year":"2001","unstructured":"Chen SS, Donoho DL, Saunders MA (2001) Atomic decomposition by basis pursuit. SIAM Rev 43(1):129\u2013159","journal-title":"SIAM Rev"},{"issue":"1","key":"506_CR25","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1109\/TIT.2011.2169535","volume":"58","author":"M Cheraghchi","year":"2012","unstructured":"Cheraghchi M, Karbasi A, Mohajer S, Saligrama V (2012) Graph constrained group testing. IEEE Trans Inf Theory 58(1):248\u2013262","journal-title":"IEEE Trans Inf Theory"},{"key":"506_CR26","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1080\/00018730601170527","volume":"56","author":"LDF Costa","year":"2007","unstructured":"Costa LDF, Rodrigues FA, Travieso G, Villas-Boas PR (2007) Characterization of complex networks: a survey of measurements. Adv Phys 56:167\u2013242","journal-title":"Adv Phys"},{"key":"506_CR27","volume-title":"Introduction to compressed sensing, chapter in compressed sensing: theory and applications","author":"M Davenport","year":"2012","unstructured":"Davenport M, Duarte M, Eldar Y, Kutyniok G (2012) Introduction to compressed sensing, chapter in compressed sensing: theory and applications, 1st edn. Cambridge University Press, Cambridge","edition":"1"},{"issue":"4","key":"506_CR28","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"D Donoho","year":"2006","unstructured":"Donoho D (2006) Compressed sensing. IEEE Trans Inf Theory 52(4):1289\u20131306","journal-title":"IEEE Trans Inf Theory"},{"key":"506_CR29","doi-asserted-by":"publisher","first-page":"1079","DOI":"10.1080\/00018730110112519","volume":"51","author":"S Dorogovtsev","year":"2002","unstructured":"Dorogovtsev S, Mendes JFF (2002) Evolution of networks. Adv Phys 51:1079\u20131187","journal-title":"Adv Phys"},{"key":"506_CR30","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erdos","year":"1959","unstructured":"Erdos P, Renyi A (1959) On random graphs. Publ Math (Debrecen) 6:290\u2013297","journal-title":"Publ Math (Debrecen)"},{"issue":"1","key":"506_CR31","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.socnet.2004.11.007","volume":"27","author":"M Everett","year":"2005","unstructured":"Everett M, Borgatti SP (2005) Ego network betweenness. Soc Netw 27(1):31\u201338","journal-title":"Soc Netw"},{"key":"506_CR32","unstructured":"Facebook advertising (2017). http:\/\/www.facebook.com\/advertising"},{"key":"506_CR33","unstructured":"Facebook Connections Limit. https:\/\/www.facebook.com\/help\/community\/question\/?id=492434414172691"},{"key":"506_CR34","unstructured":"Facebook Climbs To 1.59 Billion Users And Crushes Q4 Estimates With 5.8B Revenue (2016). http:\/\/techcrunch.com\/2016\/01\/27\/facebook-earnings-q4-2015"},{"key":"506_CR35","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"L Freeman","year":"1977","unstructured":"Freeman L (1977) A set of measures of centrality based on betweenness. Sociometry 40:35\u201341","journal-title":"Sociometry"},{"key":"506_CR36","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"LC Freeman","year":"1978","unstructured":"Freeman LC (1978) Centrality in social networks conceptual clarification. Soc Netw 1:215\u2013239","journal-title":"Soc Netw"},{"key":"506_CR37","unstructured":"Geere D (2010) Samsung offers free phones to frustrated iPhone users. http:\/\/www.cnn.com\/2010\/TECH\/mobile\/07\/24\/samsung. replacing.iphones , CNN Tech"},{"key":"506_CR38","unstructured":"Gephi platform for interactive visualization and exploration of graphs. http:\/\/rankinfo.pkqs.net\/twittercrawl.dot.gz (2017)"},{"key":"506_CR39","unstructured":"Ghalebi E, Mahyar H, Grosu R, Rabiee HR (2017) Compressive sampling for sparse recovery in networks. In: Proc of the 23rd ACM SIGKDD conference on knowledge discovery and data mining (KDD), 13th international workshop on mining and learning with graphs, Halifax, Nova Scotia, Canada, pp 1\u20138"},{"issue":"2","key":"506_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1509\/jmkg.73.2.1","volume":"73","author":"J Goldenberg","year":"2009","unstructured":"Goldenberg J, Han S, Lehmann DR, Hong JW (2009) The role of hubs in the adoption process. J Mark 73(2):1\u201313","journal-title":"J Mark"},{"key":"506_CR41","first-page":"1","volume":"233","author":"I Hamed","year":"2015","unstructured":"Hamed I, Charrad M (2015) Recognizing information spreaders in terrorist networks: 26\/11 attack case study. Lect Notes Bus Inf Process 233:1\u201312","journal-title":"Lect Notes Bus Inf Process"},{"key":"506_CR42","doi-asserted-by":"crossref","unstructured":"Harvey N, Patrascu M, Wen Y, Yekhanin S, Chan V (2007) Nonadaptive fault diagnosis for all-optical networks via combinatorial group testing on graphs. In: IEEE INFOCOM, pp 697\u2013705","DOI":"10.1109\/INFCOM.2007.87"},{"key":"506_CR43","doi-asserted-by":"publisher","first-page":"046101","DOI":"10.1103\/PhysRevE.84.046101","volume":"84","author":"X Huang","year":"2011","unstructured":"Huang X, Vodenska I, Wang F, Havlin S, Stanley HE (2011) Identifying influential directors in the united states corporate governance network. Phys Rev E 84:046101","journal-title":"Phys Rev E"},{"issue":"9","key":"506_CR44","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1109\/JSAC.2013.SUP.0513055","volume":"31","author":"MU Ilyas","year":"2013","unstructured":"Ilyas MU, Shafiq MZ, Liu AX, Radha H (2013) A distributed algorithm for identifying information hubs in social networks. IEEE J Sel Areas Commun 31(9):629\u2013640","journal-title":"IEEE J Sel Areas Commun"},{"key":"506_CR45","unstructured":"Ji S, Yan Z (2017) Refining approximating betweenness centrality based on samplings, pp 1\u201313. arXiv:1608.04472v5"},{"key":"506_CR46","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1016\/j.comcom.2010.06.007","volume":"34","author":"AM Kermarrec","year":"2011","unstructured":"Kermarrec AM, Merrer EL, Sericola B, Tredan G (2011) Second order centrality: distributed assessment of nodes criticity in complex networks. Comput Commun 34:619\u2013628","journal-title":"Comput Commun"},{"key":"506_CR47","unstructured":"Keyou Y, Roberto T, Li Q (2015) Distributed algorithms for computation of centrality measures in complex networks. arXiv:1507.01694v1"},{"key":"506_CR48","doi-asserted-by":"crossref","unstructured":"Kim H, Yoneki E (2012) Influential neighbours selection for information diffusion in online social networks. In: International conference on computer communications and networks (ICCCN)","DOI":"10.1109\/ICCCN.2012.6289230"},{"key":"506_CR49","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1007\/s13278-012-0076-6","volume":"3","author":"N Kourtellis","year":"2013","unstructured":"Kourtellis N, Alahakoon T, Simha R, Iamnitchi A, Tripathi R (2013) Identifying high betweenness centrality nodes in large social networks. Soc Netw Anal Min 3:899\u2013914","journal-title":"Soc Netw Anal Min"},{"key":"506_CR50","doi-asserted-by":"crossref","unstructured":"Kyrillidis A, Cevher V (2012) Combinatorial selection and least absolute shrinkage via the clash algorithm. In: 2012 IEEE international symposium on information theory proceedings (ISIT). IEEE, pp 2216\u20132220","DOI":"10.1109\/ISIT.2012.6283847"},{"key":"506_CR51","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/j.ins.2015.07.053","volume":"326","author":"M Lee","year":"2016","unstructured":"Lee M, Choi S, Chung C (2016) Efficient algorithms for updating betweenness centrality in fully dynamic graphs. Inf Sci 326:278\u2013296","journal-title":"Inf Sci"},{"key":"506_CR52","unstructured":"Lehmann K, Kaufmann M (2003) Decentralized algorithms for evaluating centrality in complex networks, vol 1. Wilhelm Schickard Institute, Technical report"},{"issue":"1","key":"506_CR53","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1217299.1217301","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2007) Graph evolution: Densification and shrinking diameters. ACM Trans Knowl Discov Data 1(1):2","journal-title":"ACM Trans Knowl Discov Data"},{"key":"506_CR54","doi-asserted-by":"crossref","unstructured":"Leskovec J, Huttenlocher D, Kleinberg J (2010) Predicting positive and negative links in online social networks. In: WWW","DOI":"10.1145\/1772690.1772756"},{"key":"506_CR55","doi-asserted-by":"crossref","unstructured":"Lim Y, Menasche DS, Ribeiro B, Towsley D, Basu P (2011) Online estimating the k central nodes of a network. In: IEEE network science workshop, pp 118\u2013122","DOI":"10.1109\/NSW.2011.6004633"},{"key":"506_CR56","doi-asserted-by":"publisher","first-page":"4154","DOI":"10.1016\/j.physa.2013.04.037","volume":"392","author":"JG Liu","year":"2013","unstructured":"Liu JG, Ren ZM, Guo Q (2013) Ranking the spreading influence in complex networks. Phys A 392:4154\u20134159","journal-title":"Phys A"},{"key":"506_CR57","doi-asserted-by":"publisher","first-page":"10,168","DOI":"10.1038\/ncomms10168","volume":"7","author":"L Lu","year":"2016","unstructured":"Lu L, Zhou T, Zhang QM, Stanley H (2016) The h-index of a network node and its relation to degree and coreness. Nature Commun 7:10,168","journal-title":"Nature Commun"},{"key":"506_CR58","doi-asserted-by":"crossref","unstructured":"Mahyar H (2015) Detection of top-k central nodes in social networks: a compressive sensing approach. In: IEEE\/ACM international conference on advances in social networks analysis and mining, ASONAM 2015, Paris, France, pp 902\u2013909","DOI":"10.1145\/2808797.2808811"},{"key":"506_CR59","doi-asserted-by":"crossref","unstructured":"Mahyar H, Rabiee HR, Hashemifar ZS (2013a) UCS-NT: an unbiased compressive sensing framework for network tomography. In: IEEE international conference on acoustics, speech, and signal processing, ICASSP 2013, Vancouver, Canada, pp 4534\u20134538","DOI":"10.1109\/ICASSP.2013.6638518"},{"key":"506_CR60","doi-asserted-by":"crossref","unstructured":"Mahyar H, Rabiee HR, Hashemifar ZS, Siyari P (2013b) UCS-WN: an unbiased compressive sensing framework for weighted networks. In: Conference on information sciences and systems, CISS 2013, Baltimore, USA, pp 1\u20136","DOI":"10.1109\/ICASSP.2013.6638518"},{"key":"506_CR61","doi-asserted-by":"crossref","unstructured":"Mahyar H, Rabiee HR, Movaghar A, Ghalebi E, Nazemian A (2015a) CS-ComDet: a compressive sensing approach for inter-community detection in social networks. In: IEEE\/ACM international conference on advances in social networks analysis and mining, ASONAM 2015, Paris, France, pp 89\u201396","DOI":"10.1145\/2808797.2808856"},{"key":"506_CR62","doi-asserted-by":"crossref","unstructured":"Mahyar H, Rabiee HR, Movaghar A, Hasheminezhad R, Ghalebi E, Nazemian A (2015b) A low-cost sparse recovery framework for weighted networks under compressive sensing. In: IEEE international conference on social computing and networking, SocialCom 2015, Chengdu, China, pp 183\u2013190","DOI":"10.1109\/SmartCity.2015.68"},{"key":"506_CR63","unstructured":"Mahyar H, Ghalebi E, Rabiee HR, Grosu R (2017) The bottlenecks in biological networks. In: Proc of the 34th international conference on machine learning (ICML), Computational Biology Workshop, Sydney, Australia, pp 1\u20135"},{"key":"506_CR64","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.physa.2017.12.145","volume":"497","author":"H Mahyar","year":"2018","unstructured":"Mahyar H, Hasheminezhad R, Ghalebi EK, Nazemian A, Grosu R, Movaghar A, Rabiee HR (2018) Compressive sensing of high betweenness centrality nodes in networks. Phys A 497:166\u2013184","journal-title":"Phys A"},{"key":"506_CR65","first-page":"91","volume":"6118","author":"AS Maiya","year":"2010","unstructured":"Maiya AS, Berger-Wolf TY (2010) Online sampling of high centrality individuals in social networks. Adv Knowl Discov Data Min 6118:91\u201398","journal-title":"Adv Knowl Discov Data Min"},{"key":"506_CR66","unstructured":"Manuel N (2015) Samsung to give iPhone users a trial run with new Galaxy smartphones. http:\/\/www.cnet.com\/news\/samsung-to-give-iphone-users-a-trial-run-with-new-galaxy-smartphones , CNET Tech"},{"key":"506_CR67","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/S0378-8733(02)00016-3","volume":"24","author":"PV Marsden","year":"2002","unstructured":"Marsden PV (2002) Egocentric and sociocentric measures of network centrality. Soc Netw 24:407\u2013422","journal-title":"Soc Netw"},{"key":"506_CR68","doi-asserted-by":"crossref","unstructured":"Middya R, Chakravarty N, Naskar MK (2016) Compressive sensing in wireless sensor networks: a survey. In: IETE technical review","DOI":"10.1080\/02564602.2016.1233835"},{"key":"506_CR69","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and computing: randomized algorithms and probabilistic analysis","author":"M Mitzenmacher","year":"2005","unstructured":"Mitzenmacher M, Upfal E (2005) Probability and computing: randomized algorithms and probabilistic analysis, vol 1. Cambridge University Press, New York"},{"key":"506_CR70","first-page":"065102","volume":"6","author":"AE Motter","year":"2002","unstructured":"Motter AE, Lai YC (2002) Cascade-based attacks on complex networks. Phys Rev E 6:065102","journal-title":"Phys Rev E"},{"key":"506_CR71","doi-asserted-by":"crossref","unstructured":"Nanda S, Kotz D (2008) Localized bridging centrality for distributed network analysis. In: International conference on computer communications and networks (ICCCN), pp 1\u20136","DOI":"10.1109\/ICCCN.2008.ECP.31"},{"issue":"3","key":"506_CR72","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.acha.2008.07.002","volume":"26","author":"D Needell","year":"2009","unstructured":"Needell D, Tropp JA (2009) CoSaMP: iterative signal recovery from incomplete and inaccurate samples. Appl Comput Harmon Anal 26(3):301\u2013321","journal-title":"Appl Comput Harmon Anal"},{"key":"506_CR73","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: an introduction","author":"S Newman","year":"2010","unstructured":"Newman S (2010) Networks: an introduction, vol 1. Oxford University Press, Oxford"},{"key":"506_CR74","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-540-69311-6_21","volume":"5059","author":"K Okamoto","year":"2008","unstructured":"Okamoto K, Chen W, Li XY (2008) Ranking of closeness centrality for large-scale social networks. Front Algorithmics 5059:186\u2013195","journal-title":"Front Algorithmics"},{"issue":"2","key":"506_CR75","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.socnet.2009.02.002","volume":"31","author":"T Opsahl","year":"2009","unstructured":"Opsahl T, Panzarasa P (2009) Clustering in weighted networks. Soc Netw 31(2):155\u2013163","journal-title":"Soc Netw"},{"key":"506_CR76","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/MSP.2005.1458287","volume":"22","author":"N Patwari","year":"2005","unstructured":"Patwari N, Ash JN, Kyperountas S, Hero AO, Moses RL, Correal NS (2005) Locating the nodes: cooperative localization in wireless sensor networks. Sig Process Mag IEEE 22:54\u201369","journal-title":"Sig Process Mag IEEE"},{"key":"506_CR77","unstructured":"Python-iGraph: The open source network analysis package in python (2017). URL http:\/\/igraph.org\/python\/"},{"key":"506_CR78","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/s10618-015-0423-0","volume":"30","author":"M Riondato","year":"2016","unstructured":"Riondato M, Kornaropoulos EM (2016) Fast approximation of betweenness centrality through sampling. Data Min Knowl Discov 30:438\u2013475","journal-title":"Data Min Knowl Discov"},{"key":"506_CR79","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/BF02289527","volume":"31","author":"G Sabidussi","year":"1966","unstructured":"Sabidussi G (1966) The centrality index of a graph. Psychometrika 31:581\u2013603","journal-title":"Psychometrika"},{"key":"506_CR80","doi-asserted-by":"publisher","DOI":"10.1002\/0470072644","volume-title":"Design and analysis of distributed algorithms","author":"N Santoro","year":"2006","unstructured":"Santoro N (2006) Design and analysis of distributed algorithms, vol 56. Wiley, New York"},{"issue":"5","key":"506_CR81","doi-asserted-by":"publisher","first-page":"055,103","DOI":"10.1103\/PhysRevE.71.055103","volume":"71","author":"B Singh","year":"2005","unstructured":"Singh B, Gupte N (2005) Congestion and decongestion in a communication network. Phys Rev E 71(5):055,103","journal-title":"Phys Rev E"},{"key":"506_CR82","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1038\/35065725","volume":"410","author":"SH Strogatz","year":"2001","unstructured":"Strogatz SH (2001) Exploring complex networks. Nature 410:268\u2013276","journal-title":"Nature"},{"key":"506_CR83","unstructured":"Suri NR, Narahari Y (2008) Determining the top-k nodes in social networks using the shapley value. In: International joint conference on autonomous agents and multiagent systems, vol 3, pp 1509\u20131512"},{"key":"506_CR84","doi-asserted-by":"crossref","unstructured":"Taheri SM, Mahyar H, Firouzi M, Ghalebi K, E, Grosu R, Movaghar A (2017) Extracting implicit social relation for social recommendation techniques in user rating prediction. In: Social computing workshop: spatial social behavior analytics on the web at 26th international world wide web conference (WWW), pp 1343\u20131351","DOI":"10.1145\/3041021.3051153"},{"key":"506_CR85","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/s13278-017-0440-7","volume":"7","author":"SM Taheri","year":"2017","unstructured":"Taheri SM, Mahyar H, Firouzi M, Ghalebi KE, Grosu R, Movaghar A (2017) HellRank: a Hellinger-based centrality measure for bipartite social networks. Soc Netw Anal Min (SNAM) 7:22","journal-title":"Soc Netw Anal Min (SNAM)"},{"key":"506_CR86","unstructured":"Twitter Connections Limit. https:\/\/support.twitter.com\/articles\/66885 (2017)"},{"key":"506_CR87","doi-asserted-by":"publisher","unstructured":"Vapnik VN, Chervonenkis AY (2015) On the uniform convergence of relative frequencies of events to their probabilities. In: Vovk V, Papadopoulos H, Gammerman A (eds) Measures of complexity. Springer, Cham, pp 11\u201330. https:\/\/doi.org\/10.1007\/978-3-319-21852-6_3","DOI":"10.1007\/978-3-319-21852-6_3"},{"key":"506_CR88","doi-asserted-by":"crossref","unstructured":"Wang M, Xu W, Mallada E, Tang A (2012) Sparse recovery with graph constraints: fundamental limits and measurement construction. In: IEEE INFOCOM, pp 1871\u20131879","DOI":"10.1109\/INFCOM.2012.6195562"},{"key":"506_CR89","unstructured":"Wehmuth K, Gomes ATA, Ziviani A (2014) DANCE: a framework for the distributed assessment of network centralities. arXiv:1108.1067v2"},{"key":"506_CR90","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1016\/j.physa.2016.11.034","volume":"469","author":"S Xu","year":"2017","unstructured":"Xu S, Wang P (2017) Identifying important nodes by adaptive leaderrank. Phys A 469:654\u2013664","journal-title":"Phys A"},{"key":"506_CR91","doi-asserted-by":"crossref","unstructured":"Xu W, Mallada E, Tang A (2011) Compressive sensing over graphs. In: IEEE INFOCOM, pp 2087\u20132095","DOI":"10.1109\/INFCOM.2011.5935018"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13278-018-0506-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-018-0506-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-018-0506-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,2]],"date-time":"2023-09-02T05:27:50Z","timestamp":1693632470000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13278-018-0506-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,18]]},"references-count":91,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["506"],"URL":"https:\/\/doi.org\/10.1007\/s13278-018-0506-1","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"type":"print","value":"1869-5450"},{"type":"electronic","value":"1869-5469"}],"subject":[],"published":{"date-parts":[[2018,4,18]]},"assertion":[{"value":"23 June 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"33"}}