Shuffling is the process of rearranging a sequence of elements into a ra...
Preferential attachment lies at the heart of many network models aiming ...
The abundance of massive network data in a plethora of applications make...
The uniform sampling of simple graphs matching a prescribed degree seque...
We consider the following common network analysis problem: given a degre...
The group testing problem asks for efficient pooling schemes and algorit...
We consider the problem of efficiently simulating population protocols. ...
In the group testing problem one aims to infer a small set of k infected...
Random graph models are frequently used as a controllable and versatile ...
We show that throughout the satisfiable phase the normalised number of
s...
Bidirectional compression algorithms work by substituting repeated subst...
Hyperbolic random graphs (HRG) and geometric inhomogeneous random graphs...
We initiate a study of algorithms with a focus on the computational
comp...
Graph randomisation is an important task in the analysis and synthesis o...