Two-way Node Popularity Model for Directed and Bipartite Networks

2025-12-31 · Source: JMLR · Field: Technology & Digital — Artificial Intelligence & Machine Learning, Data Science & Analytics · Depth: Expert, quick

Summary

A new probabilistic framework, the Two-Way Node Popularity Model (TNPM), has been developed to address the oversight of node popularity in community detection within directed and bipartite networks. Published by Bing-Yi Jing, Ting Li, Jiangzhou Wang, and Ya Wang in 2026, TNPM also accommodates edges from various sub-Gaussian distributions. The model utilizes the Delete-One-Method (DOM) for fitting and community structure identification, supported by a theoretical analysis involving sub-Gaussian generalization. For enhanced efficiency in large-scale networks, the Two-Stage Divided Cosine Algorithm (TSDC) is introduced. Numerical studies confirm the multi-folded advantages of these methods in estimation accuracy and computational efficiency, with real-world applications revealing interesting findings.

Key takeaway

For AI Researchers and Research Scientists working on community detection in complex networks, TNPM offers a robust framework that accounts for node popularity and diverse edge distributions. You should consider integrating TNPM and its associated algorithms, DOM and TSDC, into your analysis pipelines, especially when dealing with large-scale directed or bipartite networks, to improve estimation accuracy and computational efficiency in identifying community structures.

Key insights

TNPM enhances community detection in complex networks by integrating node popularity and diverse edge distributions.

Principles

• Node popularity impacts community structure.
• Sub-Gaussian distributions model diverse edge types.

Method

TNPM uses the Delete-One-Method (DOM) for model fitting and community identification, and the Two-Stage Divided Cosine Algorithm (TSDC) for large-scale network efficiency.

In practice

• Apply TNPM to directed networks.
• Use TSDC for large network analysis.

Topics

• Community Detection
• Directed Networks
• Bipartite Networks
• Two-Way Node Popularity Model
• Sub-Gaussian Distributions

Code references

• MiaCora/Two-way-Node-Popularity-Model

Best for: AI Researcher, AI Scientist, Research Scientist

Related on AIssential

• Achieving the Kesten-Stigum bound in the non-uniform hypergraph stochastic block model — Combining subcritical hypergraph layers can enable weak recovery if their aggregate signal-to-noise ratio surpasses a Kesten–Stigum-type bound.
• Graph Reduction in Multirelational Networks: A Spreading-Oriented Reduction Benchmark — Graph reduction's impact on influence maximization performance varies significantly by network type and reduction strategy.
• Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds — Diffusion-network alignment leverages local tree correlation tests and two-pass information propagation to match partially observed diffusion trees to full networks.
• Learning Long Range Spatio-Temporal Representations over Continuous Time Dynamic Graphs with State Space Models — CTDG-SSM unifies state-space modeling with graph topology to capture long-range spatio-temporal dependencies in continuous-time dynamic graphs.
• Alcmean's: Unsupervised community detection using local Laplacian, automatic detection of the number of centers — ALCMeans automatically detects communities in complex networks by combining Laplacian energy with DeepWalk embeddings, outperforming traditional methods.
• Community Concealment from Unsupervised Graph Learning-Based Clustering — Community concealment in GNNs depends on boundary connectivity and feature similarity, mitigated by targeted perturbations.

Open in AIssential →

Editorial summary, takeaway, and curation by AIssential. Original article published by JMLR.