Table of Contents
Fetching ...

Latent space models for grouped multiplex networks

Alexander Kagan, Peter W. MacDonald, Elizaveta Levina, Ji Zhu

TL;DR

GroupMultiNeSS addresses the challenge of uncovering group-level latent structure in clustered multiplex networks by decomposing node latent positions into a shared basis $V$, group-specific $W_k$, and layer-specific $U_{k\ell}$ components, with $X_{k\ell} = [V \; W_k \; U_{k\ell}]$ and $\\Theta_{k\ell}$ admitting a decomposed form via $I_{p,q}$ blocks. The authors develop a convex two-stage estimation procedure with nuclear-norm penalties, provide identifiability guarantees up to indefinite orthogonal rotations, and prove Gaussian-edge-consistency results with explicit error bounds, supported by synthetic experiments. They demonstrate improved modeling accuracy when accounting for group structure and apply the method to Parkinson's disease brain networks, revealing biologically interpretable group differences in latent space. The approach offers a scalable, flexible framework for analyzing complex hierarchical multiplex networks and can be extended to broader hierarchical, sub-Gaussian, and directed settings.

Abstract

Complex multilayer network datasets have become ubiquitous in various applications, including neuroscience, social sciences, economics, and genetics. Notable examples include brain connectivity networks collected across multiple patients or trade networks between countries collected across multiple goods. Existing statistical approaches to such data typically focus on modeling the structure shared by all networks; some go further by accounting for individual, layer-specific variation. However, real-world multilayer networks often exhibit additional patterns shared only within certain subsets of layers, which can represent treatment and control groups, or patients grouped by a specific trait. Identifying these group-level structures can uncover systematic differences between groups of networks and influence many downstream tasks, such as testing and low-dimensional visualization. To address this gap, we introduce the GroupMultiNeSS model, which enables the simultaneous extraction of shared, group-specific, and individual latent structures from a sample of networks on a shared node set. For this model, we establish identifiability, develop a fitting procedure using convex optimization in combination with a nuclear norm penalty, and prove a guarantee of recovery for the latent positions as long as there is sufficient separation between the shared, group-specific, and individual latent subspaces. We compare the model with MultiNeSS and other models for multiplex networks in various synthetic scenarios and observe an apparent improvement in the modeling accuracy when the group component is accounted for. Experiment with the Parkinson's disease brain connectivity dataset demonstrates the superiority of GroupMultiNeSS in highlighting node-level insights on biological differences between the treatment and control patient groups.

Latent space models for grouped multiplex networks

TL;DR

GroupMultiNeSS addresses the challenge of uncovering group-level latent structure in clustered multiplex networks by decomposing node latent positions into a shared basis , group-specific , and layer-specific components, with and admitting a decomposed form via blocks. The authors develop a convex two-stage estimation procedure with nuclear-norm penalties, provide identifiability guarantees up to indefinite orthogonal rotations, and prove Gaussian-edge-consistency results with explicit error bounds, supported by synthetic experiments. They demonstrate improved modeling accuracy when accounting for group structure and apply the method to Parkinson's disease brain networks, revealing biologically interpretable group differences in latent space. The approach offers a scalable, flexible framework for analyzing complex hierarchical multiplex networks and can be extended to broader hierarchical, sub-Gaussian, and directed settings.

Abstract

Complex multilayer network datasets have become ubiquitous in various applications, including neuroscience, social sciences, economics, and genetics. Notable examples include brain connectivity networks collected across multiple patients or trade networks between countries collected across multiple goods. Existing statistical approaches to such data typically focus on modeling the structure shared by all networks; some go further by accounting for individual, layer-specific variation. However, real-world multilayer networks often exhibit additional patterns shared only within certain subsets of layers, which can represent treatment and control groups, or patients grouped by a specific trait. Identifying these group-level structures can uncover systematic differences between groups of networks and influence many downstream tasks, such as testing and low-dimensional visualization. To address this gap, we introduce the GroupMultiNeSS model, which enables the simultaneous extraction of shared, group-specific, and individual latent structures from a sample of networks on a shared node set. For this model, we establish identifiability, develop a fitting procedure using convex optimization in combination with a nuclear norm penalty, and prove a guarantee of recovery for the latent positions as long as there is sufficient separation between the shared, group-specific, and individual latent subspaces. We compare the model with MultiNeSS and other models for multiplex networks in various synthetic scenarios and observe an apparent improvement in the modeling accuracy when the group component is accounted for. Experiment with the Parkinson's disease brain connectivity dataset demonstrates the superiority of GroupMultiNeSS in highlighting node-level insights on biological differences between the treatment and control patient groups.

Paper Structure

This paper contains 26 sections, 11 theorems, 118 equations, 9 figures, 2 algorithms.

Key Result

Proposition 2.1

Assume $\{f(\cdot;\theta, \phi), \ \theta \in \mathbb{R}\}$ is an identifiable parametric family and $\kappa(x, y) = \psi(x^\top I_{p, q}y)$ is an invertible function of the generalized inner product. Under the following conditions, parameters of the GroupMultiNeSS model with edge-entry distribution That is, under these conditions, if the probability distributions induced by two different paramete

Figures (9)

  • Figure 1: Latent space decomposition assumed by GroupMultiNeSS.
  • Figure 2: Dependency of ARFE on the key parameters of the Gaussian and Logistic GroupMultiNeSS models. Unless one of the parameters is varied, the networks are generated according to Algorithm \ref{['alg:sampling_procedure']} with $M=16$ layers on $n=200$ nodes, $K=4$ balanced groups, and $s_{v, w}=s_{w, u} = 0.1$.
  • Figure 3: Change in ARFE of $\Theta$ (upper row) and $S$ (lower row) with the increase of (left column) the number of nodes $n$ with $M=16$ and (right column) the number of layers $M$ with $n=200$. In all simulations, the number of groups is $K=4$ and the latent dimension is $d=3$. Layers are sampled from the Gaussian edge-entry model.
  • Figure 4: Group latent positions fitted with GroupMultiNeSS and plotted in the leading three latent dimensions (all disassortative).
  • Figure 5: Group latent positions obtained by fitting separate MultiNeSS models on the layers of the two groups and plotted in the leading three latent dimensions (all disassortative).
  • ...and 4 more figures

Theorems & Definitions (28)

  • Proposition 2.1
  • Remark 1
  • Remark 2
  • Remark 3
  • Remark 4
  • Proposition 3.1
  • Remark 5
  • Proposition 3.2
  • Theorem 4.1
  • Remark 6
  • ...and 18 more