Searcharxiv⌕ Search

arXiv · 2609.22923

Locally Fair PageRank: Mean-Field Approximation and One-Step Refinement

Abstract

Graph-based ranking methods such as PageRank can amplify structural disparities in networks, motivating fairness-aware ranking mechanisms for sensitive groups. Locally Fair PageRank (LFPR) enforces fairness through local propagation, but exact computation requires repeated iterations until convergence, limiting scalability on large graphs. We develop a scalable analytical framework for approximating Neighborhood Locally Fair PageRank and Uniform Locally Fair PageRank. By introducing a group-aware heterogeneous mean-field representation, the framework aggregates structurally similar nodes into degree classes and derives closed-form approximations of stationary LFPR scores, avoiding repeated propagation over the fairness-aware transition matrix. We develop a One-Step Refinement (ORF) mechanism that applies the fairness-aware propagation operator once to the mean-field estimate, incorporating node-specific neighborhood information without iterative convergence. The fluctuation analysis characterizes degree-dependent variability around the mean-field solution and shows that the coefficient of variation decreases with increasing in-degree. The mean-field approximation reduces the computational cost of exact LFPR from iterative graph-scale propagation to linear-time node-level estimation, while ORF requires one graph traversal. Experiments on six real-world networks show strong agreement with exact LFPR scores and rankings, preservation of group-level fairness, and substantial runtime reductions. The mean-field approximation reduces complexity to $\mathcal{O}(n)$, while ORF improves accuracy with $\mathcal{O}(m+n)$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mukesh Kumar, Gaurav Dixit, Akrati Saxena. 2026-09-19. Locally Fair PageRank: Mean-Field Approximation and One-Step Refinement. https://searcharxiv.com/abs/2609.22923

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Network sampling: a comparative review

Network sampling is essential for the study of real world systems, since access to the topological structure and dynamical characteristics of a complex system is usually infeasible, and can also prove computationally intractable for large and dense networks. However, the field still lacks systematic methodologies that allow a procedural analysis of sampling plans for connected data. Hence, this study aims to compare network sampling methods through the usage of multivariate statistical analysis and machine learning techniques that are anchored in network metrics' estimation of synthetic and real-world networks. It was demonstrated that no single sampling strategy dominates both cases, although Forest fire and Frontier sampling have presented the most consistent performance across all topologies investigated. The impact of each structural property of these networks for principal component analysis and classification results were also discussed, with consistent pattern groups seen for both data types. Transfer learning aimed at real-world network identification has also demonstrated that realistic structural connections can be correlated to well-known network models through the usage of sampled subgraphs' properties for model training, providing an avenue to real-world network characterization through sampling methodologies.

cs.SI↗

Manufactured Authenticity: How Behavioral Signals Are Produced and Misread in Online Markets

Online platforms increasingly ask users to infer credibility from behavioral signals whose production conditions are opaque. We introduce manufactured authenticity: the platform-mediated production of observable activity that interfaces invite users to read as organic participation. Using 996,834 cryptocurrency tokens and 50,895 creator wallets from Pump.fun, a Solana-based token launchpad, we examine how legitimacy signals are produced in an automation-enabled online market. We identify four production strategies (high-velocity launching, passive launching, template-content creation, and organic-style creation) that generate distinct but interface-similar cues of activity, narrative plausibility, and participation. High-velocity and template-content strategies emerge as alternatives rather than cumulative layers: the former produces activity at scale, while the latter produces descriptions associated with higher reply engagement. Yet visible engagement does not imply broader diffusion: template-like content attracts replies without greater ownership dispersion, and tokens associated with non-organic production strategies exhibit more concentrated investor holdings than organic-style tokens. We argue that platform governance should move beyond detecting manipulation toward making signal provenance legible. We propose authenticity disclosure as a design approach for surfacing production conditions without requiring definitive claims about automation, AI authorship, or actor intent.

cs.SI↗

Spatial Price Formation in Transport Networks: A Variational Approach

This paper formulates a model of spatial price formation in a closed regional economy, with finitely many production nodes and finitely many demand nodes embedded in a continuous geographic domain. Transportation costs depend on the geometry of the region and on an underlying network of feasible connections. Prices are modeled as a spatial field constrained by arbitrage and transport feasibility. The equilibrium price system is characterized by a variational problem. A second minimization selects an equilibrium-compatible price field with minimum spatial energy and permits the use of Euler--Lagrange methods. The framework clarifies what observed prices and quantities reveal about demand, and uses known transport costs to bound unobserved prices and exclude directed arcs from equilibrium shipments. A five-node example illustrates equilibrium, alternative shipment patterns, and the information supplied by partial price observations. We give a numerical procedure for planar domains and outline an extension to spherical domains.

cs.SI↗