Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
survey

FairSNA: Algorithmic Fairness in Social Network Analysis

Published: 26 April 2024 Publication History
  • Get Citation Alerts
  • Abstract

    In recent years, designing fairness-aware methods has received much attention in various domains, including machine learning, natural language processing, and information retrieval. However, in social network analysis (SNA), designing fairness-aware methods for various research problems by considering structural bias and inequalities of large-scale social networks has not received much attention. In this work, we highlight how the structural bias of social networks impacts the fairness of different SNA methods. We further discuss fairness aspects that should be considered while proposing network structure-based solutions for different SNA problems, such as link prediction, influence maximization, centrality ranking, and community detection. This survey-cum-vision clearly highlights that very few works have considered fairness and bias while proposing solutions; even these works are mainly focused on some research topics, such as link prediction, influence maximization, and PageRank. However, fairness has not yet been addressed for other research topics, such as influence blocking and community detection. We review the state of the art for different research topics in SNA, including the considered fairness constraints, their limitations, and our vision. This survey also covers evaluation metrics, available datasets and synthetic network generating models used in such studies. Finally, we highlight various open research directions that require researchers’ attention to bridge the gap between fairness and SNA.

    References

    [1]
    Mohsen Abbasi, Aditya Bhaskara, and Suresh Venkatasubramanian. 2021. Fair clustering via equitable group representations. In Proceedings of the ACM Conference on Fairness, Accountability, and Transparency. 504–514.
    [2]
    Lada Adamic and Eytan Adar. 2005. How to search a social network. Soc. Netw. 27, 3 (2005), 187–203.
    [3]
    Lada A. Adamic and Eytan Adar. 2003. Friends and neighbors on the web. Soc. Netw. 25, 3 (2003), 211–230.
    [4]
    Lada A. Adamic and Natalie Glance. 2005. The political blogosphere and the 2004 US election: Divided they blog. In Proceedings of the 3rd International Workshop on Link Discovery. 36–43.
    [5]
    Leman Akoglu, Mary McGlohon, and Christos Faloutsos. 2009. Anomaly detection in large graphs. In CMU-CS-09-173 Technical Report. Citeseer.
    [6]
    Mohammad Al Hasan and Mohammed J. Zaki. 2011. A survey of link prediction in social networks. In Social Network Data Analytics. Springer, 243–275.
    [7]
    Jay Albanese. 2007. A criminal network approach to understanding & measuring trafficking in human beings. In Measuring Human Trafficking. Springer, 55–71.
    [8]
    Junaid Ali, Mahmoudreza Babaei, Abhijnan Chakraborty, Baharan Mirzasoleiman, Krishna P. Gummadi, and Adish Singla. 2023. On the fairness of time-critical influence maximization in social networks. IEEE Trans. Knowl. Data Eng. 35, 3 (Mar.2023), 2875–2886. DOI:
    [9]
    Alessia Amelio and Clara Pizzuti. 2014. Overlapping community discovery methods: A survey. In Social Networks: Analysis and Case Studies. Springer, 105–125.
    [10]
    Ketan Anand, Jay Kumar, and Kunal Anand. 2017. Anomaly detection in online social network: A survey. In Proceedings of the International Conference on Inventive Communication and Computational Technologies (ICICCT’17). IEEE, 456–459.
    [11]
    Md Sanzeed Anwar, Martin Saveski, and Deb Roy. 2021. Balanced influence maximization in the presence of homophily. In Proceedings of the International Conference on Web Search and Data Mining (WSDM’21). 175–183.
    [12]
    Alex Arenas, Leon Danon, Albert Diaz-Guilera, Pablo M. Gleiser, and Roger Guimera. 2004. Community analysis in social networks. Eur. Phys. J. B 38, 2 (2004), 373–380.
    [13]
    Aikta Arya, Pradumn Kumar Pandey, and Akrati Saxena. 2022. Node classification using deep learning in social networks. In Deep Learning for Social Media Data Analytics. Springer, 3–26.
    [14]
    Chen Avin, Barbara Keller, Zvi Lotker, Claire Mathieu, David Peleg, and Yvonne-Anne Pignolet. 2015. Homophily and the glass ceiling effect in social networks. In Proceedings of the Conference on Innovations in Theoretical Computer Science. 41–50.
    [15]
    Chen Avin, Zvi Lotker, Yinon Nahum, and David Peleg. 2017. Modeling and analysis of glass ceiling and power inequality in bi-populated societies. In International Conference and School on Network Science. Springer, 61–73.
    [16]
    Mehdi Azaouzi, Wassim Mnasri, and Lotfi Ben Romdhane. 2021. New trends in influence maximization models. Computer Science Review 40 (2021), 100393.
    [17]
    Mahmoudreza Babaei, Przemyslaw Grabowicz, Isabel Valera, Krishna P. Gummadi, and Manuel Gomez-Rodriguez. 2016. On the efficiency of the information networks in social media. In Proceedings of the 9th ACM International Conference on Web Search and Data Mining. 83–92.
    [18]
    David A. Bader, Shiva Kintali, Kamesh Madduri, and Milena Mihail. 2007. Approximating betweenness centrality. In International Workshop on Algorithms and Models for the Web-Graph. Springer, 124–137.
    [19]
    Shenshen Bai, Shiyu Fang, Longjie Li, Rui Liu, and Xiaoyun Chen. 2019. Enhancing link prediction by exploring community membership of nodes. Int. J. Mod. Phys. B 33, 31 (2019), 1950382.
    [20]
    Eric Balkanski, Nicole Immorlica, and Yaron Singer. 2017. The importance of communities for learning to influence. In Advances in Neural Information Processing Systems, Vol. 30.
    [21]
    Suman Banerjee, Mamata Jenamani, and Dilip Kumar Pratihar. 2020. A survey on influence maximization in a social network. Knowl. Inf. Syst. 62 (2020), 3417–3455.
    [22]
    Albert-László Barabási. 2014. Network science book. Netw. Sci. 625 (2014).
    [23]
    Albert-László Barabási and Réka Albert. 1999. Emergence of scaling in random networks. Science 286, 5439 (1999), 509–512.
    [24]
    Anamika Barman-Adhikari, Stephanie Begun, Eric Rice, Amanda Yoshioka-Maxwell, and Andrea Perez-Portillo. 2016. Sociometric network structure and its association with methamphetamine use norms among homeless youth. Soc. Sci. Res. 58 (2016), 292–308.
    [25]
    Solon Barocas, Moritz Hardt, and Arvind Narayanan. 2017. Fairness in Machine Learning: Limitations and opportunities. MIT Press, Cambridge, MA.
    [26]
    Ashkan Bashardoust, Sorelle Friedler, Carlos Scheidegger, Blair D. Sullivan, and Suresh Venkatasubramanian. 2023. Reducing Access Disparities in Networks using Edge Augmentation. In Proceedings of the 2023 ACM Conference on Fairness, Accountability, and Transparency. 1635–1651.
    [27]
    Ruben Becker, Gianlorenzo D’Angelo, and Sajjad Ghobadi. 2023. Improving fairness in information exposure by adding links. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 37. 14119–14126.
    [28]
    Ruben Becker, Gianlorenzo D’Angelo, and Sajjad Ghobadi. 2023. On the cost of demographic parity in influence maximization. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 37. 14110–14118.
    [29]
    Ruben Becker, Gianlorenzo D’angelo, Sajjad Ghobadi, and Hugo Gilbert. 2022. Fairness in influence maximization through randomization. J. Artif. Intell. Res. 73 (2022), 1251–1283.
    [30]
    Alex Beutel, Jilin Chen, Tulsee Doshi, Hai Qian, Li Wei, Yi Wu, Lukasz Heldt, Zhe Zhao, Lichan Hong, Ed H. Chi, et al. 2019. Fairness in recommendation ranking through pairwise comparisons. In Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. 2212–2220.
    [31]
    Ginestra Bianconi, Natali Gulbahce, and Adilson E. Motter. 2008. Local structure of directed networks. Phys. Rev. Lett. 100, 11 (2008), 118701.
    [32]
    Vincent D. Blondel, Jean-Loup Guillaume, Renaud Lambiotte, and Etienne Lefebvre. 2008. Fast unfolding of communities in large networks. J. Stat. Mech.: Theory Exp. 2008, 10 (2008), P10008.
    [33]
    Béla Bollobás, Christian Borgs, Jennifer T. Chayes, and Oliver Riordan. 2003. Directed scale-free graphs. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA’03), Vol. 3. 132–139.
    [34]
    Victoria Bolotaeva and Teuta Cata. 2010. Marketing opportunities with social networks. J. Internet Soc. Netw. Virt. Commun. 2010 (2010), 1–8.
    [35]
    María Bordons, Javier Aparicio, Borja González-Albo, and Adrián A. Díaz-Faes. 2015. The relationship between the research performance of scientists and their position in co-authorship networks in three fields. J. Informetr. 9, 1 (2015), 135–144.
    [36]
    Rodrigo Borges and Kostas Stefanidis. 2022. Feature-blind fairness in collaborative filtering recommender systems. Knowl. Inf. Syst. 64, 4 (2022), 943–962.
    [37]
    Christian Borgs, Michael Brautbar, Jennifer Chayes, and Brendan Lucier. 2014. Maximizing social influence in nearly optimal time. In Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 946–957.
    [38]
    Avishek Bose and William Hamilton. 2019. Compositional fairness constraints for graph embeddings. In International Conference on Machine Learning. PMLR, 715–724.
    [39]
    Wendy Bottero. 2007. Social inequality and interaction. Sociol. Compass 1, 2 (2007), 814–831.
    [40]
    Alexandre Bovet and Hernán A. Makse. 2019. Influence of fake news in Twitter during the 2016 US presidential election. Nat. Commun. 10, 1 (2019), 1–14.
    [41]
    Arastoo Bozorgi, Hassan Haghighi, Mohammad Sadegh Zahedi, and Mojtaba Rezvani. 2016. INCIM: A community-based algorithm for influence maximization problem under the linear threshold model. Inf. Process. Manage. 52, 6 (2016), 1188–1199.
    [42]
    Maarten Buyl and Tijl De Bie. 2020. Debayes: A Bayesian method for debiasing network embeddings. In International Conference on Machine Learning. PMLR, 1220–1229.
    [43]
    David Camacho, Ángel Panizo-LLedot, Gema Bello-Orgaz, Antonio Gonzalez-Pardo, and Erik Cambria. 2020. The four dimensions of social network analysis: An overview of research methods, applications, and software tools. Inf. Fusion 63 (2020), 88–120.
    [44]
    Peter J. Carrington. 2011. Crime and social network analysis. In The SAGE Handbook of Social Network Analysis (2011), 236–255.
    [45]
    Jordi Casas-Roma, Jordi Herrera-Joancomartí, and Vicenç Torra. 2017. A survey of graph-modification techniques for privacy-preserving on networks. Artif. Intell. Rev. 47, 3 (2017), 341–366.
    [46]
    Simon Caton and Christian Haas. 2020. Fairness in machine learning: A survey. Comput. Surveys (2020).
    [47]
    L. Elisa Celis, Damian Straszak, and Nisheeth K. Vishnoi. 2018. Ranking with fairness constraints. In Proceedings of the 45th International Colloquium on Automata, Languages, and Programming (ICALP’18). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
    [48]
    Dave Chaffey. 2023. Global Social Media Statistics Research Summary 2023. Retrieved April 14, 2023 from https://www.smartinsights.com/social-media-marketing/social-media-strategy/new-global-social-media-research/
    [49]
    Tanmoy Chakraborty, Ayushi Dalmia, Animesh Mukherjee, and Niloy Ganguly. 2017. Metrics for community analysis: A survey. ACM Comput. Surv. 50, 4 (2017), 1–37.
    [50]
    P. Chen and Sidney Redner. 2010. Community structure of the physical review citation network. J. Informetr. 4, 3 (2010), 278–290.
    [51]
    Wei Chen, Wei Lu, and Ning Zhang. 2012. Time-critical influence maximization in social networks with time-delayed diffusion process. In Proceedings of the 26th AAAI Conference on Artificial Intelligence.
    [52]
    Wei Chen, Chi Wang, and Yajun Wang. 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. 1029–1038.
    [53]
    Wei Chen, Yajun Wang, and Siyu Yang. 2009. Efficient influence maximization in social networks. In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 199–208.
    [54]
    Zhengzhang Chen, William Hendrix, and Nagiza F. Samatova. 2012. Community-based anomaly detection in evolutionary networks. J. Intell. Inf. Syst. 39, 1 (2012), 59–85.
    [55]
    I. Eli Chien, Chung-Yi Lin, and I.-Hsiang Wang. 2019. On the minimax misclassification ratio of hypergraph community detection. IEEE Trans. Inf. Theory 65, 12 (2019), 8095–8118.
    [56]
    Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, and Sergei Vassilvitskii. 2017. Fair clustering through fairlets. Advances in Neural Information Processing Systems 30 (2017).
    [57]
    Youngsang Cho, Junseok Hwang, and Daeho Lee. 2012. Identification of effective opinion leaders in the diffusion of technological innovation: A social network approach. Technol. Forecast. Soc. Change 79, 1 (2012), 97–106.
    [58]
    Manvi Choudhary, Charlotte Laclau, and Christine Largeron. 2022. A survey on fairness for machine learning on graphs. arXiv:2205.05396. Retrieved from https://arxiv.org/abs/2205.05396
    [59]
    Sam Corbett-Davies, Johann D. Gaebler, Hamed Nilforoshan, Ravi Shroff, and Sharad Goel. 2023. The measure and mismeasure of fairness. The Journal of Machine Learning Research 24, 1 (2023), 14730–14846.
    [60]
    Sam Corbett-Davies, Emma Pierson, Avi Feller, Sharad Goel, and Aziz Huq. 2017. Algorithmic decision making and the cost of fairness. In Proceedings of the 23rd ACM Sigkdd International Conference on Knowledge Discovery and Data Mining. 797–806.
    [61]
    Enyan Dai and Suhang Wang. 2021. Say no to the discrimination: Learning fair graph neural networks with limited sensitive attribute information. In Proceedings of the 14th ACM International Conference on Web Search and Data Mining. 680–688.
    [62]
    Network data. 2022. Retrieved Spetember 9, 2022 from http://www-personal.umich.edu/mejn/netdata/
    [63]
    Ian Davidson and Selvan Suntiha Ravi. 2020. A framework for determining the fairness of outlier detection. In Proceedings of the European Conference on Artificial Intelligence (ECAI’20). IOS Press, 2465–2472.
    [64]
    Jesse Davis and Mark Goadrich. 2006. The relationship between Precision-Recall and ROC curves. In Proceedings of the 23rd International Conference on Machine Learning. 233–240.
    [65]
    Aviva de Groot, George H. L. Fletcher, Gijs van Manen, Akrati Saxena, Alexander Serebrenik, and LEM Taylor. 2024. A canon is a blunt force instrument: Data science, canons, and generative frictions. In Dialogues in Data Power Shifting Response-abilities in a Datafied World. Bristol University Press.
    [66]
    Kalyanmoy Deb, Amrit Pratap, Sameer Agarwal, and TAMT Meyarivan. 2002. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6, 2 (2002), 182–197.
    [67]
    Alain Degenne and Michel Forsé. 1999. Introducing Social Networks. SAGE.
    [68]
    Charo I. Del Genio, Thilo Gross, and Kevin E. Bassler. 2011. All scale-free networks are sparse. Phys. Rev. Lett. 107, 17 (2011), 178701.
    [69]
    Öykü Deniz Köse and Yanning Shen. 2021. Fairness-aware node representation learning. arXiv preprint arXiv:2106.05391.
    [70]
    Paul DiMaggio and Filiz Garip. 2012. Network effects and social inequality. Annu. Rev. Sociol. 38 (2012), 93–118.
    [71]
    Yushun Dong, Jing Ma, Song Wang, Chen Chen, and Jundong Li. 2023. Fairness in graph mining: A survey. IEEE Transactions on Knowledge and Data Engineering (2023).
    [72]
    Shaun Doyle. 2007. The role of social networks in marketing. J. Database Market. Cust. Strategy Manage. 15, 1 (2007), 60–64.
    [73]
    Mengnan Du, Fan Yang, Na Zou, and Xia Hu. 2020. Fairness in deep learning: A computational perspective. IEEE Intell. Syst. 36, 4 (2020), 25–34.
    [74]
    Cynthia Dwork, Moritz Hardt, Toniann Pitassi, Omer Reingold, and Richard Zemel. 2012. Fairness through awareness. In Proceedings of the 3rd Innovations in Theoretical Computer Science Conference. 214–226.
    [75]
    Harrison Edwards and Amos Storkey. 2016. Censoring representations with an adversary. In 4th International Conference on Learning Representations. 1–14.
    [76]
    Yanai Elazar and Yoav Goldberg. 2018. Adversarial removal of demographic attributes from text data. In Proceedings of the Conference on Empirical Methods in Natural Language Processing. 11–21.
    [77]
    Alessandro Epasto and Bryan Perozzi. 2019. Is a single embedding enough? Learning node representations that capture multiple social contexts. In Proceedings of the World Wide Web Conference. 394–404.
    [78]
    Fernando C. Erd, André L. Vignatti, and Murilo V. G. da Silva. 2021. The generalized influence blocking maximization problem. Soc. Netw. Anal. Min. 11, 1 (2021), 1–17.
    [79]
    Soheil Eshghi, Setareh Maghsudi, Valerio Restocchi, Sebastian Stein, and Leandros Tassiulas. 2019. Efficient influence maximization under network uncertainty. In Proceedings of the IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS’19). IEEE, 365–371.
    [80]
    Golnoosh Farnadi, Behrouz Babaki, and Michel Gendreau. 2020. A unifying framework for fairness-aware influence maximization. In Companion Proceedings of the Web Conference. 714–722.
    [81]
    Emilio Ferrara. 2012. Community structure discovery in Facebook. Int. J. Soc. Netw. Min. 1, 1 (2012), 67–90.
    [82]
    Lisa Finneran and Morgan Kelly. 2003. Social networks and inequality. J. Urb. Econ. 53, 2 (2003), 282–299.
    [83]
    Benjamin Fish, Ashkan Bashardoust, Danah Boyd, Sorelle Friedler, Carlos Scheidegger, and Suresh Venkatasubramanian. 2019. Gaps in information access in social networks? In Proceedings of the World Wide Web Conference. 480–490.
    [84]
    Mathilde Forestier, Anna Stavrianou, Julien Velcin, and Djamel A. Zighed. 2012. Roles in social networks: Methodologies and research issues. Web Intell. Agent Syst.: Int. J. 10, 1 (2012), 117–133.
    [85]
    Santo Fortunato and Darko Hric. 2016. Community detection in networks: A user guide. Phys. Rep. 659 (2016), 1–44.
    [86]
    Linton Freeman. 2004. The development of social network analysis. In A Study in the Sociology of ScienceEmpirical Press, 159–167.
    [87]
    Pratik Gajane and Mykola Pechenizkiy. 2017. On formalizing fairness in prediction with machine learning. arXiv:1710.03184. Retrieved from https://arxiv.org/abs/1710.03184
    [88]
    Pratik Gajane, Akrati Saxena, Maryam Tavakol, George Fletcher, and Mykola Pechenizkiy. 2022. Survey on fair reinforcement learning: Theory and practice. arXiv:2205.10032. Retrieved from https://arxiv.org/abs/2205.10032
    [89]
    Michael Gallivan and Manju Ahuja. 2015. Co-authorship, homophily, and scholarly influence in information systems research. J. Assoc. Inf. Syst. 16, 12 (2015), 2.
    [90]
    Mitsuo Gen and Runwei Cheng. 1999. Genetic Algorithms and Engineering Optimization. Vol. 7. John Wiley & Sons.
    [91]
    Shay Gershtein, Tova Milo, Brit Youngmann, and Gal Zeevi. 2018. IM balanced: Influence maximization under balance constraints. In Proceedings of the 27th ACM International Conference on Information and Knowledge Management. 1919–1922.
    [92]
    Sahin Cem Geyik, Stuart Ambler, and Krishnaram Kenthapadi. 2019. Fairness-aware ranking in search & recommendation systems with application to linkedin talent search. In Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. 2221–2231.
    [93]
    Mehrdad Ghadiri, Samira Samadi, and Santosh Vempala. 2021. Socially fair k-means clustering. In Proceedings of the ACM Conference on Fairness, Accountability, and Transparency. 438–448.
    [94]
    Amir Ghasemian, Homa Hosseinmardi, and Aaron Clauset. 2019. Evaluating overfit and underfit in models of network community structure. IEEE Trans. Knowl. Data Eng. 32, 9 (2019), 1722–1735.
    [95]
    Hao Gong and Chunxiang Guo. 2023. Influence maximization considering fairness: A multi-objective optimization approach with prior knowledge. Expert Syst. Appl. 214 (2023), 119138.
    [96]
    Amit Goyal, Wei Lu, and Laks VS Lakshmanan. 2011. Simpath: An efficient algorithm for influence maximization under the linear threshold model. In Proceedings of the IEEE 11th International Conference on Data Mining. IEEE, 211–220.
    [97]
    Nir Grinberg, Kenneth Joseph, Lisa Friedland, Briony Swire-Thompson, and David Lazer. 2019. Fake news on Twitter during the 2016 US presidential election. Science 363, 6425 (2019), 374–378.
    [98]
    Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable feature learning for networks. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 855–864.
    [99]
    Yayati Gupta, Akrati Saxena, Debarati Das, and SRS Iyengar. 2016. Modeling memetics using edge diversity. In Complex Networks VII. Springer, 187–198.
    [100]
    Marwa El Halabi, Slobodan Mitrović, Ashkan Norouzi-Fard, Jakab Tardos, and Jakub M. Tarnawski. 2020. Fairness in streaming submodular maximization: Algorithms and hardness. Advances in Neural Information Processing Systems 33 (2020), 13609–13622.
    [101]
    Xinran He, Guojie Song, Wei Chen, and Qingye Jiang. 2012. Influence blocking maximization in social networks under the competitive linear threshold model. In Proceedings of the SIAM International Conference on Data Mining. SIAM, 463–474.
    [102]
    Deborah Hellman. 2020. Measuring algorithmic fairness. Virg. Law Rev. 106, 4 (2020), 811–866.
    [103]
    Corinna Hertweck, Christoph Heitz, and Michele Loi. 2021. On the moral justification of statistical parity. In Proceedings of the ACM Conference on Fairness, Accountability, and Transparency. 747–757.
    [104]
    Petter Holme, Christofer R. Edling, and Fredrik Liljeros. 2004. Structure and time evolution of an Internet dating community. Soc. Netw. 26, 2 (2004), 155–174.
    [105]
    Petter Holme and Jari Saramäki. 2012. Temporal networks. Phys. Rep. 519, 3 (2012), 97–125.
    [106]
    Huimin Huang, Hong Shen, Zaiqiao Meng, Huajian Chang, and Huaiwen He. 2019. Community-based influence maximization for viral marketing. Appl. Intell. 49, 6 (2019), 2137–2150.
    [107]
    Xinyu Huang, Dongming Chen, Tao Ren, and Dongqi Wang. 2021. A survey of community detection methods in multilayer networks. Data Min. Knowl. Discov. 35, 1 (2021), 1–45.
    [108]
    Carol Hymowitz and Timothy D. Schellhardt. 1986. Why women can’t seem to break the invisible barrier that blocks them from the top jobs. The Wall Street Journal (1986).
    [109]
    Zeinab S. Jalali, Weixiang Wang, Myunghwan Kim, Hema Raghavan, and Sucheta Soundarajan. 2020. On the information unfairness of social networks. In Proceedings of the SIAM International Conference on Data Mining. SIAM, 613–521.
    [110]
    Hyoungjun Jeon and Taewhan Kim. 2017. Community-adaptive link prediction. In Proceedings of the International Conference on Data Mining, Communications and Information Technology. 1–5.
    [111]
    Jiaojiao Jiang, Sheng Wen, Shui Yu, Yang Xiang, Wanlei Zhou, and Houcine Hassan. 2017. The structure of communities in scale-free networks. Concurr. Comput.: Pract. Experience 29, 14 (2017), e4040.
    [112]
    Bo Kang, Jefrey Lijffijt, and Tijl De Bie. 2018. Conditional network embeddings. arXiv:1805.07544. Retrieved from https://arxiv.org/abs/1805.07544
    [113]
    Jian Kang and Hanghang Tong. 2021. Fair graph mining. In Proceedings of the 30th ACM International Conference on Information & Knowledge Management. 4849–4852.
    [114]
    Piyush Kansal, Nitish Kumar, Sangam Verma, Karamjit Singh, and Pranav Pouduval. 2022. FLiB: Fair link prediction in bipartite network. In Proceedings of the 26th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining (PAKDD’22), Part II. Springer, 485–498.
    [115]
    Fariba Karimi, Mathieu Génois, Claudia Wagner, Philipp Singer, and Markus Strohmaier. 2018. Homophily influences ranking of minorities in social networks. Sci. Rep. 8, 1 (2018), 1–12.
    [116]
    Fariba Karimi, Claudia Wagner, Florian Lemmerich, Mohsen Jadidi, and Markus Strohmaier. 2016. Inferring gender from names on the web: A comparative evaluation of gender detection methods. In Proceedings of the 25th International Conference Companion on World Wide Web. 53–54.
    [117]
    Miray Kas, Matthew Wachs, Kathleen M. Carley, and L. Richard Carley. 2013. Incremental algorithm for updating betweenness centrality in dynamically growing networks. In Proceedings of the IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining. 33–40.
    [118]
    Ichiro Kawachi and Lisa F. Berkman. 2001. Social ties and mental health. J. Urb. Health 78, 3 (2001), 458–467.
    [119]
    Przemysław Kazienko and Katarzyna Musiał. 2006. Social capital in online social networks. In International Conference on Knowledge-Based and Intelligent Information and Engineering Systems. Springer, 417–424.
    [120]
    David Kempe, Jon Kleinberg, and Éva Tardos. 2003. Maximizing the spread of influence through a social network. In Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 137–146.
    [121]
    David Kempe, Jon Kleinberg, and Éva Tardos. 2005. Influential nodes in a diffusion model for social networks. In International Colloquium on Automata, Languages, and Programming. Springer, 1127–1138.
    [122]
    Ahmad Khajehnejad, Moein Khajehnejad, Mahmoudreza Babaei, Krishna P. Gummadi, Adrian Weller, and Baharan Mirzasoleiman. 2022. Crosswalk: Fairness-enhanced node representation learning. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 36. 11963–11970.
    [123]
    Moein Khajehnejad, Ahmad Asgharian Rezaei, Mahmoudreza Babaei, Jessica Hoffmann, Mahdi Jalili, and Adrian Weller. 2021. Adversarial graph embeddings for fair influence maximization over social networks. In Proceedings of the Twenty-Ninth International Conference on International Joint Conferences on Artificial Intelligence. 4306–4312.
    [124]
    Masahiro Kimura and Kazumi Saito. 2006. Tractable models for information diffusion in social networks. In Knowledge Discovery in Databases: PKDD 2006: 10th European Conference on Principles and Practice of Knowledge Discovery in Databases 10. Springer, 259–271.
    [125]
    Maksim Kitsak, Lazaros K. Gallos, Shlomo Havlin, Fredrik Liljeros, Lev Muchnik, H Eugene Stanley, and Hernán A Makse. 2010. Identification of influential spreaders in complex networks. Nat. Phys. 6, 11 (2010), 888–893.
    [126]
    Mikko Kivelä, Alex Arenas, Marc Barthelemy, James P. Gleeson, Yamir Moreno, and Mason A. Porter. 2014. Multilayer networks. J. Complex Netw. 2, 3 (2014), 203–271.
    [127]
    Jon Kleinberg, Sendhil Mullainathan, and Manish Raghavan. 2017. Inherent trade-offs in the fair determination of risk scores. In Proceedings of the 8th Innovations in Theoretical Computer Science Conference (ITCS’17). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
    [128]
    Matthäus Kleindessner, Samira Samadi, Pranjal Awasthi, and Jamie Morgenstern. 2019. Guarantees for spectral clustering with fairness constraints. In International Conference on Machine Learning. PMLR, 3458–3467.
    [129]
    Andrea Knecht, Tom A. B. Snijders, Chris Baerveldt, Christian E. G. Steglich, and Werner Raub. 2010. Friendship and delinquency: Selection and influence processes in early adolescence. Soc. Dev. 19, 3 (2010), 494–514.
    [130]
    Solomon Kullback and Richard A. Leibler. 1951. On information and sufficiency. Ann. Math. Stat. 22, 1 (1951), 79–86.
    [131]
    A. Sharath Kumar and Sanjay Singh. 2013. Detection of user cluster with suspicious activity in online social networking sites. In Proceedings of the 2nd International Conference on Advanced Computing, Networking and Security. IEEE, 220–225.
    [132]
    Suman Kundu, C. A. Murthy, and Sankar K. Pal. 2011. A new centrality measure for influence maximization in social networks. In International Conference on Pattern Recognition and Machine Intelligence. Springer, 242–247.
    [133]
    Charlotte Laclau, Ievgen Redko, Manvi Choudhary, and Christine Largeron. 2021. All of the fairness for edge prediction with optimal transport. In Proceedings of the International Conference on Artificial Intelligence and Statistics. PMLR, 1774–1782.
    [134]
    Eun Lee, Fariba Karimi, Claudia Wagner, Hang-Hyun Jo, Markus Strohmaier, and Mirta Galesic. 2019. Homophily and minority-group size explain perception biases in social networks. Nat. Hum. Behav. 3, 10 (2019), 1078–1087.
    [135]
    Jure Leskovec, Andreas Krause, Carlos Guestrin, Christos Faloutsos, Jeanne VanBriesen, and Natalie Glance. 2007. Cost-effective outbreak detection in networks. In Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 420–429.
    [136]
    Hui Li, Sourav S. Bhowmick, Aixin Sun, and Jiangtao Cui. 2015. Conformity-aware influence maximization in online social networks. VLDB J. 24 (2015), 117–141.
    [137]
    Longjie Li, Shiyu Fang, Shenshen Bai, Shijin Xu, Jianjun Cheng, and Xiaoyun Chen. 2019. Effective link prediction based on community relationship strength. IEEE Access 7 (2019), 43233–43248.
    [138]
    Yuchen Li, Ju Fan, Yanhao Wang, and Kian-Lee Tan. 2018. Influence maximization on social graphs: A survey. IEEE Trans. Knowl. Data Eng. 30, 10 (2018), 1852–1872.
    [139]
    Yu Li, Ying Wang, Tingting Zhang, Jiawei Zhang, and Yi Chang. 2019. Learning network embedding with community structural information. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI’19). 2937–2943.
    [140]
    David Liben-Nowell and Jon Kleinberg. 2007. The link-prediction problem for social networks. J. Am. Soc. Inf. Sci. Technol. 58, 7 (2007), 1019–1031.
    [141]
    Ryan N. Lichtenwalter, Jake T. Lussier, and Nitesh V. Chawla. 2010. New perspectives and methods in link prediction. In Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 243–252.
    [142]
    Ryan Lichtnwalter and Nitesh V. Chawla. 2012. Link prediction: Fair and effective evaluation. In Proceedings of the IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining. IEEE, 376–383.
    [143]
    Zongqing Lu, Xiao Sun, Yonggang Wen, Guohong Cao, and Thomas La Porta. 2014. Algorithms and applications for community detection in weighted networks. IEEE Trans. Parallel Distrib. Syst. 26, 11 (2014), 2916–2926.
    [144]
    Kaicong Ma, Xinxiang Xu, Haipeng Yang, Renzhi Cao, and Lei Zhang. 2023. Fair influence maximization in social networks: A community-based evolutionary algorithm. arXiv:2311.14288. Retrieved from https://arxiv.org/abs/2311.14288
    [145]
    Fragkiskos D. Malliaros and Michalis Vazirgiannis. 2013. Clustering and community detection in directed networks: A survey. Phys. Rep. 533, 4 (2013), 95–142.
    [146]
    Evgeni Tchubykalo, Juan Luis Manfredi-Sánchez, and Juan Antonio Sánchez-Giménez. 2019. Think tanks and political influence. How influencer networks and the specialization of power are represented on Twitter. Blanquerna School of Communication and International Relations 45 (2019), 111–131.
    [147]
    Farzan Masrour, Tyler Wilson, Heng Yan, Pang-Ning Tan, and Abdol Esfahanian. 2020. Bursting the filter bubble: Fairness-aware network link prediction. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 34. 841–848.
    [148]
    Julian J. McAuley and Jure Leskovec. 2012. Learning to discover social circles in ego networks. In Proceedings of the Conference and Workshop on Neural Information Processing Systems (NIPS’12), Vol. 2012. Citeseer, 548–56.
    [149]
    Gail M. McGuire. 2002. Gender, race, and the shadow structure: A study of informal networks and inequality in a work organization. Gender Soc. 16, 3 (2002), 303–322.
    [150]
    Miller McPherson, Lynn Smith-Lovin, and James M. Cook. 2001. Birds of a feather: Homophily in social networks. Annu. Rev. Sociol. 27, 1 (2001), 415–444.
    [151]
    Ninareh Mehrabi, Fred Morstatter, Nanyun Peng, and Aram Galstyan. 2019. Debiasing community detection: The importance of lowly connected nodes. In Proceedings of the IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM’19). IEEE, 509–512.
    [152]
    Ninareh Mehrabi, Fred Morstatter, Nripsuta Saxena, Kristina Lerman, and Aram Galstyan. 2021. A survey on bias and fairness in machine learning. ACM Comput. Surv. 54, 6 (2021), 1–35.
    [153]
    Johnnatan Messias, Pantelis Vikatos, and Fabrício Benevenuto. 2017. White, man, and highly followed: Gender and race inequalities in Twitter. In Proceedings of the International Conference on Web Intelligence. 266–274.
    [154]
    Ryan Miller, Ralucca Gera, Akrati Saxena, and Tanmoy Chakraborty. 2018. Discovering and leveraging communities in dark multi-layered networks for network disruption. In Proceedings of the IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM’18). IEEE, 1152–1159.
    [155]
    Alan Mislove, Bimal Viswanath, Krishna P. Gummadi, and Peter Druschel. 2010. You are who you know: Inferring user profiles in online social networks. In Proceedings of the 3rd ACM International Conference on Web Search and Data Mining. 251–260.
    [156]
    Shira Mitchell, Eric Potash, Solon Barocas, Alexander D’Amour, and Kristian Lum. 2021. Algorithmic fairness: Choices, assumptions, and definitions. Annu. Rev. Stat. Appl. 8 (2021), 141–163.
    [157]
    Rezvan Mohamadi-Baghmolaei, Niloofar Mozafari, and Ali Hamzeh. 2015. Trust based latency aware influence maximization in social networks. Eng. Appl. Artif. Intell. 41 (2015), 195–206.
    [158]
    Deirdre K. Mulligan, Joshua A. Kroll, Nitin Kohli, and Richmond Y. Wong. 2019. This thing called fairness: Disciplinary confusion realizing a value in technology. Proc. ACM Hum.-Comput. Interact. 3, CSCW (2019), 1–36.
    [159]
    Mark E. J. Newman. 2001. Clustering and preferential attachment in growing networks. Phys. Rev. E 64, 2 (2001), 025102.
    [160]
    Mark E. J. Newman. 2002. Assortative mixing in networks. Phys. Rev. Lett. 89, 20 (2002), 208701.
    [161]
    Mark E. J. Newman. 2003. Mixing patterns in networks. Phys. Rev. E 67, 2 (2003), 026126.
    [162]
    Mark E. J. Newman. 2004. Fast algorithm for detecting community structure in networks. Phys. Rev. E 69, 6 (2004), 066133.
    [163]
    Vu Xuan Nguyen, Gaoxi Xiao, Xin-Jian Xu, Qingchu Wu, and Cheng-Yi Xia. 2020. Dynamics of opinion formation under majority rules on complex social networks. Sci. Rep. 10, 1 (2020), 1–9.
    [164]
    Shirin Nilizadeh, Anne Groggel, Peter Lista, Srijita Das, Yong-Yeol Ahn, Apu Kapadia, and Fabio Rojas. 2016. Twitter’s glass ceiling: The effect of perceived gender on online visibility. In Proceedings of the International AAAI Conference on Web and Social Media, Vol. 10. 289–298.
    [165]
    Akihiro Nishi, Hirokazu Shirado, David G. Rand, and Nicholas A. Christakis. 2015. Inequality and visibility of wealth in experimental social networks. Nature 526, 7573 (2015), 426–429.
    [166]
    Rrubaa Panchendrarajan and Akrati Saxena. 2023. Topic-based influential user detection: A survey. Appl. Intell. 53, 5 (2023), 5998–6024.
    [167]
    Eli Pariser. 2011. The Filter Bubble: What the Internet Is Hiding from You. Penguin UK.
    [168]
    Atilano Pena-López, Paolo Rungo, and José Manuel Sánchez-Santos. 2021. Inequality and individuals’ social networks: The other face of social capital. Cambr. J. Econ. 45, 4 (2021), 675–694.
    [169]
    Bryan Perozzi, Rami Al-Rfou, and Steven Skiena. 2014. Deepwalk: Online learning of social representations. In Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 701–710.
    [170]
    Dana Pessach and Erez Shmueli. 2023. Algorithmic fairness. In Machine Learning for Data Science Handbook: Data Mining and Knowledge Discovery Handbook. Springer, 867–886.
    [171]
    Dana Pessach and Erez Shmueli. 2022. A review on fairness in machine learning. ACM Comput. Surv. 55, 3 (2022), 1–44.
    [172]
    Canh V. Pham, Dung K. T. Ha, Quang C. Vu, Anh N. Su, and Huan X. Hoang. 2020. Influence maximization with priority in online social networks. Algorithms 13, 8 (2020), 183.
    [173]
    Canh V. Pham, Quat V. Phu, Huan X. Hoang, Jun Pei, and My T. Thai. 2019. Minimum budget for misinformation blocking in online social networks. J. Combin. Optim. 38 (2019), 1101–1127.
    [174]
    Dung V. Pham, Hieu V. Duong, Canh V. Pham, Bui Q. Bao, and Anh V. Nguyen. 2019. Multiple topics misinformation blocking in online social networks. In Proceedings of the 11th International Conference on Knowledge and Systems Engineering (KSE’19). IEEE, 1–6.
    [175]
    Evaggelia Pitoura, Kostas Stefanidis, and Georgia Koutrika. 2021. Fairness in rankings and recommendations: An overview. VLDB J. (2021), 1–28.
    [176]
    Michel Plantié and Michel Crampes. 2013. Survey on social community detection. In Social Media Retrieval. Springer, 65–85.
    [177]
    Tahleen Rahman, Bartlomiej Surma, Michael Backes, and Yang Zhang. 2019. Fairwalk: Towards fair graph embedding (unpublished).
    [178]
    Aida Rahmattalabi, Shahin Jabbari, Himabindu Lakkaraju, Phebe Vayanos, Max Izenberg, Ryan Brown, Eric Rice, and Milind Tambe. 2021. Fair influence maximization: A welfare optimization approach. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 35. 11630–11638.
    [179]
    Behnam Razaghi, Mehdy Roayaei, and Nasrollah Moghadam Charkari. 2022. On the group-fairness-aware influence maximization in social networks. IEEE Trans. Comput. Soc. Syst. (2022).
    [180]
    Manoel Horta Ribeiro, Pedro H. Calais, Yuri A. Santos, Virgílio A. F. Almeida, and Wagner Meira Jr. 2018. Characterizing and detecting hateful users on Twitter. In Proceedings of the 12th International AAAI Conference on Web and Social Media.
    [181]
    Nancy Roberts and Sean F. Everton. 2011. Strategies for combating dark networks. J. Soc. Struct. (2011).
    [182]
    Luis E. C. Rocha, Fredrik Liljeros, and Petter Holme. 2011. Simulated epidemics in an empirical spatiotemporal network of 50,185 sexual contacts. PLoS Comput. Biol. 7, 3 (2011), e1001109.
    [183]
    Ryan Rossi and Nesreen Ahmed. 2015. The network data repository with interactive graph analytics and visualization. In Proceedings of the 29th AAAI Conference on Artificial Intelligence.
    [184]
    Xiaobin Rui, Zhixiao Wang, Jiayu Zhao, Lichao Sun, and Wei Chen. 2024. Scalable fair influence maximization. Advances in Neural Information Processing Systems 36 (2024).
    [185]
    Hedi Pudjo Santosa, Nurul Hasfi, and Triyono Lukmantoro. 2018. Digital media unequality during the 2014th Indonesian presidential election. In E3S Web of Conferences, Vol. 73. EDP Sciences, 14006.
    [186]
    Akrati Saxena. 2022. Evolving models for dynamic weighted complex networks. In Principles of Social Networking. Springer, 177–208.
    [187]
    Akrati Saxena, George Fletcher, and Mykola Pechenizkiy. 2021. HM-EIICT: Fairness-aware link prediction in complex networks using community information. J. Combin. Optim. (2021), 1–18.
    [188]
    Akrati Saxena, George Fletcher, and Mykola Pechenizkiy. 2021. How fair is fairness-aware representative ranking? In Companion Proceedings of the Web Conference 2021. 161–165.
    [189]
    Akrati Saxena, George Fletcher, and Mykola Pechenizkiy. 2022. NodeSim: Node similarity based network embedding for diverse link prediction. EPJ Data Sci. 11, 1 (2022), 24.
    [190]
    Akrati Saxena, Ralucca Gera, and SRS Iyengar. 2017. Observe locally rank globally. In Proceedings of the IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017. 139–144.
    [191]
    Akrati Saxena, Ralucca Gera, and SRS Iyengar. 2018. Estimating degree rank in complex networks. Soc. Netw. Anal. Min. 8, 1 (2018), 1–20.
    [192]
    Akrati Saxena, Ralucca Gera, and SRS Iyengar. 2019. A heuristic approach to estimate nodes’ closeness rank using the properties of real world networks. Soc. Netw. Anal. Min. 9, 1 (2019), 1–16.
    [193]
    Akrati Saxena, Cristina Gutiérrez Bierbooms, and Mykola Pechenizkiy. 2023. Fairness-aware fake news mitigation using counter information propagation. Appl. Intell. 53, 22 (2023), 27483–27504.
    [194]
    Akrati Saxena, Wynne Hsu, Mong Li Lee, Hai Leong Chieu, Lynette Ng, and Loo Nin Teow. 2020. Mitigating misinformation in online social network with top-k debunkers and evolving user opinions. In Companion Proceedings of the Web Conference 2020. 363–370.
    [195]
    Akrati Saxena and S. R. S. Iyengar. 2017. Global rank estimation. arXiv:1710.11341. Retrieved from https://arxiv.org/abs/1710.11341
    [196]
    Akrati Saxena and S. R. S. Iyengar. 2018. K-shell rank analysis using local information. In International Conference on Computational Social Networks. Springer, 198–210.
    [197]
    Akrati Saxena and Sudarshan Iyengar. 2020. Centrality measures in complex networks: A survey. arXiv:2011.07190. Retrieved from https://arxiv.org/abs/2011.07190
    [198]
    Akrati Saxena, S. R. S. Iyengar, and Yayati Gupta. 2015. Understanding spreading patterns on social networks based on network topology. In Proceedings of the IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2015. 1616–1617.
    [199]
    Akrati Saxena, Pratishtha Saxena, and Harita Reddy. 2022. Fake news detection techniques for social media. In Principles of Social Networking. Springer, 325–354.
    [200]
    Akrati Saxena, Pratishtha Saxena, and Harita Reddy. 2022. Fake news propagation and mitigation techniques: A survey. In Principles of Social Networking. Springer, 355–386.
    [201]
    Joseph Schwartz and Christopher Winship. 1980. The welfare approach to measuring inequality. Sociol. Methodol. 11 (1980), 1–36.
    [202]
    Cathrine Seierstad and Tore Opsahl. 2011. For the few not the many? The effects of affirmative action on presence, prominence, and social capital of women directors in Norway. Scand. J. Manage. 27, 1 (2011), 44–54.
    [203]
    Jitesh Shetty and Jafar Adibi. 2004. The Enron Email Dataset Database Schema and Brief Statistical Report. Information Sciences Institute Technical Report, University of Southern California, 120–128.
    [204]
    Ashudeep Singh and Thorsten Joachims. 2018. Fairness of exposure in rankings. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. 2219–2228.
    [205]
    Tom A. B. Snijders, Gerhard G. Van de Bunt, and Christian E. G. Steglich. 2010. Introduction to stochastic actor-based models for network dynamics. Soc. Netw. 32, 1 (2010), 44–60.
    [206]
    Indro Spinelli, Simone Scardapane, Amir Hussain, and Aurelio Uncini. 2021. Fairdrop: Biased edge dropout for enhancing fairness in graph representation learning. IEEE Transactions on Artificial Intelligence 3, 3 (2021), 344–354.
    [207]
    Sebastian Stein, Soheil Eshghi, Setareh Maghsudi, Leandros Tassiulas, Rachel K. E. Bellamy, and Nicholas R. Jennings. 2017. Heuristic algorithms for influence maximization in partially observable social networks. In Proceedings of the International Workshop on Social Influence Analysis co-located with 25th International Joint Conference on Artificial Intelligence (SocInf@IJCAI’17).
    [208]
    Adelina-Alexandra Stoica. 2018. Homophily in co-autorship networks. Int. Rev. Soc. Res 8, 2 (2018), 119–128.
    [209]
    Ana-Andreea Stoica and Augustin Chaintreau. 2019. Fairness in social influence maximization. In Companion Proceedings of the World Wide Web Conference. 569–574.
    [210]
    Ana-Andreea Stoica, Jessy Xinyi Han, and Augustin Chaintreau. 2020. Seeding network influence in biased networks and the benefits of diversity. In Proceedings of The Web Conference 2020. 2089–2098.
    [211]
    Ana-Andreea Stoica, Christopher Riederer, and Augustin Chaintreau. 2018. Algorithmic glass ceiling in social networks: The effects of social recommendations on network diversity. In Proceedings of the World Wide Web Conference. 923–932.
    [212]
    N. Sumith, B. Annappa, and Swapan Bhattacharya. 2018. Influence maximization in large social networks: Heuristics, models and parameters. Fut. Gener. Comput. Syst. 89 (2018), 777–790.
    [213]
    Ian P. Swift, Sana Ebrahimi, Azade Nova, and Abolfazl Asudeh. 2022. Maximizing fair content spread via edge suggestion in social networks. Proceedings of the VLDB Endowment 15, 11 (2022), 2692–2705.
    [214]
    Lubos Takac and Michal Zabovsky. 2012. Data analysis in public social networks. In International Scientific Conference and International Workshop Present Day Trends of Innovations, Vol. 1.
    [215]
    Youze Tang, Yanchen Shi, and Xiaokui Xiao. 2015. Influence maximization in near-linear time: A martingale approach. In Proceedings of the ACM SIGMOD International Conference on Management of Data. 1539–1554.
    [216]
    Youze Tang, Xiaokui Xiao, and Yanchen Shi. 2014. Influence maximization: Near-optimal time complexity meets practical efficiency. In Proceedings of the ACM SIGMOD International Conference on Management of Data. 75–86.
    [217]
    Bassel Tarbush and Alexander Teytelboym. 2012. Homophily in online social networks. In International Workshop on Internet and Network Economics. Springer, 512–518.
    [218]
    Troy Tassier and Filippo Menczer. 2008. Social network structure, segregation, and equality in a labor market with referral hiring. J. Econ. Behav. Org. 66, 3-4 (2008), 514–528.
    [219]
    Ya-Wen Teng, Hsi-Wen Chen, De-Nian Yang, Yvonne-Anne Pignolet, Ting-Wei Li, and Lydia Chen. 2021. On influencing the influential: Disparity seeding. In Proceedings of the 30th ACM International Conference on Information & Knowledge Management. 1804–1813.
    [220]
    Guangmo Tong, Weili Wu, Shaojie Tang, and Ding-Zhu Du. 2016. Adaptive influence maximization in dynamic social networks. IEEE/ACM Trans. Netw. 25, 1 (2016), 112–125.
    [221]
    Cong Tran, Won-Yong Shin, and Andreas Spitz. 2021. Community detection in partially observable social networks. ACM Trans. Knowl. Discov. Data 16, 2 (2021), 1–24.
    [222]
    Alan Tsang, Bryan Wilder, Eric Rice, Milind Tambe, and Yair Zick. 2019. Group-fairness in influence maximization. arXiv:1903.00967. Retrieved from https://arxiv.org/abs/1903.00967
    [223]
    Sotiris Tsioutsiouliklis, Evaggelia Pitoura, Konstantinos Semertzidis, and Panayiotis Tsaparas. 2022. Link Recommendations for PageRank Fairness. In Proceedings of the ACM Web Conference. 3541–3551.
    [224]
    Sotiris Tsioutsiouliklis, Evaggelia Pitoura, Panayiotis Tsaparas, Ilias Kleftakis, and Nikos Mamoulis. 2021. Fairness-aware PageRank. In Proceedings of the Web Conference. 3815–3826.
    [225]
    Haroon ur Rasheed, Farhan Hassan Khan, Saba Bashir, and Irsa Fatima. 2018. Detecting suspicious discussion on online forums using data mining. In International Conference on Intelligent Technologies and Applications. Springer, 262–273.
    [226]
    Devesh Varshney, Sandeep Kumar, and Vineet Gupta. 2014. Modeling information diffusion in social networks using latent topic information. In Proceedings of the 10th International Conference on Intelligent Computing Theory (ICIC’14). Springer, 137–148.
    [227]
    Devesh Varshney, Sandeep Kumar, and Vineet Gupta. 2017. Predicting information diffusion probabilities in social networks: A Bayesian networks based approach. Knowl.-Bas. Syst. 133 (2017), 66–76.
    [228]
    Fernando Vega-Redondo. 2007. Complex Social Networks. Number 44. Cambridge University Press.
    [229]
    Suresh Venkatasubramanian, Carlos Scheidegger, Sorelle Friedler, and Aaron Clauset. 2021. Fairness in networks: Social capital, information access, and interventions. In Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining. 4078–4079.
    [230]
    Giacomo Villa, Gabriella Pasi, and Marco Viviani. 2021. Echo chamber detection and analysis. Soc. Netw. Analy. Min. 11, 1 (2021), 1–17.
    [231]
    J. Wang, Y. Ma, M. Liu, H. Yuan, W. Shen, and L. Li. 2017. A vertex similarity index using community information to improve link prediction accuracy. In Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics (SMC’17). 158–163.
    [232]
    Xindi Wang, Onur Varol, and Tina Eliassi-Rad. 2022. Information access equality on generative models of complex networks. Applied Network Science 7, 1 (2022), 54.
    [233]
    Mudasir Ahmad Wani and Suraiya Jabin. 2018. Mutual clustering coefficient-based suspicious-link detection approach for online social networks. J. King Saud Univ. Comput. Inf. Sci. (2018).
    [234]
    Hilde Weerts, Florian Pfisterer, Matthias Feurer, Katharina Eggensperger, Edward Bergman, Noor Awad, Joaquin Vanschoren, Mykola Pechenizkiy, Bernd Bischl, and Frank Hutter. 2024. Can fairness be automated? Guidelines and opportunities for fairness-aware AutoML. Journal of Artificial Intelligence Research 79 (2024), 639–677.
    [235]
    Hilde Weerts, Lambèr Royakkers, and Mykola Pechenizkiy. 2022. Does the end justify the means? On the moral justification of fairness-aware machine learning. arXiv:2202.08536. Retrieved from https://arxiv.org/abs/2202.08536
    [236]
    Hilde Weerts, Raphaële Xenidis, Fabien Tarissan, Henrik Palmer Olsen, and Mykola Pechenizkiy. 2023. Algorithmic unfairness through the lens of EU non-discrimination law: Or why the law is not a decision tree. In Proceedings of the ACM Conference on Fairness, Accountability, and Transparency. 805–816.
    [237]
    Klaus Wehmuth and Artur Ziviani. 2013. Daccer: Distributed assessment of the closeness centrality ranking in complex networks. Comput. Netw. 57, 13 (2013), 2536–2548.
    [238]
    Bryan Wilder, Laura Onasch-Vera, Graham Diguiseppi, Robin Petering, Chyna Hill, Amulya Yadav, Eric Rice, and Milind Tambe. 2021. Clinical trial of an AI-augmented intervention for HIV prevention in youth experiencing homelessness. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 35. 14948–14956.
    [239]
    Fang Wu and Bernardo A. Huberman. 2004. Social structure and opinion formation (unpublished).
    [240]
    Liang Wu, Fred Morstatter, Xia Hu, and Huan Liu. 2016. Mining misinformation in social media. Big Data Complex Soc. Netw. (2016), 123–152.
    [241]
    Peng Wu and Li Pan. 2017. Scalable influence blocking maximization in social networks under competitive independent cascade models. Comput. Netw. 123 (2017), 38–50.
    [242]
    Amulya Yadav, Bryan Wilder, Eric Rice, Robin Petering, Jaih Craddock, Amanda Yoshioka-Maxwell, Mary Hemler, Laura Onasch-Vera, Milind Tambe, and Darlene Woo. 2018. Bridging the gap between theory and practice in influence maximization: Raising awareness about HIV among homeless youth. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI’18). 5399–5403.
    [243]
    Jaewon Yang, Julian McAuley, and Jure Leskovec. 2013. Community detection in networks with node attributes. In Proceedings of the IEEE 13th International Conference on Data Mining. IEEE, 1151–1156.
    [244]
    Chia-Chen Yen, Mi-Yen Yeh, and Ming-Syan Chen. 2013. An efficient approach to updating closeness centrality and average path length in dynamic networks. In Proceedings of the IEEE 13th International Conference on Data Mining. IEEE, 867–876.
    [245]
    Qingfu Zhang and Hui Li. 2007. MOEA/D: A multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11, 6 (2007), 712–731.
    [246]
    Wenbin Zhang, Jeremy C. Weiss, Shuigeng Zhou, and Toby Walsh. 2022. Fairness amidst non-iid graph data: A literature review. arXiv:2202.07170. Retrieved from https://arxiv.org/abs/2202.07170
    [247]
    Bin Zhou, Jian Pei, and WoShun Luk. 2008. A brief survey on anonymization techniques for privacy preserving publishing of social network data. ACM SIGKDD Explor. Newslett. 10, 2 (2008), 12–22.
    [248]
    Tao Zhou, Linyuan Lü, and Yi-Cheng Zhang. 2009. Predicting missing links via local information. Eur. Phys. J. B 71, 4 (2009), 623–630.
    [249]
    Xie Zhou, Li Xiang, and Wang Xiao-Fan. 2008. Weighted evolving networks with self-organized communities. Commun. Theor. Phys. 50, 1 (2008), 261.
    [250]
    Tian Zhu, Bai Wang, Bin Wu, and Chuanxi Zhu. 2014. Maximizing the spread of influence ranking in social networks. Inf. Sci. 278 (2014), 535–544.

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Computing Surveys
    ACM Computing Surveys  Volume 56, Issue 8
    August 2024
    963 pages
    ISSN:0360-0300
    EISSN:1557-7341
    DOI:10.1145/3613627
    • Editors:
    • David Atienza,
    • Michela Milano
    Issue’s Table of Contents

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 26 April 2024
    Online AM: 27 March 2024
    Accepted: 10 March 2024
    Revised: 03 January 2024
    Received: 04 September 2022
    Published in CSUR Volume 56, Issue 8

    Check for updates

    Author Tags

    1. Network science
    2. social network analysis
    3. algorithmic fairness
    4. fairness-aware methods

    Qualifiers

    • Survey

    Funding Sources

    • JST ASPIRE

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 569
      Total Downloads
    • Downloads (Last 12 months)569
    • Downloads (Last 6 weeks)102
    Reflects downloads up to 26 Jul 2024

    Other Metrics

    Citations

    View Options

    Get Access

    Login options

    Full Access

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Full Text

    View this article in Full Text.

    Full Text

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media