Promoting Fairness in Information Access within Social Networks

• URL: http://arxiv.org/abs/2512.14711v1
• Date: Mon, 08 Dec 2025 08:21:22 GMT
• Title: Promoting Fairness in Information Access within Social Networks
• Authors: Changan Liu, Xiaotian Zhou, Ahad N. Zehmakan, Zhongzhi Zhang,
• Abstract summary: We study the optimization problem of adding new connections to a network to enhance fairness in information access among different demographic groups.<n>We propose a simple greedy algorithm which turns out to output accurate solutions, but its run time is cubic, which makes it undesirable for large networks.
• Score: 22.892652243512416
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The advent of online social networks has facilitated fast and wide spread of information. However, some users, especially members of minority groups, may be less likely to receive information spreading on the network, due to their disadvantaged network position. We study the optimization problem of adding new connections to a network to enhance fairness in information access among different demographic groups. We provide a concrete formulation of this problem where information access is measured in terms of resistance distance, {offering a new perspective that emphasizes global network structure and multi-path connectivity.} The problem is shown to be NP-hard. We propose a simple greedy algorithm which turns out to output accurate solutions, but its run time is cubic, which makes it undesirable for large networks. As our main technical contribution, we reduce its time complexity to linear, leveraging several novel approximation techniques. In addition to our theoretical findings, we also conduct an extensive set of experiments using both real-world and synthetic datasets. We demonstrate that our linear-time algorithm can produce accurate solutions for networks with millions of nodes.

Related papers

• Peer Disambiguation in Self-Reported Surveys using Graph Attention Networks [5.8302115161559565]
  This research demonstrates the potential of Graph Neural Networks (GNN) to advance real-world network data analysis.<n>By resolving ambiguities, we improve network accuracy, and in turn, improve suicide risk prediction.
  arXiv  Detail & Related papers  (2025-03-25T21:25:31Z)
• Fast algorithms to improve fair information access in networks [8.174758604182268]
  We consider the problem of selecting $k$ seed nodes in a network to maximize the minimum probability of activation.<n>We design and evaluate a suite of $10$ new scalable algorithms which crucially do not require probability estimation.<n>We provide a new benchmark corpus of $174$ networks drawn from $6$ domains.
  arXiv  Detail & Related papers  (2024-09-04T23:36:39Z)
• Differentially Private Data Release on Graphs: Inefficiencies and Unfairness [48.96399034594329]
  This paper characterizes the impact of Differential Privacy on bias and unfairness in the context of releasing information about networks. We consider a network release problem where the network structure is known to all, but the weights on edges must be released privately. Our work provides theoretical foundations and empirical evidence into the bias and unfairness arising due to privacy in these networked decision problems.
  arXiv  Detail & Related papers  (2024-08-08T08:37:37Z)
• Fair Information Spread on Social Networks with Community Structure [2.9613974659787132]
  Influence maximiza- tion (IM) algorithms aim to identify individuals who will generate the greatest spread through the social network if provided with information. This work relies on fitting a model to the social network which is then used to determine a seed allocation strategy for optimal fair information spread.
  arXiv  Detail & Related papers  (2023-05-15T16:51:18Z)
• Understanding the network formation pattern for better link prediction [4.8334761517444855]
  We propose a novel method named Link prediction using Multiple Order Local Information (MOLI) MOLI exploits the local information from the neighbors of different distances, with parameters that can be a prior-driven based on prior knowledge. We show that MOLI outperforms the other 11 widely used link prediction algorithms on 11 different types of simulated and real-world networks.
  arXiv  Detail & Related papers  (2021-10-17T15:30:04Z)
• Semi-supervised Network Embedding with Differentiable Deep Quantisation [81.49184987430333]
  We develop d-SNEQ, a differentiable quantisation method for network embedding. d-SNEQ incorporates a rank loss to equip the learned quantisation codes with rich high-order information. It is able to substantially compress the size of trained embeddings, thus reducing storage footprint and accelerating retrieval speed.
  arXiv  Detail & Related papers  (2021-08-20T11:53:05Z)
• GAEA: Graph Augmentation for Equitable Access via Reinforcement Learning [50.90625274621288]
  Disparate access to resources by different subpopulations is a prevalent issue in societal and sociotechnical networks. We introduce a new class of problems, Graph Augmentation for Equitable Access (GAEA), to enhance equity in networked systems by editing graph edges under budget constraints.
  arXiv  Detail & Related papers  (2020-12-07T18:29:32Z)
• Towards Accurate Quantization and Pruning via Data-free Knowledge Transfer [61.85316480370141]
  We study data-free quantization and pruning by transferring knowledge from trained large networks to compact networks. Our data-free compact networks achieve competitive accuracy to networks trained and fine-tuned with training data.
  arXiv  Detail & Related papers  (2020-10-14T18:02:55Z)
• Learning Connectivity of Neural Networks from a Topological Perspective [80.35103711638548]
  We propose a topological perspective to represent a network into a complete graph for analysis. By assigning learnable parameters to the edges which reflect the magnitude of connections, the learning process can be performed in a differentiable manner. This learning process is compatible with existing networks and owns adaptability to larger search spaces and different tasks.
  arXiv  Detail & Related papers  (2020-08-19T04:53:31Z)
• Proximity-based Networking: Small world overlays optimized with particle swarm optimization [0.0]
  Small world networks can be incredibly useful in the dissemination and lookup of information within an internet network. We propose a networking scheme that incorporates geographic location in chord for the organization of peers within each node's partitioned key space. The flexibility of our proposed schemes enables a variety of swarm models, and agents.
  arXiv  Detail & Related papers  (2020-06-03T01:40:46Z)
• Detecting Communities in Heterogeneous Multi-Relational Networks:A Message Passing based Approach [89.19237792558687]
  Community is a common characteristic of networks including social networks, biological networks, computer and information networks. We propose an efficient message passing based algorithm to simultaneously detect communities for all homogeneous networks.
  arXiv  Detail & Related papers  (2020-04-06T17:36:24Z)
• Temporal Network Representation Learning via Historical Neighborhoods Aggregation [28.397309507168128]
  We propose the Embedding via Historical Neighborhoods Aggregation (EHNA) algorithm. We first propose a temporal random walk that can identify relevant nodes in historical neighborhoods. Then we apply a deep learning model which uses a custom attention mechanism to induce node embeddings.
  arXiv  Detail & Related papers  (2020-03-30T04:18:48Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.