3 papers
math.PR2025
Direct Paths in the Temporal Hypercube
Austin Eide, Martijn Gösgens, Paweł Prałat
We consider the -dimensional random temporal hypercube, i.e., the -dimensional hypercube graph with its edges endowed with i.i.d. continuous random weights. We say that a ver…
cs.SI2025
Multilayer Artificial Benchmark for Community Detection (mABCD)
Łukasz Kraiński, Michał Czuba, Piotr Bródka +3
One of the most persistent challenges in network science is the development of various synthetic graph models to support subsequent analyses. Among the most notable frameworks addr…
math.CO2025
Playing Sudoku on random 3-regular graphs
Jack Dippel, Austin Eide, Pawel Pralat +1
The Sudoku number of graph with chromatic number is the smallest partial -colouring of that determines a unique -colouring of the entire graph. We…