{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T10:27:35Z","timestamp":1747477655173,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,7,6]],"date-time":"2022-07-06T00:00:00Z","timestamp":1657065600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,7,6]],"date-time":"2022-07-06T00:00:00Z","timestamp":1657065600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Universit\u00e0 degli Studi di Roma La Sapienza"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2022,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Community deception is about hiding a target community that wants to remain below the radar of community detection algorithms. The goal is to devise algorithms that, given a maximum number of updates (e.g., edge additions and removal), strive to find the best way to perform such updates in order to hide the target community inside the community structure found by a detection algorithm. So far, community deception has only been studied for undirected networks, although many real-world networks (e.g., Twitter) are directed. One way to overcome this problem would be to treat the network as undirected. However, this approach discards potentially helpful information in the edge directions (e.g., A follows B does not imply that B follows A). The aim of this paper is threefold. First, to give an account of the state-of-the-art community deception techniques in undirected networks underlying their peculiarities. Second, to investigate the community deception problem in directed networks and to show how deception techniques proposed for undirected networks should be modified and adapted to work on directed networks. Third, to evaluate deception techniques both in undirected and directed networks. Our experimental evaluation on a variety of (large) directed networks shows that techniques that work well for undirected networks fail short when directly applied to directed networks, thus underlying the need for specific approaches.<\/jats:p>","DOI":"10.1007\/s13278-022-00896-7","type":"journal-article","created":{"date-parts":[[2022,7,6]],"date-time":"2022-07-06T08:03:57Z","timestamp":1657094637000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Community deception: from undirected to directed networks"],"prefix":"10.1007","volume":"12","author":[{"given":"Valeria","family":"Fionda","sequence":"first","affiliation":[]},{"given":"Saif Aldeen","family":"Madi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7499-5798","authenticated-orcid":false,"given":"Giuseppe","family":"Pirr\u00f2","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,6]]},"reference":[{"issue":"10","key":"896_CR1","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel VD, Guillaume J-L, Lambiotte R, Lefebvre E (2008) Fast Unfolding of Communities in Large Networks. J Stat Mech 2008(10):P10008","journal-title":"J Stat Mech"},{"issue":"2","key":"896_CR2","first-page":"1","volume":"11","author":"T Chakraborty","year":"2016","unstructured":"Chakraborty T, Srinivasan S, Ganguly N, Mukherjee A, Bhowmick S (2016) Permanence and community structure in complex networks. ACM TKDD 11(2):1\u201334","journal-title":"ACM TKDD"},{"issue":"9","key":"896_CR3","first-page":"P09008","volume":"1","author":"L Danon","year":"2005","unstructured":"Danon L, Diaz-Guilera A, Duch J, Arenas A (2005) Comparing community structure identification. J Stat Mech Theory Exp 1(9):P09008","journal-title":"J Stat Mech Theory Exp"},{"issue":"4","key":"896_CR4","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1109\/TKDE.2017.2776133","volume":"30","author":"V Fionda","year":"2018","unstructured":"Fionda V, Pirr\u00f2 G (2018) Community deception or: how to stop fearing community detection algorithms. IEEE Trans Knowl Data Eng 30(4):660\u2013673","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"896_CR5","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-030-93413-2_13","volume-title":"Complex networks & their applications X","author":"V Fionda","year":"2022","unstructured":"Fionda V, Pirr\u00f2 G (2022) Community deception in networks: where we are and where we should go. In: Rosa Maria B, Chantal C, Hocine C, Esteban M, Rocha LM, Sales-Pardo M (eds) Complex networks & their applications X. Springer International Publishing, Cham, pp 144\u2013155"},{"issue":"3","key":"896_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato S (2010) Community detection in graphs. Phys Rep 486(3):75\u2013174","journal-title":"Phys Rep"},{"key":"896_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2016.09.002","volume":"659","author":"S Fortunato","year":"2016","unstructured":"Fortunato S, Hric D (2016) Community detection in networks: a user guide. Phys Rep 659:1\u201344","journal-title":"Phys Rep"},{"key":"896_CR8","doi-asserted-by":"crossref","unstructured":"Jia J, Wang B, Cao X, Gong NZ (2020). Certified robustness of community detection against adversarial structural perturbation via randomized smoothing. In Proceedings of The Web Conference 2020, pp 2718\u20132724","DOI":"10.1145\/3366423.3380029"},{"issue":"2","key":"896_CR9","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1109\/TCSS.2021.3103515","volume":"9","author":"T Khaund","year":"2022","unstructured":"Khaund T, Kirdemir B, Agarwal N, Liu H, Morstatter F (2022) Social bots and their coordination during online campaigns: a survey. IEEE Trans Comput Soc Syst 9(2):530\u2013545","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"896_CR10","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1017\/S0003055413000014","volume":"107","author":"G King","year":"2013","unstructured":"King G, Pan J, Roberts ME (2013) How censorship in china allows government criticism but silences collective expression. Am Polit Sci Rev 107:326\u2013343","journal-title":"Am Polit Sci Rev"},{"issue":"11","key":"896_CR11","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.100.118703","volume":"100","author":"EA Leicht","year":"2008","unstructured":"Leicht EA, Newman MEJ (2008) Community structure in directed networks. Phys Rev Lett 100(11):118703","journal-title":"Phys Rev Lett"},{"key":"896_CR12","first-page":"12938","volume":"32","author":"Y Liu","year":"2019","unstructured":"Liu Y, Liu J, Zhang Z, Zhu L, Li A (2019) Rem: from structural entropy to community structure deception. Adv Neural Inf Process Syst 32:12938\u201312948","journal-title":"Adv Neural Inf Process Syst"},{"issue":"1","key":"896_CR13","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1109\/TNSE.2020.3049068","volume":"8","author":"T Magelinski","year":"2021","unstructured":"Magelinski T, Bartulovic M, Carley KM (2021) Measuring node contribution to community structure with modularity vitality. IEEE Trans Netw Sci Eng 8(1):707\u2013723","journal-title":"IEEE Trans Netw Sci Eng"},{"issue":"4","key":"896_CR14","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.physrep.2013.08.002","volume":"533","author":"FD Malliaros","year":"2013","unstructured":"Malliaros FD, Vazirgiannis M (2013) Clustering and community detection in directed networks: a survey. Phys Rep 533(4):95\u2013142","journal-title":"Phys Rep"},{"key":"896_CR15","doi-asserted-by":"crossref","unstructured":"Mittal S, Sengupta D, Chakraborty T (2021) Hide and seek: outwitting community detection algorithms. IEEE Transactions on Computational Social Systems","DOI":"10.1109\/TCSS.2021.3062711"},{"key":"896_CR16","doi-asserted-by":"crossref","unstructured":"Nagaraja S (2010) The impact of unlinkability on adversarial community detection: effects and countermeasures. In PETS, pp 253\u2013272","DOI":"10.1007\/978-3-642-14527-8_15"},{"issue":"6","key":"896_CR17","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.066133","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman MEJ (2004) Fast algorithm for detecting community structure in networks. Phys Rev E 69(6):066133","journal-title":"Phys Rev E"},{"issue":"23","key":"896_CR18","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"MEJ Newman","year":"2006","unstructured":"Newman MEJ (2006) Modularity and community structure in networks. PNAS 103(23):8577\u20138582","journal-title":"PNAS"},{"issue":"2","key":"896_CR19","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.026113","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):026113","journal-title":"Phys Rev E"},{"issue":"5","key":"896_CR20","doi-asserted-by":"publisher","DOI":"10.1126\/sciadv.1602548","volume":"3","author":"L Peel","year":"2017","unstructured":"Peel L, Larremore DB, Clauset A (2017) The ground truth about metadata and community detection in networks. Sci Adv 3(5):e1602548","journal-title":"Sci Adv"},{"key":"896_CR21","doi-asserted-by":"crossref","unstructured":"Remy C, Rym B, Matthieu L (2017). Tracking bitcoin users activity using community detection on a network of weak signals. In International conference on complex networks and their applications, pp 166\u2013177. Springer","DOI":"10.1007\/978-3-319-72150-7_14"},{"issue":"4","key":"896_CR22","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1073\/pnas.0706851105","volume":"105","author":"M Rosvall","year":"2008","unstructured":"Rosvall M, Bergstrom CT (2008) Maps of random walks on complex networks reveal community structure. PNAS 105(4):1118\u20131123","journal-title":"PNAS"},{"key":"896_CR23","doi-asserted-by":"crossref","unstructured":"Rozemberczki B, Davies R, Sarkar R, Sutton C (2019). Gemsec: graph embedding with self clustering. In: Proceedings of the 2019 IEEE\/ACM international conference on advances in social networks analysis and mining, pp 65\u201372","DOI":"10.1145\/3341161.3342890"},{"issue":"6825","key":"896_CR24","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(6825):268\u2013276","journal-title":"Nature"},{"issue":"2","key":"896_CR25","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.92.022816","volume":"92","author":"VA Traag","year":"2015","unstructured":"Traag VA, Aldecoa R, Delvenne J-C (2015) Detecting communities using asymptotical surprise. Phys Rev E 92(2):022816","journal-title":"Phys Rev E"},{"issue":"1","key":"896_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-019-41695-z","volume":"9","author":"VA Traag","year":"2019","unstructured":"Traag VA, Waltman L, Van Eck NJ (2019) From louvain to leiden: guaranteeing well-connected communities. Sci Rep 9(1):1\u201312","journal-title":"Sci Rep"},{"issue":"2","key":"896_CR27","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1038\/s41562-017-0290-3","volume":"2","author":"M Waniek","year":"2018","unstructured":"Waniek M, Michalak TP, Wooldridge MJ, Rahwan T (2018) Hiding individuals and communities in a social network. Nat Human Behav 2(2):139\u2013147","journal-title":"Nat Human Behav"},{"issue":"4","key":"896_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4018\/jgim.2014100101","volume":"22","author":"ST Yuce","year":"2014","unstructured":"Yuce ST, Agarwal N, Wigand RT, Lim M, Robinson RS (2014) Bridging women rights networks: analyzing interconnected online collective actions. J Glob Inf Manag 22(4):1\u201320","journal-title":"J Glob Inf Manag"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-022-00896-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13278-022-00896-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-022-00896-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T14:09:35Z","timestamp":1672668575000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13278-022-00896-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,6]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["896"],"URL":"https:\/\/doi.org\/10.1007\/s13278-022-00896-7","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"type":"print","value":"1869-5450"},{"type":"electronic","value":"1869-5469"}],"subject":[],"published":{"date-parts":[[2022,7,6]]},"assertion":[{"value":"6 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 May 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 July 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"74"}}