Perfect Clustering in Very Sparse Diverse Multiplex Networks

• URL: http://arxiv.org/abs/2507.19423v1
• Date: Fri, 25 Jul 2025 16:43:42 GMT
• Title: Perfect Clustering in Very Sparse Diverse Multiplex Networks
• Authors: Marianna Pensky,
• Abstract summary: The paper studies the DIverse MultiPLEx Signed Generalized Random Dot Product Graph (DIMPLE-SGRDPG) network model (Pensky (2024)<n>All layers can be partitioned into groups such that the layers in the same group are embedded in the same ambient subspace.<n>The key task in this model is to recover the groups of layers with unique subspace structures.
• Score: 4.070200285321219
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The paper studies the DIverse MultiPLEx Signed Generalized Random Dot Product Graph (DIMPLE-SGRDPG) network model (Pensky (2024)), where all layers of the network have the same collection of nodes. In addition, all layers can be partitioned into groups such that the layers in the same group are embedded in the same ambient subspace but otherwise matrices of connection probabilities can be all different. This setting includes majority of multilayer network models as its particular cases. The key task in this model is to recover the groups of layers with unique subspace structures, since the case where all layers of the network are embedded in the same subspace has been fairly well studied. Until now, clustering of layers in such networks was based on the layer-per-layer analysis, which required the multilayer network to be sufficiently dense. Nevertheless, in this paper we succeeded in pooling information in all layers together and providing a tensor-based methodology that ensures perfect clustering for a much sparser network. Our theoretical results, established under intuitive non-restrictive assumptions, assert that the new technique achieves perfect clustering under sparsity conditions that, up to logarithmic factors, coincide with the computational lower bound derived for a much simpler model.

Related papers

• Signed Diverse Multiplex Networks: Clustering and Inference [4.070200285321219]
  The paper introduces a Signed Generalized Random Dot Product Graph (SGRDPG) model, where edges can be positive or negative.<n>The setting is extended to a multiplex version, where all layers have the same collection of nodes and follow the SGRDPG.<n>By employing novel methodologies, our paper ensures strongly consistent clustering of layers and highly accurate subspace estimation.
  arXiv  Detail & Related papers  (2024-02-14T19:37:30Z)
• Defining Neural Network Architecture through Polytope Structures of Dataset [53.512432492636236]
  This paper defines upper and lower bounds for neural network widths, which are informed by the polytope structure of the dataset in question. We develop an algorithm to investigate a converse situation where the polytope structure of a dataset can be inferred from its corresponding trained neural networks. It is established that popular datasets such as MNIST, Fashion-MNIST, and CIFAR10 can be efficiently encapsulated using no more than two polytopes with a small number of faces.
  arXiv  Detail & Related papers  (2024-02-04T08:57:42Z)
• Layer Ensembles [95.42181254494287]
  We introduce a method for uncertainty estimation that considers a set of independent categorical distributions for each layer of the network. We show that the method can be further improved by ranking samples, resulting in models that require less memory and time to run.
  arXiv  Detail & Related papers  (2022-10-10T17:52:47Z)
• Sparse Subspace Clustering in Diverse Multiplex Network Model [4.56877715768796]
  The paper considers the DIverse MultiPLEx (DIMPLE) network model, where all layers of the network have the same collection of nodes and are equipped with the Block Models. The DIMPLE model generalizes a multitude of papers that study multilayer networks with the same community structures in all layers. The present paper uses Sparse Subspace Clustering (SSC) for identifying groups of layers with identical community structures.
  arXiv  Detail & Related papers  (2022-06-15T15:32:23Z)
• DeepCluE: Enhanced Image Clustering via Multi-layer Ensembles in Deep Neural Networks [53.88811980967342]
  This paper presents a Deep Clustering via Ensembles (DeepCluE) approach. It bridges the gap between deep clustering and ensemble clustering by harnessing the power of multiple layers in deep neural networks. Experimental results on six image datasets confirm the advantages of DeepCluE over the state-of-the-art deep clustering approaches.
  arXiv  Detail & Related papers  (2022-06-01T09:51:38Z)
• Clustering multilayer graphs with missing nodes [4.007017852999008]
  Clustering is a fundamental problem in network analysis where the goal is to regroup nodes with similar connectivity profiles. We propose a new framework that allows for layers to be defined on different sets of nodes.
  arXiv  Detail & Related papers  (2021-03-04T18:56:59Z)
• ALMA: Alternating Minimization Algorithm for Clustering Mixture Multilayer Network [20.888592224540748]
  The goal is to partition the multilayer network into clusters of similar layers, and to identify communities in those layers. The present paper proposes a different technique, an alternating minimization algorithm (ALMA) that aims at simultaneous recovery of the layer partition.
  arXiv  Detail & Related papers  (2021-02-20T01:26:55Z)
• Global and Individualized Community Detection in Inhomogeneous Multilayer Networks [14.191073951237772]
  In network applications, it has become increasingly common to obtain datasets in the form of multiple networks observed on the same set of subjects. Such datasets can be modeled by multilayer networks where each layer is a separate network itself while different layers are associated and share some common information. The present paper studies community detection in a stylized yet informative inhomogeneous multilayer network model.
  arXiv  Detail & Related papers  (2020-12-02T02:42:52Z)
• Dual-constrained Deep Semi-Supervised Coupled Factorization Network with Enriched Prior [80.5637175255349]
  We propose a new enriched prior based Dual-constrained Deep Semi-Supervised Coupled Factorization Network, called DS2CF-Net. To ex-tract hidden deep features, DS2CF-Net is modeled as a deep-structure and geometrical structure-constrained neural network. Our network can obtain state-of-the-art performance for representation learning and clustering.
  arXiv  Detail & Related papers  (2020-09-08T13:10:21Z)
• DC-NAS: Divide-and-Conquer Neural Architecture Search [108.57785531758076]
  We present a divide-and-conquer (DC) approach to effectively and efficiently search deep neural architectures. We achieve a $75.1%$ top-1 accuracy on the ImageNet dataset, which is higher than that of state-of-the-art methods using the same search space.
  arXiv  Detail & Related papers  (2020-05-29T09:02:16Z)
• Fitting the Search Space of Weight-sharing NAS with Graph Convolutional Networks [100.14670789581811]
  We train a graph convolutional network to fit the performance of sampled sub-networks. With this strategy, we achieve a higher rank correlation coefficient in the selected set of candidates.
  arXiv  Detail & Related papers  (2020-04-17T19:12:39Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.