OmniMatch provably and asymptotically perfectly aligns unseeded vertices across independent random dot product graphs using only a seed set and shared latent structure, with no edge correlation.
Community Detection on Mixture Multi-layer Networks via Regularized Tensor Decomposition
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We study the problem of community detection in multi-layer networks, where pairs of nodes can be related in multiple modalities. We introduce a general framework, i.e., mixture multi-layer stochastic block model (MMSBM), which includes many earlier models as special cases. We propose a tensor-based algorithm (TWIST) to reveal both global/local memberships of nodes, and memberships of layers. We show that the TWIST procedure can accurately detect the communities with small misclassification error as the number of nodes and/or the number of layers increases. Numerical studies confirm our theoretical findings. To our best knowledge, this is the first systematic study on the mixture multi-layer networks using tensor decomposition. The method is applied to two real datasets: worldwide trading networks and malaria parasite genes networks, yielding new and interesting findings.
citation-role summary
citation-polarity summary
fields
stat.ML 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)
OmniMatch provably and asymptotically perfectly aligns unseeded vertices across independent random dot product graphs using only a seed set and shared latent structure, with no edge correlation.