research
∙
05/04/2022
A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process
The semi-random graph process is a single player game in which the playe...
share
research
∙
12/28/2021
The full rank condition for sparse random matrices
We derive a sufficient condition for a sparse random matrix with given n...
research
∙
04/19/2021
Linear-time uniform generation of random sparse contingency tables with specified marginals
We give an algorithm that generates a uniformly random contingency table...
research
∙
05/09/2019
Fast uniform generation of random graphs with given degree sequences
In this paper we provide an algorithm that generates a graph with given ...
research
∙
10/17/2018
The rank of random matrices over finite fields
We determine the rank of a random matrix A over a finite field with pres...
research
∙
07/03/2018
Uniform generation of spanning regular subgraphs of a dense graph
Let H_n be a graph on n vertices and let H_n denote the complement of H_...
research
∙
10/20/2017
