New Algorithm MOUFLON Brings Fairness to Community Detection in Large Social Networks

Community detection has long been one of the workhorses of social network analysis, powering everything from friend recommendations on social media platforms to the design of large-scale experiments on networks of interacting users. Yet a growing body of research has warned that these algorithms, which typically identify groups of densely connected nodes without regard to who those nodes are, can silently encode and even amplify demographic biases. When communities are used to drive recommendations, influence maximization, or cluster-based randomized testing, demographically skewed partitions can systematically disadvantage minority groups before any downstream decision is even made. A new study published in Data Mining and Knowledge Discovery introduces MOUFLON, a fairness-aware community detection method that aims to solve this problem while preserving the scalability that makes modularity-based methods so widely used.

The work, led by Georgios Panayiotou of the InfoLab at the Department of Information Technology, Uppsala University, together with Anand Mathew Muthukulam Simon, Matteo Magnani, and Ece Calikus, addresses two long-standing gaps in the fairness-aware graph mining literature. First, most existing fair community detection methods can only handle two demographic groups, ignoring sensitive attributes such as ethnicity, age brackets, or nationality that naturally contain more than two classes. Second, and perhaps more subtly, the fairness scores produced by earlier methods are highly sensitive to the structure of the network itself. In a network where one group is severely underrepresented, even a perfectly unbiased algorithm can produce low fairness scores simply because of class imbalance, making it impossible to tell whether a low score reflects genuine unfairness or merely an unavoidable structural constraint.

To overcome this ambiguity, the researchers propose a novel fairness measure called proportional balance. Classical group balance, inherited from the fair clustering literature and the doctrine of disparate impact, measures how evenly demographic groups are represented within a community. While intuitive, this definition scales poorly when the number of groups grows and behaves erratically under class imbalance, since the maximum attainable score can fall far below one. Proportional balance instead rewards communities whose demographic composition mirrors the overall group distribution in the network. The method computes an expected balance score for each community based on the global demographics and community size, and then penalizes communities whose observed balance falls short of that expectation. Communities that meet or exceed the proportional expectation receive a maximum score of one, regardless of how imbalanced the overall network happens to be. By weighting these community-level scores by community size, the global fairness score also avoids degenerate solutions built from many tiny, artificially mixed clusters.

MOUFLON itself is a modification of the celebrated Louvain algorithm, the greedy, multilevel modularity optimization procedure that remains one of the most scalable community detection techniques available. Rather than simply replacing modularity gain with a combined objective from the outset, MOUFLON adopts a modularity-first heuristic. In its first pass, nodes are moved locally using modularity alone, allowing the algorithm to lock onto well-connected structure before fairness considerations come into play. Subsequent moves on the aggregate graph then optimize a weighted sum of modularity and proportional fairness, governed by a tunable parameter alpha that lets users explicitly control the trade-off. Setting alpha to one recovers traditional, fairness-oblivious modularity maximization; setting it to zero optimizes fairness alone; and intermediate values sweep a continuum between the two. This two-phase design specifically addresses local maxima problems documented in earlier work, where greedy fairness-aware methods starting from scratch often could not escape poor partitions when fairness was weighted heavily.

Scalability was a central design concern. Fair spectral clustering approaches, an early family of fair graph clustering methods, require the number of clusters to be specified in advance and rely on expensive eigendecompositions that limit their applicability to large networks. MOUFLON, by contrast, inherits the essentially linear runtime of Louvain with respect to the number of edges. The authors implement a hashtable-like data structure that tracks the demographic composition of each meta-node during optimization, reducing the per-edge cost of fairness updates to a negligible overhead proportional to the small number of demographic groups. In experiments on synthetic Erdős-Rényi and LFR benchmark networks reaching up to 200,000 nodes, and on real social networks including Facebook, Deezer, Twitch, and Pokec, MOUFLON ran nearly as fast as standard Louvain, completing partitions of networks with tens of thousands of nodes in seconds on an ordinary desktop machine.

The experimental evaluation goes well beyond a simple performance benchmark. The authors systematically varied network size, density, group proportions, and the fairness metric itself, and examined extreme scenarios in which entire communities are monochromatic, meaning every node belongs to a single demographic group. These deliberately segregated structures revealed hard limits on what any fairness-aware method can achieve: when demographic identity aligns tightly with well-defined community structure, improving fairness requires substantially compromising modularity. In randomized settings, by contrast, the trade-off unfolded smoothly. Statistical tests, including paired t-tests and Hotelling’s T-squared tests across repeated runs and multiple independently generated benchmark networks, confirmed that changes in alpha produced genuine, significant shifts in both modularity and fairness rather than random noise from the algorithm’s stochastic initialization.

A particularly telling result concerns the choice of fairness metric. When MOUFLON used simple group balance, the algorithm became insensitive to the alpha parameter, returning essentially the same partition regardless of how quality and fairness were weighted, because it could not escape the local maximum formed by the planted communities. Only the proportional balance metric enabled genuine, tunable trade-offs between structure and fairness, reinforcing the paper’s argument that fairness definitions must be designed with both multi-group settings and class imbalance in mind. The authors also caution that a given value of alpha does not guarantee a fixed balance across different networks, since the achievable maxima of both modularity and fairness depend on the input data, and they recommend empirically sweeping alpha and inspecting the resulting trade-off curve as a diagnostic practice.

To demonstrate real-world relevance, the team applied MOUFLON to population-scale social networks derived from Swedish administrative register data for two municipalities, Filipstad and Sandviken, areas prominently discussed in national debates on residential segregation and immigrant integration. In these networks, nodes represent residents and weighted edges capture the number of social contexts, from household and family to school and work, in which two individuals are connected. The sensitive attribute was the individuals’ listed country of origin. Strikingly, the fairness-oblivious Louvain algorithm already produced partitions with proportional fairness scores above 0.92 in both municipalities, suggesting that social ties there are not fully segregated along origin lines. MOUFLON then pushed fairness even higher at a remarkably small cost in modularity, particularly for alpha values between 0.25 and 0.75, and delivered results within seconds. The authors note that this latent compatibility between structure and demographic balance is itself informative, and that extending the analysis to larger urban areas, additional sensitive attributes, and multilayer networks remains important future work.

The study also raises a conceptual question that the authors confront openly: when partitions are no longer strictly maximizing modularity, should the resulting groups still be called communities in the classical sense? They suggest that these outputs may be better understood as an extension of the community concept, balancing structural coherence with demographic representativeness, much as the fair clustering literature adopted the term fairlets for its balanced clusters. Beyond social media, the researchers point to applications in randomized platform experimentation, classroom and school assignment, and transportation network planning, wherever community structure feeds downstream decisions that could otherwise reinforce inequality. By combining multi-group support, imbalance-robust fairness scoring, tunable trade-offs, and near-Louvain scalability, MOUFLON offers both a practical tool and a template for how fairness-aware social network analysis should be designed and benchmarked. The implementation and synthetic network generator have been released openly, and the register-derived findings underscore that demographically balanced, structurally meaningful communities can be recovered at modest cost even in real, offline social structures.

Subject of Research: Fairness-aware modularity-based community detection in social networks

Article Title: MOUFLON: multi-group modularity-based fairness-aware community detection

Article References: Panayiotou, G., Muthukulam Simon, A. M., Magnani, M., & Calikus, E. (2026). MOUFLON: multi-group modularity-based fairness-aware community detection. Data Mining and Knowledge Discovery, 40(6), Article 92. https://doi.org/10.1007/s10618-026-01260-5

Image Credits: AI Generated

DOI: 10.1007/s10618-026-01260-5

Keywords: community detection, algorithmic fairness, modularity, social network analysis, Louvain algorithm, graph clustering, network inequality, proportional balance, filter bubbles, residential segregation, population networks, data mining