mlsanityData to 7 Oct 2026

Proportional Selection in Networks

arXiv 2502.03545 ↗First posted 5 Feb 2025cs.GT cs.AI cs.MAcited by 1

Not on the map. Why?

Abstract (arXiv)

We address the problem of selecting k representative nodes from a network, aiming to achieve two objectives: identifying the most influential nodes and ensuring the selection proportionally reflects the network's diversity. We propose two approaches to accomplish this, analyze them theoretically, and demonstrate their effectiveness through a series of experiments.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 33 of its 76 references that are in the map. First posted on arXiv 5 Feb 2025.

Builds on

33 of 76 references.

References · 33

  1. 2019Multi-scale Attributed Node Embeddingcited by 543
  2. 2019Proportionally Fair Clusteringcited by 69
  3. 2021A Survey of Community Detection Approaches: From Statistical Modeling to Deep Learningcited by 55
  4. 2023Generative Social Choicecited by 43
  5. 2014Justified Representation in Approval-Based Committee Votingcited by 42
  6. 2018Blind Justice: Fairness with Encrypted Sensitive Attributescited by 41
  7. 2020Multi-Winner Voting with Approval Preferencescited by 37
  8. 2020Proportional Participatory Budgeting with Additive Utilitiescited by 37
  9. 2014Influence Maximization: Near-Optimal Time Complexity Meets Practical Efficiencycited by 33
  10. 2016Proportional Justified Representationcited by 25
  11. 2019Community detection in node-attributed social networks: a surveycited by 24
  12. 2019Group-Fairness in Influence Maximizationcited by 21
21 more
  1. 2019Proportionality and the Limits of Welfarismcited by 21
  2. 2015Clustering attributed graphs: models, measures and methodscited by 20
  3. 2021Fairness-Aware Node Representation Learningcited by 14
  4. 2023Participatory Budgeting: Data, Tools, and Analysiscited by 13
  5. 2019What Do Multiwinner Voting Rules Do? An Experiment Over the Two-Dimensional Euclidean Domaincited by 10
  6. 2022FairSNA: Algorithmic Fairness in Social Network Analysiscited by 9
  7. 2023Proportionally Representative Clusteringcited by 8
  8. 2022Approximate Group Fairness for Clusteringcited by 7
  9. 2022Using sensitive data to prevent discrimination by artificial intelligence: Does the GDPR need a new exception?cited by 7
  10. 2023Label Deconvolution for Node Representation Learning on Large-scale Attributed Graphs against Learning Biascited by 7
  11. 2021Strategyproof Mechanisms For Group-Fair Facility Location Problemscited by 5
  12. 2024Method of Equal Shares with Bounded Overspendingcited by 4
  13. 2015Absorbing random-walk centrality: Theory and algorithmscited by 3
  14. 2022Fairness in Maximal Covering Location Problemscited by 3
  15. 2023Proportional Fairness in Obnoxious Facility Locationcited by 3
  16. 2024The Squared Kemeny Rule for Averaging Rankingscited by 3
  17. 2021Centrality with Diversitycited by 2
  18. 2019Group Centrality Maximization for Large-scale Graphscited by 1
  19. 2020Axiomatic Characterization of PageRankcited by 1
  20. 2020Group-Harmonic and Group-Closeness Maximization -- Approximation and Engineeringcited by 1
  21. 2021An Axiom System for Feedback Centralitiescited by 1

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.

  1. 2025Fairness in the Multi-Secretary Problemcited by 0