Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
110 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Network Members Can Hide from Group Centrality Measures (2312.09791v1)

Published 15 Dec 2023 in cs.SI

Abstract: Group centrality measures are a generalization of standard centrality, designed to quantify the importance of not just a single node (as is the case with standard measures) but rather that of a group of nodes. Some nodes may have an incentive to evade such measures, i.e., to hide their actual importance, in order to conceal their true role in the network. A number of studies have been proposed in the literature to understand how nodes can rewire the network in order to evade standard centrality, but no study has focused on group centrality to date. We close this gap by analyzing four group centrality measures: degree, closeness, betweenness, and GED-walk. We show that an optimal way to rewire the network can be computed efficiently given the former measure, but the problem is NP-complete given closeness and betweenness. Moreover, we empirically evaluate a number of hiding strategies, and show that an optimal way to hide from degree group centrality is also effective in practice against the other measures. Altogether, our results suggest that it is possible to hide from group centrality measures based solely on the local information available to the group members about the network topology.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (47)
  1. Group Centrality Maximization for Large-scale Graphs, pages 56–69. SIAM, Philadelphia, USA, 12 2020.
  2. A.-L. Barabási and R. Albert. Emergence of scaling in random networks. science, 286(5439):509–512, 1999.
  3. Models of social networks based on social distance attachment. Physical review E, 70(5):056122, 2004.
  4. P. Bonacich. Power and centrality: A family of measures. American journal of sociology, 92(5):1170–1182, 1987.
  5. U. Brandes. On variants of shortest-path betweenness centrality and their generic computation. Social networks, 30(2):136–145, 2008.
  6. J. A. Chan-Lau. Systemic centrality and systemic communities in financial networks. Quantitative Finance and Economics, 2(2):468–496, 2018.
  7. Efficient maximum closeness centrality group identification. In Australasian Database Conference, pages 43–55, New York, USA, 2016. Springer.
  8. Ga-based q-attack on community detection. IEEE Transactions on Computational Social Systems, 6(3):491–503, 2019.
  9. P. Crescenzi. A short guide to approximation preserving reductions. In Proceedings of Computational Complexity. Twelfth Annual IEEE Conference, pages 262–273, New York, USA, 1997. IEEE.
  10. The complexity of multiterminal cuts. SIAM Journal on Computing, 23(4):864–894, 1994.
  11. Study on centrality measures in social networks: a survey. Social network analysis and mining, 8:1–11, 2018.
  12. P. Dey and S. Medya. Covert networks: How hard is it to hide? In Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, pages 628–637, Montreal, Canada, 2019. IFAAMAS.
  13. P. Dey and S. Medya. Manipulating node similarity measures in networks, 2020.
  14. Incremental deployment of network monitors based on group betweenness centrality. Information Processing Letters, 109(20):1172–1176, 2009.
  15. P. Erdős and A. Rényi. On random graphs i. Publ. Math. Debrecen, 6:290–297, 1959.
  16. The centrality of groups and classes. The Journal of mathematical sociology, 23(3):181–201, 1999.
  17. Extending centrality. Models and methods in social network analysis, 35(1):57–76, 2005.
  18. S. Fortunato. Community detection in graphs. Physics reports, 486(3-5):75–174, 2010.
  19. Facility location problem on network based on group centrality measure considering cooperation and competition. In Complex Networks 2019, pages 64–76, New York, USA, 2020. Springer.
  20. Key player identification in terrorism-related social media networks using centrality measures. In 2016 European Intelligence and Security Informatics Conference (EISIC), pages 112–115, New York, USA, 2016. IEEE.
  21. Adversarial attacks and defenses on graphs: A review, a tool and empirical studies, 2020.
  22. R. Karp. Reducibility among combinatorial problems. In R. Miller and J. Thatcher, editors, Complexity of Computer Computations, pages 85–103. Plenum Press, New York, USA, 1972.
  23. L. Katz. A new status index derived from sociometric analysis. Psychometrika, 18(1):39–43, 1953.
  24. A. Kchiche and F. Kamoun. Access-points deployment for vehicular networks based on group centrality. In 2009 3rd International Conference on New Technologies, Mobility and Security, pages 1–6, New York, USA, 2009. IEEE.
  25. Edge weight prediction in weighted signed networks. In Data Mining (ICDM), 2016 IEEE 16th International Conference on, pages 221–230, New York, USA, 2016. IEEE.
  26. Adversarial attack on community detection by hiding individuals. In Proceedings of The Web Conference 2020, pages 917–927, New York, USA, 2020. ACM.
  27. Cooperative game theoretic centrality analysis of terrorist networks: The cases of jemaah islamiyah and al qaeda. European Journal of Operational Research, 229(1):230–238, 2013.
  28. On the computation of centrality metrics for network security in mesh networks. In 2016 IEEE Global Communications Conference (GLOBECOM), pages 1–6, New York, USA, 2016. IEEE.
  29. Group centrality maximization via network design. In Proceedings of the 2018 SIAM International Conference on Data Mining, pages 126–134, Philadelphia, USA, 2018. SIAM.
  30. Degree, closeness, and betweenness: Application of group centrality measurements to explore macro-disciplinary evolution diachronically. In Proceedings of ISSI, volume 1, pages 1–13, New York, USA, 2011. Springer.
  31. Fast algorithm for successive computation of group betweenness centrality. Physical Review E, 76(5):056709, 2007.
  32. Mapping the gnutella network: Properties of large-scale peer-to-peer systems and implications for system design, 2002.
  33. M. Tsvetovat and K. M. Carley. Generation of realistic social network datasets for testing of analysis and simulation tools, 2005.
  34. Finding groups with maximum betweenness centrality. Optimization Methods and Software, 32(2):369–399, 2017.
  35. Social diffusion sources can escape detection. Iscience, 25(9):104956, 2022.
  36. Hiding in temporal networks. IEEE Transactions on Network Science and Engineering, 9(3):1645–1657, 2022.
  37. Hiding in multilayer networks. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 34, pages 1021–1028, Washington D.C., USA, 2020. AAAI Press.
  38. On the construction of covert networks. In Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, pages 1341–1349, New York, USA, 2017. ACM.
  39. How members of covert networks conceal the identities of their leaders. ACM Transactions on Intelligent Systems and Technology (TIST), 13(1):1–29, 2021.
  40. Hiding individuals and communities in a social network. Nature Human Behaviour, 2(2):139–147, 2018.
  41. Hiding from centrality measures: A stackelberg game perspective. IEEE Transactions on Knowledge and Data Engineering, 35(10):10058–10071, 2023.
  42. Strategic evasion of centrality measures. In Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems, pages 1389–1397, New York, NY, 2021. ACM.
  43. How to hide one’s relationships from link prediction algorithms. Scientific reports, 9(1):1–10, 2019.
  44. The manipulability of centrality measures: An axiomatic approach. In Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems, pages 1467–1475, New York, NY, 2020. ACM.
  45. Collective dynamics of small-world networks. nature, 393(6684):440–442, 1998.
  46. Target defense against link-prediction-based attacks via evolutionary perturbations. arXiv preprint arXiv:1809.05912, 2018.
  47. Attacking similarity-based link prediction in social networks. In Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, pages 305–313, New York, USA, 2019. International Foundation for Autonomous Agents and Multiagent Systems, ACM.
User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (2)
  1. Marcin Waniek (14 papers)
  2. Talal Rahwan (46 papers)

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now