Akrati Saxena
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Akrati Saxena has a total of 78 co-authors. Here are the top co-authors by number of shared publications:
- Sudarshan Iyengar
Department of Computer Science and Engineering Indian Institute of Technology Ropar India
11 shared publications - Mykola Pechenizkiy
Eindhoven University of Technology, Eindhoven, Netherlands
8 shared publications Harita Reddy
5 shared publicationsElze de Vink
Affiliation Leiden Institute of Advanced Computer Science, Leiden University, Leiden, the Netherlands
4 shared publications- Pradumn Kumar Pandey
Department of Computer Science and Engineering, Indian Institute of Technology Roorkee, Roorkee, India
4 shared publications Pratishtha Saxena
G. L. Bajaj Institute of Technology and Management
4 shared publications
Latest Publications
- Open Access
- 12 November 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
Fairness-Sensitive PageRank Approximation
Real-world social networks have structural inequalities, including the majority and minorities, and fairness-agnostic centrality measures often amplify these inequalities by disproportionately favoring majority nodes. Fairness-Sensitive PageRank aims to balance algorithmic influence across structurally and demographically diverse groups while preserving the link-based relevance of classical PageRank. However, existing formulations require solving constrained optimization and matrix inversions that scale poorly with network size. In this work, we develop an efficient mean-field approximation for Fairness-Sensitive PageRank (FSPR) that enforces group-level fairness through an estimated teleportation (jump) vector, thereby avoiding the costly matrix inversion and iterative optimization. We derive a closed-form approximation of FSPR using the in-degree and group label of nodes, along with the global group proportion. We further analyze intra-class fluctuations by deriving expressions for the variance of approximated FSPR scores. Empirical results on real-world networks demonstrate that the proposed approximation efficiently estimates the FSPR while reducing runtime by an order of magnitude, enabling fairness-constrained ranking at scale.
- 12 November 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
Open AccessFairness-Sensitive PageRank Approximation
Real-world social networks have structural inequalities, including the majority and minorities, and fairness-agnostic centrality measures often amplify these inequalities by disproportionately favoring majority nodes. Fairness-Sensitive PageRank aims to balance algorithmic influence across structurally and demographically diverse groups while preserving the link-based relevance of classical PageRank. However, existing formulations require solving constrained optimization and matrix inversions that scale poorly with network size. In this work, we develop an efficient mean-field approximation for Fairness-Sensitive PageRank (FSPR) that enforces group-level fairness through an estimated teleportation (jump) vector, thereby avoiding the costly matrix inversion and iterative optimization. We derive a closed-form approximation of FSPR using the in-degree and group label of nodes, along with the global group proportion. We further analyze intra-class fluctuations by deriving expressions for the variance of approximated FSPR scores. Empirical results on real-world networks demonstrate that the proposed approximation efficiently estimates the FSPR while reducing runtime by an order of magnitude, enabling fairness-constrained ranking at scale.
- 27 October 2026
- Published by Springer Nature in International Journal of Data Science and Analytics
- Vol. 22 (1) , 363
Fraud rings detection in weighted transaction networks with multiple attributes using Spark GraphFrames
- 27 October 2026
- Published by Springer Nature in International Journal of Data Science and Analytics
- Vol. 22 (1) , 363
Fraud rings detection in weighted transaction networks with multiple attributes using Spark GraphFrames
- Open Access
- 20 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 270-276
Revisiting Incremental Skip-gram for Dynamic Network Embedding
- 20 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 270-276
Open AccessRevisiting Incremental Skip-gram for Dynamic Network Embedding
- Open Access
- 20 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 138-157
Reproducibility Challenges in Computational Network Science: Evidence, Causes, and Recommendations
- 20 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 138-157
Open AccessReproducibility Challenges in Computational Network Science: Evidence, Causes, and Recommendations
- Open Access
- 8 July 2026
- Published by Springer Nature in Social Network Analysis and Mining
- Vol. 16 (1)
Individual fairness in community detection: quantitative measure and comparative evaluation
Community detection is a fundamental task in complex network analysis. Fairness-aware community detection seeks to prevent biased node partitions, typically framed in terms of individual fairness, which requires similar nodes to be treated similarly, and group fairness, which aims to avoid disadvantaging specific groups of nodes. While existing literature on fair community detection has primarily focused on group fairness, we introduce a novel measure to quantify individual fairness in community detection methods. The proposed measure captures unfairness in unweighted, undirected networks with crisp communities as the vector distance between a node’s true and predicted community representations, computed using the community co-occurrence matrix. We provide a comprehensive empirical investigation of a broad set of community detection algorithms from the literature on both synthetic networks, with varying levels of community explicitness, and real-world networks. We particularly investigate the fairness-performance trade-off using standard quality metrics and compare individual fairness outcomes with existing group fairness measures. The results show that individual unfairness can occur even when group fairness or clustering accuracy is high, underscoring that individual and group fairness are not interchangeable. Moreover, fairness depends critically on the detectability of community structure. However, we find that Significance and Surprise for denser graphs, and Combo, Leiden, and SBMDL for sparser graphs result in a better trade-off between individual fairness and community quality. Overall, our findings, together with the fact that community detection is an important step in many network analysis downstream tasks, highlight the necessity of developing fairness-aware community detection methods.
- 8 July 2026
- Published by Springer Nature in Social Network Analysis and Mining
- Vol. 16 (1)
Open AccessIndividual fairness in community detection: quantitative measure and comparative evaluation
Community detection is a fundamental task in complex network analysis. Fairness-aware community detection seeks to prevent biased node partitions, typically framed in terms of individual fairness, which requires similar nodes to be treated similarly, and group fairness, which aims to avoid disadvantaging specific groups of nodes. While existing literature on fair community detection has primarily focused on group fairness, we introduce a novel measure to quantify individual fairness in community detection methods. The proposed measure captures unfairness in unweighted, undirected networks with crisp communities as the vector distance between a node’s true and predicted community representations, computed using the community co-occurrence matrix. We provide a comprehensive empirical investigation of a broad set of community detection algorithms from the literature on both synthetic networks, with varying levels of community explicitness, and real-world networks. We particularly investigate the fairness-performance trade-off using standard quality metrics and compare individual fairness outcomes with existing group fairness measures. The results show that individual unfairness can occur even when group fairness or clustering accuracy is high, underscoring that individual and group fairness are not interchangeable. Moreover, fairness depends critically on the detectability of community structure. However, we find that Significance and Surprise for denser graphs, and Combo, Leiden, and SBMDL for sparser graphs result in a better trade-off between individual fairness and community quality. Overall, our findings, together with the fact that community detection is an important step in many network analysis downstream tasks, highlight the necessity of developing fairness-aware community detection methods.
- Open Access
- 25 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 392-397
Tracking the Trackers: Structural Evolution of Web-Tracking on Educational Websites
- 25 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 392-397
Open AccessTracking the Trackers: Structural Evolution of Web-Tracking on Educational Websites
- Open Access
- 24 March 2026
- Published by Elsevier in SSRN Electronic Journal
Topology or Demography? Understanding Sources of Bias in Opinion Dynamics Models
The formation of opinions is influenced by a complex array of factors, including environment, education, and socio-economic status. This complexity is further compounded by the dynamic nature of social networks. As a result, many models tend to perform well for the majority population but discriminate against marginalized groups. The field of Fairness in Social Network Analysis (SNA) aims to address this bias. This work investigates how a state-of-the-art model discriminates against minority groups and whether it is possible to predict for whom it will perform poorly based on demographic or topological features. Using the NetSense dataset and the CoDiNG model for opinion prediction, we employed three classifier models to assess the algorithm's performance. Our analysis revealed four key patterns of algorithmic bias: variability in predictive effectiveness across issue types and minority groups, extreme predictive variability for behaviourally-defined minorities, potent but variable predictive signals from socio-economic and religious minorities, and challenges in predicting misclassifications for certain demographic minorities. Our findings suggest that no single approach provides the best results, and context-aware strategies are necessary for fairness-oriented social network analysis. A multi-faceted approach, incorporating individual attributes and network structures, is essential for reducing algorithmic bias and promoting inclusive decision-making.
- 24 March 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessTopology or Demography? Understanding Sources of Bias in Opinion Dynamics Models
The formation of opinions is influenced by a complex array of factors, including environment, education, and socio-economic status. This complexity is further compounded by the dynamic nature of social networks. As a result, many models tend to perform well for the majority population but discriminate against marginalized groups. The field of Fairness in Social Network Analysis (SNA) aims to address this bias. This work investigates how a state-of-the-art model discriminates against minority groups and whether it is possible to predict for whom it will perform poorly based on demographic or topological features. Using the NetSense dataset and the CoDiNG model for opinion prediction, we employed three classifier models to assess the algorithm's performance. Our analysis revealed four key patterns of algorithmic bias: variability in predictive effectiveness across issue types and minority groups, extreme predictive variability for behaviourally-defined minorities, potent but variable predictive signals from socio-economic and religious minorities, and challenges in predicting misclassifications for certain demographic minorities. Our findings suggest that no single approach provides the best results, and context-aware strategies are necessary for fairness-oriented social network analysis. A multi-faceted approach, incorporating individual attributes and network structures, is essential for reducing algorithmic bias and promoting inclusive decision-making.
- Open Access
Individual Fairness in Community Detection: Quantitative Measure and Comparative Evaluation
Community detection is a fundamental task in complex network analysis. Fairness-aware community detection seeks to prevent biased node partitions, typically framed in terms of individual fairness, which requires similar nodes to be treated similarly, and group fairness, which aims to avoid disadvantaging specific groups of nodes. While existing literature on fair community detection has primarily focused on group fairness, we introduce a novel measure to quantify individual fairness in community detection methods. The proposed measure captures unfairness as the vectorial distance between a node's true and predicted community representations, computed using the community co-occurrence matrix. We provide a comprehensive empirical investigation of a broad set of community detection algorithms from the literature on both synthetic networks, with varying levels of community explicitness, and real-world networks. We particularly investigate the fairness-performance trade-off using standard quality metrics and compare individual fairness outcomes with existing group fairness measures. The results show that individual unfairness can occur even when group fairness or clustering accuracy is high, underscoring that individual and group fairness are not interchangeable. Moreover, fairness depends critically on the detectability of community structure. However, we find that Significance and Surprise for denser graphs, and Combo, Leiden, and SBMDL for sparser graphs result in a better trade-off between individual fairness and community quality. Overall, our findings, together with the fact that community detection is an important step in many network analysis downstream tasks, highlight the necessity of developing fairness-aware community detection methods.
Open AccessIndividual Fairness in Community Detection: Quantitative Measure and Comparative Evaluation
Community detection is a fundamental task in complex network analysis. Fairness-aware community detection seeks to prevent biased node partitions, typically framed in terms of individual fairness, which requires similar nodes to be treated similarly, and group fairness, which aims to avoid disadvantaging specific groups of nodes. While existing literature on fair community detection has primarily focused on group fairness, we introduce a novel measure to quantify individual fairness in community detection methods. The proposed measure captures unfairness as the vectorial distance between a node's true and predicted community representations, computed using the community co-occurrence matrix. We provide a comprehensive empirical investigation of a broad set of community detection algorithms from the literature on both synthetic networks, with varying levels of community explicitness, and real-world networks. We particularly investigate the fairness-performance trade-off using standard quality metrics and compare individual fairness outcomes with existing group fairness measures. The results show that individual unfairness can occur even when group fairness or clustering accuracy is high, underscoring that individual and group fairness are not interchangeable. Moreover, fairness depends critically on the detectability of community structure. However, we find that Significance and Surprise for denser graphs, and Combo, Leiden, and SBMDL for sparser graphs result in a better trade-off between individual fairness and community quality. Overall, our findings, together with the fact that community detection is an important step in many network analysis downstream tasks, highlight the necessity of developing fairness-aware community detection methods.
- Open Access
Fairness-Sensitive PageRank Approximation
Real-world social networks have structural inequalities, including the majority and minorities, and fairness-agnostic centrality measures often amplify these inequalities by disproportionately favoring majority nodes. Fairness-Sensitive PageRank aims to balance algorithmic influence across structurally and demographically diverse groups while preserving the link-based relevance of classical PageRank. However, existing formulations require solving constrained matrix inversions that scale poorly with network size. In this work, we develop an efficient mean-field approximation for Fairness-Sensitive PageRank (FSPR) that enforces group-level fairness through an estimated teleportation (jump) vector, thereby avoiding the costly matrix inversion and iterative optimization. We derive a closed-form approximation of FSPR using the in-degree and group label of nodes, along with the global group proportion. We further analyze intra-class fluctuations by deriving expressions for the variance of approximated FSPR scores. Empirical results on real-world networks demonstrate that the proposed approximation efficiently estimates the FSPR while reducing runtime by an order of magnitude, enabling fairness-constrained ranking at scale.
Open AccessFairness-Sensitive PageRank Approximation
Real-world social networks have structural inequalities, including the majority and minorities, and fairness-agnostic centrality measures often amplify these inequalities by disproportionately favoring majority nodes. Fairness-Sensitive PageRank aims to balance algorithmic influence across structurally and demographically diverse groups while preserving the link-based relevance of classical PageRank. However, existing formulations require solving constrained matrix inversions that scale poorly with network size. In this work, we develop an efficient mean-field approximation for Fairness-Sensitive PageRank (FSPR) that enforces group-level fairness through an estimated teleportation (jump) vector, thereby avoiding the costly matrix inversion and iterative optimization. We derive a closed-form approximation of FSPR using the in-degree and group label of nodes, along with the global group proportion. We further analyze intra-class fluctuations by deriving expressions for the variance of approximated FSPR scores. Empirical results on real-world networks demonstrate that the proposed approximation efficiently estimates the FSPR while reducing runtime by an order of magnitude, enabling fairness-constrained ranking at scale.
- Top Cited Papers
- 7 January 2026
- Published by Springer Nature in Applied Intelligence
- Vol. 56 (1) , 33
Gender biases in online communication: A case study of soccer
- 7 January 2026
- Published by Springer Nature in Applied Intelligence
- Vol. 56 (1) , 33
Top Cited PapersGender biases in online communication: A case study of soccer