Data and code underlying the publications: 'Configuration models for random directed hypergraphs' and 'Hypercurveball algorithm for sampling hypergraphs with fixed degrees'

This folder contains the code and data used to compare the performance of two algorithms for generating random hypergraphs with prescribed degree sequences. The comparison is conducted by simulating and analyzing the mixing time of each algorithm.Specifically, the folder includes:Python scripts (.py) for generating random directed or undirected hypergraphs using either the Hypercurveball algorithm or the Hyperedge-shuffle algorithm.A Python script (.py) for analyzing the mixing time of each algorithm. For each algorithm, this script outputs a .csv file that contains the perturbation degree at each step of the simulation.25 hypergraph datasets (.csv), containing both undirected and directed hypergraphs.For each dataset: perturbation degree files (.csv), containing the perturbation degree value at each step of a simulation, for both algorithms. Each algorithm is simulated either 10 or 100 times per dataset.A Python script (.py) for computing various statistics of a hypergraph.<br>The folder accompanies these papers:- Yanna J. Kraakman and Clara Stegehuis (2024). Configuration models for random directed hypergraphs. arXiv:2402.06466.- Yanna J. Kraakman and Clara Stegehuis (2024). Hypercurveball algorithm for sampling hypergraphs with fixed degrees. arXiv:2412.05100