D. Allendorf

activity

20212024

most citedParallel Global Edge Switching for the Uniform Sampling of Simple Graphs with Prescribed Degrees

4 citations · 5 across the 5 of their papers we have counts for

collaborators

Showing 2023Show all

2 papers · 1 filter

cs.DS2023

Uniform Generation of Temporal Graphs with Given Degrees

Daniel Allendorf

Uniform sampling from the set $G (d)$ of graphs with a given degree-sequence $d = (d_{1}, \dots, d_{n}) \in N^{n}$ is a classical problem in the study…

cs.DS2023★ 1 cited

Maintaining Discrete Probability Distributions in Practice

Daniel Allendorf

A classical problem in random number generation is the sampling of elements from a given discrete distribution. Formally, given a set of indices $S = {1, \dots, n}$ and sequence…