Dataset

Synthetic Uniform, Easy

Uniform random matching synthetic benchmark with easy connectivity.

Bipartite incidence pattern for Synthetic Uniform, Easy

Graph Summary

Designed to be easy for iterative HDFE residualization.

The primary benchmark graph is built from unique (id1, id2) pairs. The figure shows a binned sparsity pattern of the bipartite incidence block, with both partitions relabeled to contiguous integer identifiers. This block is the off-diagonal part of the corresponding graph Laplacian.

500,000rows
475,566unique edges
216,007id1 levels
20id2 levels
1components
216,027nodes

Variables

Columns in the clean CSV:

id1 id2 x1 x2 y

The v1 graph uses id1 and id2. No additional identifier-like columns are included in this clean v1 CSV.

Source Notes

Generated by the synthetic uniform-matching benchmark scripts included with this collection.

Uniform random matching benchmark with relatively easy connectivity.

Creation Files

The synthetic data-generating files are included for researchers who want to inspect or adapt the construction.

Historical Benchmark

2017 SEC benchmark timings for this dataset, in seconds:

MethodCitationSeconds
MAP-Aitken (Guimaraes 2012) 7.4
MAP-SD (Gaure 2013) 5.0
MAP-CG-Sym (Correia 2016) 4.9
MAP+Prune (Correia 2016) 16.8
LSMR (Gomez 2016) 10.4