Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2101.02307

Directed mixed membership stochastic blockmodel

Huan Qing·Jingli Wang
View original source ↗Read source document ↗Export metadata ↓

Abstract

Mixed membership modeling for undirected networks has been extensively explored in network science over the past few years. Despite the substantial progress made for undirected cases, handling mixed membership structures in directed networks continues to pose substantial difficulties. To address this gap, we introduce the Directed Mixed Membership Stochastic Blockmodel (DiMMSB), a novel framework tailored for directed networks with overlapping communities. A key feature of DiMMSB is its ability to treat the row and column nodes of the adjacency matrix as distinct entities, each potentially following its own community organization. Building on this model, we develop DiSP, an efficient spectral procedure to estimate mixed memberships for both sets of nodes. Through delicate analysis, we derive node-specific error bounds of DiSP under mild sparsity conditions. Simulation results support the theoretical results, demonstrating that DiSP achieves lower error rates and faster computation than its competitor. Moreover, applications to real data highlight DiSP's effectiveness in uncovering asymmetric structural patterns.

Explore related subjects

stat.MLcs.LGcs.SI

Keep this discovery

BibTeXRIS

Huan Qing, Jingli Wang. 2026-09-06. Directed mixed membership stochastic blockmodel. https://doi.org/10.1016/j.ins.2026.123577

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

cs.LG subjectcs.SI subjectstat.ML subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

arXiv2026

Statistical Feature Augmentation for Anomaly Detection in Dynamic Graphs

Dynamic networks are being applied in many domains, from social media to logistics systems, each with their own set of special characteristics. A model employed on this type of data must capture the duality between temporal/structural and feature-based information. Yet state-of-the-art deep learning models often struggle to learn especially short-term behavioral interaction signals, such as sender intensity or interaction inertia, directly from raw event streams. To address this gap, we propose a statistical feature augmentation method that explicitly encodes behavioral interaction statistics into the input feature space. We evaluate our proposed method on an anomaly detection task across three real-world datasets (Reddit, Wikipedia, MOOC) and seven models spanning both continuous-time and discrete-time architectures. As a baseline, we apply the same models trained on the original embeddings. Our results show, that augmentation consistently improves detection performance. Beyond performance, the enriched input enables fine-grained post-hoc analysis of behavioral importance, since each statistic occupies a dedicated input dimension. In particular, this work showcases a promising approach for merging classical network analysis with deep learning.

cs.SI↗
arXiv2025

Symmetry-driven embedding of networks in hyperbolic space

Hyperbolic models are known to produce networks with properties observed empirically in most network datasets, including heavy-tailed degree distribution, high clustering, and hierarchical structures. As a result, several embeddings algorithms have been proposed to invert these models and assign hyperbolic coordinates to network data. Current algorithms for finding these coordinates, however, do not quantify uncertainty in the inferred coordinates. We present BIGUE, a Markov chain Monte Carlo (MCMC) algorithm that samples the posterior distribution of a Bayesian hyperbolic random graph model. We show that the samples are consistent with current algorithms while providing added credible intervals for the coordinates and all network properties. We also show that some networks admit two or more plausible embeddings, a feature that an optimization algorithm can easily overlook.

stat.CO↗
arXiv2026

Clustering Three-Way Data with Outliers

Matrix-variate distributions are a relatively recent addition to the model-based clustering literature, thereby making it possible to analyze data in matrix form with complex structure such as images and time series. Due to its recent appearance, there is limited literature on matrix-variate data, with even less on dealing with outliers in these models. An approach for clustering matrix-variate normal data with outliers is discussed. The approach, which uses the distribution of subset log-likelihoods, extends the OCLUST algorithm to matrix-variate normal data and uses an iterative approach to detect and trim outliers.

stat.ML↗