3 papers
cs.SI2026
Higher-order rich clubs and configuration models on general directed hypergraphs
Jason P. Smith, Celia Hacker, Jānis Lazovskis +3
Detecting structure in complex networks, especially those arising from physical systems, is a central problem across the sciences. One approach is via rich club analysis, which ide…
math.CO2025
Monotonically Decreasing the Number of Directed 3-Cycles via Edge-Flips?
David Bom, Florian Unger, Birgit Vogtenhuber
We investigate a combinatorial reconfiguration problem on oriented graphs, where a reconfiguration step (edge-flip) is the inversion of the orientation of a single edge. A recently…
math.ST2023
MCMC Sampling of Directed Flag Complexes with Fixed Undirected Graphs
Florian Unger, Jonathan Krebs
Constructing null models to test the significance of extracted information is a crucial step in data analysis. In this work, we provide a uniformly sampleable null model of directe…