research
∙
11/13/2022
Parallel and I/O-Efficient Algorithms for Non-Linear Preferential Attachment
Preferential attachment lies at the heart of many network models aiming ...
share
research
∙
10/24/2022
Certifying Induced Subgraphs in Large Graphs
We introduce I/O-optimal certifying algorithms for bipartite graphs, as ...
research
∙
11/04/2021
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...
research
∙
10/28/2021
Engineering Uniform Sampling of Graphs with a Prescribed Power-law Degree Sequence
We consider the following common network analysis problem: given a degre...
research
∙
05/07/2020
Simulating Population Protocols in Sub-Constant Time per Interaction
We consider the problem of efficiently simulating population protocols. ...
research
∙
03/02/2020
Recent Advances in Scalable Network Generation
Random graph models are frequently used as a controllable and versatile ...
research
∙
05/16/2019
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs
Hyperbolic random graphs (HRG) and geometric inhomogeneous random graphs...
research
∙
01/09/2019
Fragile Complexity of Comparison-Based Algorithms
We initiate a study of algorithms with a focus on the computational comp...
research
∙
04/23/2018