Journal article · 2026 · Open access

Degree-Preserving Randomization Methods for Network Analysis: Models, Algorithms, and Applications

Bart De Clerck, Filip Van Utterbeeck, Luis E. C. Rocha

ACM Computing Surveys, 59(1), 1–34 · Published 30 October 2026 · DOI 10.1145/3842740

Open PDFView at the publisherCite this paper

In brief

“Degree-Preserving Randomization Methods for Network Analysis: Models, Algorithms, and Applications” is a 2026 journal article by Bart De Clerck and 2 co-authors, published in ACM Computing Surveys. OpenAlex counts 1 citations as of 17 November 2026, which puts it in the top 9% of works published in 2026 by citations. It is open access under a CC BY licence: the full text is free to read at ACM Computing Surveys.

Citations
1
Most cited in
2026 (1)
Field-weighted impact
1.54
References
106
Authors
3

Abstract

Graph randomization techniques are essential tools for network analysis, enabling researchers to assess the statistical significance of observed network properties and distinguish meaningful patterns from random fluctuations. However, the wide range of available methods and tools can create confusion, particularly regarding their assumptions, biases, and applicability. This survey provides a review of graph randomization approaches, with a focus on degree preserving methods implemented in popular software tools such as graph-tool, igraph, MaxEntropyGraphs.jl, NEMtropy, Networkit, NetworkX, and statnet/ergm. We evaluate these methods through case studies spanning undirected, directed, and bipartite graphs. Our findings reveal notable discrepancies in outcomes depending on the chosen randomization method: certain stub-matching implementations can introduce systematic degree biases, default MCMC iteration counts can be both insufficient and vastly excessive, and the assumption of normally distributed metrics can lead to incorrect significance assessments. We benchmark computational scaling across graph sizes ranging from 10 3 to 10 5 nodes, apply a systematic convergence diagnostics procedure to MCMC-based methods, and synthesize our findings into actionable tool selection guidance. Practical guidelines for method selection and recommendations to enhance reproducibility and transparency in network analysis are provided.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

De Clerck, B., Van Utterbeeck, F., & Rocha, L. E. C. (2026). Degree-Preserving Randomization Methods for Network Analysis: Models, Algorithms, and Applications. ACM Computing Surveys, 59(1), 1–34. https://doi.org/10.1145/3842740

MLA 9

De Clerck, Bart, et al. “Degree-Preserving Randomization Methods for Network Analysis: Models, Algorithms, and Applications.” ACM Computing Surveys, vol. 59, no. 1, 2026, pp. 1–34. https://doi.org/10.1145/3842740.

Chicago

De Clerck, Bart, Filip Van Utterbeeck, and Luis E. C. Rocha. 2026. “Degree-Preserving Randomization Methods for Network Analysis: Models, Algorithms, and Applications.” ACM Computing Surveys 59 (1): 1–34. https://doi.org/10.1145/3842740.

Harvard

De Clerck, B., Van Utterbeeck, F. and Rocha, L. E. C. (2026) ‘Degree-Preserving Randomization Methods for Network Analysis: Models, Algorithms, and Applications’, ACM Computing Surveys, 59(1), pp. 1–34. doi:10.1145/3842740.

IEEE

B. De Clerck, F. Van Utterbeeck, and L. E. C. Rocha, “Degree-Preserving Randomization Methods for Network Analysis: Models, Algorithms, and Applications,” ACM Computing Surveys, vol. 59, no. 1, pp. 1–34, 2026, doi: 10.1145/3842740.

BibTeX

@article{declerck2026degree,
  title     = {{Degree-Preserving Randomization Methods for Network Analysis: Models, Algorithms, and Applications}},
  author    = {De Clerck, Bart and Van Utterbeeck, Filip and Rocha, Luis E. C.},
  journal   = {ACM Computing Surveys},
  year      = {2026},
  volume    = {59},
  number    = {1},
  pages     = {1--34},
  doi       = {10.1145/3842740},
  url       = {https://doi.org/10.1145/3842740}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques

  • network analysis
  • stub matching
  • MCMC convergence diagnostics
  • directed graphs
  • bipartite graphs
  • reproducibility

Work with this paper

Most-cited papers in Physics and Astronomy

All highly cited Physics and Astronomy papers

Questions about this paper

How do I cite this paper in APA style?

De Clerck, B., Van Utterbeeck, F., & Rocha, L. E. C. (2026). Degree-Preserving Randomization Methods for Network Analysis: Models, Algorithms, and Applications. ACM Computing Surveys, 59(1), 1–34. https://doi.org/10.1145/3842740

How many times has this paper been cited?

1 times, according to OpenAlex on 17 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at ACM Computing Surveys: sign in and open the PDF from this page.

Who wrote this paper?

Bart De Clerck, Filip Van Utterbeeck, Luis E. C. Rocha.

What is the DOI of this paper?

10.1145/3842740, permanently at https://doi.org/10.1145/3842740. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 17 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.