13 citations · 39 across the 12 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.DS2021★ 4 cited
Parallel Global Edge Switching for the Uniform Sampling of Simple Graphs with Prescribed Degrees
Daniel Allendorf, Ulrich Meyer, Manuel Penschuck +1
The uniform sampling of simple graphs matching a prescribed degree sequence is an important tool in network science, e.g. to construct graph generators or null-models. Here, the Ed…
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…
cs.AI2021★ 3 cited
Efficient and accurate group testing via Belief Propagation: an empirical study
AminCoja-Oghlan, Max Hahn-Klimroth, Philipp Loick +1
The group testing problem asks for efficient pooling schemes and algorithms that allow to screen moderately large numbers of samples for rare infections. The goal is to accurately…