
Parallel Global Edge Switching for the Uniform Sampling of Simple Graphs with Prescribed Degrees
The uniform sampling of simple graphs matching a prescribed degree seque...
read it

Engineering Uniform Sampling of Graphs with a Prescribed Powerlaw Degree Sequence
We consider the following common network analysis problem: given a degre...
read it

Efficient and accurate group testing via Belief Propagation: an empirical study
The group testing problem asks for efficient pooling schemes and algorit...
read it

Simulating Population Protocols in SubConstant Time per Interaction
We consider the problem of efficiently simulating population protocols. ...
read it

Optimal group testing under real world restrictions
In the group testing problem one aims to infer a small set of k infected...
read it

Recent Advances in Scalable Network Generation
Random graph models are frequently used as a controllable and versatile ...
read it

The random 2SAT partition function
We show that throughout the satisfiable phase the normalised number of s...
read it

Bidirectional Text Compression in External Memory
Bidirectional compression algorithms work by substituting repeated subst...
read it

Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs
Hyperbolic random graphs (HRG) and geometric inhomogeneous random graphs...
read it

Fragile Complexity of ComparisonBased Algorithms
We initiate a study of algorithms with a focus on the computational comp...
read it

Parallel and I/Oefficient Randomisation of Massive Networks using Global Curveball Trades
Graph randomisation is an important task in the analysis and synthesis o...
read it
Manuel Penschuck
is this you? claim profile