---
title: Degree-Corrected Stochastic Block Models
url: https://www.emergentmind.com/topics/degree-corrected-sbms
type: topic
---

# Degree-Corrected Stochastic Block Models

The degree-corrected stochastic block model (DC-SBM) is a broad generalization of the traditional stochastic block model (SBM) designed to capture community structure in networks exhibiting within-group degree heterogeneity. DC-SBMs introduce node-specific degree parameters while retaining the latent community structure of classic block models, enabling accurate modeling and detection of communities in networks where empirical degree distributions are heavy-tailed, heterogeneous, or systematically distinct within blocks [1008.3926].

## 1. Model Specification and Identifiability

Formally, a DC-SBM on $n$ nodes with $K$ communities consists of the following generative process:

- Each node $i$ is assigned a block $z_i \in \{1, \ldots, K\}$.
- Each node is endowed with a latent positive degree parameter $\theta_i > 0$.
- The block-connectivity matrix $B \in \mathbb{R}_+^{K \times K}$ is symmetric and full rank.
- For $i < j$, edges $A_{ij}$ are independent with
  $$
  \mathbb{E}[A_{ij}] = \theta_i \theta_j B_{z_i, z_j}
  $$
  or $A_{ij} \sim \mathrm{Poisson}(\theta_i \theta_j B_{z_i,z_j})$ in the multi-edge regime.

Identifiability of $(z, \theta, B)$ is ensured up to permutation and community-wise scaling if every community contains at least three nodes, under the constraint $\sum_{i:z_i=k}\theta_i=1$ for each $k$ [2412.03833]. The only remaining freedom is a scaling factor per community and a relabeling of the communities; for most purposes, community labels are considered equivalent under permutation.

## 2. Model Rationale and Statistical Properties

Classical SBMs assume all nodes in a community are stochastically equivalent, which leads to poor fit and misleading inference on empirical networks with broad degree distributions or hubs. DC-SBM explicitly models degree variation within blocks via node-specific parameters. This modification corrects the tendency of uncorrected SBMs to partition nodes by degree rather than true community [1008.3926, 1110.3854].

Key theoretical properties include:

- **Likelihood Decomposition and Profile Likelihood:** The log-likelihood for a given partition can be written as
  $$
  \mathcal{L}_\mathrm{DC}(G|z) = \sum_{r,s} m_{rs} \ln\left( \frac{m_{rs}}{\kappa_r \kappa_s} \right)
  $$
  where $m_{rs}$ is the summed edge count between blocks $r,s$, and $\kappa_r$ is the total degree of nodes in block $r$ [1008.3926].
- **Consistency of Community Recovery:** Likelihood-based community assignments under DC-SBM are consistent under very mild conditions—specifically, when the expected degree diverges ($\lambda_n \to \infty$) and without further constraints on the block parameters or node degrees [1110.3854].
- **Consistency for Number of Communities:** Penalized likelihood criteria targeting the number of communities are strongly consistent under semi-sparse to dense regimes, with penalties that account both for block parameters and the node-specific degree sequence [2302.03734, 1809.01028].

## 3. Algorithmic Paradigms

Methods for inference in DC-SBMs include likelihood maximization, spectral clustering, convex relaxation, and Bayesian inference.

### Likelihood Maximization

- The classical heuristic for maximizing the profile likelihood is a local, iterative algorithm akin to the Kernighan–Lin method: nodes are reassigned to new communities to maximize the objective, with best-prefix rollback to escape poor local maxima. This procedure achieves robust performance and directly optimizes the theoretically justified criterion [1008.3926].

### Spectral Methods

- **Normalized or Regularized Laplacian:** Spectral clustering methods for DC-SBM use the normalized Laplacian $L = D^{-1/2} A D^{-1/2}$ or its regularized variant. The top $K$ eigenvectors are embedded and input to $K$-means; row normalization is essential to remove the "star-shape" caused by degree heterogeneity [2104.10347, 1309.4111].
- **Consistent Recovery and Min-Degree:** Recovery is strongly consistent provided the minimum expected degree grows at least logarithmically (with regularization, no strict lower bound is required) [1710.06191, 1309.4111].

### Convex and SDP Relaxations

- **Convexified Modularity Maximization:** The modularity objective is adapted to the degree-corrected setting and relaxed to an SDP, followed by $k$-median or $k$-means rounding. Theoretical guarantees cover both exact and approximate recovery, and the method achieves optimal rates even for bounded-degree regimes [1512.08425].
- **Outlier-Robust Extensions:** SDP relaxations with additional node-wise penalties can exactly recover communities even in the presence of adversarial outliers and heavy-tailed degree distributions [1906.03305].

### Bayesian Approaches

- **Nonparametric Bayesian DC-SBM:** Infinite (Dirichlet process) versions of the DC-SBM automatically infer the number of clusters and the degree of correction, with analytical posterior updates for the conjugate construction [1311.2520].
- **Logistic Link/Polya-Gamma Augmentation:** Bayesian logistic DC-SBM with node-wise additive parameters and Polya–Gamma augmentation allows for fully sampled inference and principled centroid estimators that address label-switching [1309.4796].

## 4. Statistical Theory: Hierarchies, Generalizations, and Limits

DC-SBM sits within a hierarchy of random graph models:

- **SBM $\subset$ DC-SBM $\subset$ PABM (Popularity Adjusted Block Model):** Degree correction is a single scalar per node (PLD-SBM introduces a prior to approximate power-laws), while PABM allows for connection probabilities to depend on both sender and receiver clusters (requiring $nK$ parameters) [2002.02610, 1904.05335].
- **Nested Block Models:** Intermediate forms between DC-SBM and PABM allow hierarchical mixtures, controlling the parameter complexity [2002.02610].

For multi-layer networks, DC-SBM extensions enable inference and Gaussian asymptotics for layer-specific connectivity matrices, supporting hypothesis testing and confidence intervals for link intensities across layers [2406.11152].

## 5. Information-Theoretic and Probabilistic Limits

There exist fundamental detectability limitations in sparse DC-SBMs:

- **Non-Reconstruction Threshold:** Reconstruction of communities is information-theoretically impossible when
  $$
  (a-b)^2 \Phi^{(2)} \leq q(a+b)
  $$
  where $a$ and $b$ parameterize the within- and between-block connection probabilities, $q$ is the number of communities, and $\Phi^{(2)}$ is the second moment of the degree distribution. In this regime, even the mutual information between any algorithmic estimate and the planted assignment vanishes asymptotically [1511.00546].
- **Local Weak Limits and Branching Process Coupling:** Sparse DC-SBM local neighborhoods converge to multi-type Galton–Watson trees, with component structures rigorously characterized via breadth-first walks and excursion representations [1511.00546, 2409.18894].
- **Reduction to Wigner-Type Ensembles:** Random matrix theory can be leveraged for community detection and testing by centering and scaling the adjacency matrix to a standardized Wigner form, allowing for explicit significance control and spectral hypothesis testing in block models with degree correction [2312.03900].

## 6. Empirical Performance and Applications

Extensive empirical evidence demonstrates the necessity of DC-SBM when degree variation is present:

- On synthetic and real networks (e.g., political blogs, social networks), DC-SBMs substantially outperform non-degree-corrected models, which otherwise cluster by degree instead of community labels [1008.3926, 1512.08425, 1904.05335].
- Degree correction is only statistically necessary when substantial within-community heterogeneity exists; otherwise, standard SBMs perform similarly but involve estimating fewer parameters [1110.3854, 1311.2520].

DC-SBM is used for unsupervised community detection, model selection (number of communities), link prediction, hypothesis testing concerning network structure, and for robust recovery in contaminated or adversarial settings.

## 7. Model Extensions, Open Problems, and Hierarchies

DC-SBM forms the basis for a range of advanced models:

- **Power-law and Heavy-tailed Extensions:** PLD-SBM and Bayesian DC-SBM variants use explicit priors or parameterizations to ensure scale-free structure in the degree sequence [1904.05335, 1311.2520].
- **Cascading and Multi-layer Extensions:** Statistical inference for layered networks and time-varying settings generalize naturally via scalable spectral and variance-adjusted procedures [2406.11152].
- **Open Directions:** Challenges include optimal algorithms for ultra-sparse regimes, sharper non-reconstructibility phases, robust scalable inference for massive graphs, and information-theoretic limits in the presence of adversarial or dynamic contamination [1511.00546, 1906.03305].

Practical recommendations emphasize using DC-SBM when empirical degrees are heterogeneous, leveraging model selection criteria tailored for degree-corrected settings, and employing spectral or convexified clustering methods with regularization and row normalization. For model-based inference, either direct likelihood maximization or conjugate Bayesian methods can be employed, with the choice guided by application needs and network scale.

Source: https://www.emergentmind.com/topics/degree-corrected-sbms