3 papers
cs.DS2024
Efficient Uniform Negative Edge Weights
Lukas Geis, Daniel Allendorf, Thomas Bläsius +4
We consider a maximum entropy edge weight model that allows for negative weights. Given a graph and possible weights typically consisting of positive and negative…
cs.DS2023
Uniform Generation of Temporal Graphs with Given Degrees
Daniel Allendorf
Uniform sampling from the set of graphs with a given degree-sequence is a classical problem in the study…
cs.DS2021
Engineering Uniform Sampling of Graphs with a Prescribed Power-law Degree Sequence
Daniel Allendorf, Ulrich Meyer, Manuel Penschuck +2
We consider the following common network analysis problem: given a degree sequence return a uniform sample from the ensemble of all…