7 papers
Random triangulations of the d-sphere with minimum volume
Agelos Georgakopoulos, John Haslegrave, Joel Larsson Danielsson
We study a higher-dimensional analogue of the {Random Travelling Salesman Problem}: let the complete -dimensional simplicial complex on vertices be equipped with i…
A concentration inequality for random combinatorial optimisation problems
Joel Larsson Danielsson
Given a finite set , i.i.d. random weights , and a family of subsets , we consider the minimum weight of an : \[ M(…
Minimal H-factors and covers
Lorenzo Federico, Joel Larsson Danielsson
Given a fixed small graph H and a larger graph G, an H-factor is a collection of vertex-disjoint subgraphs , each isomorphic to H, that cover the vertices of G. If G i…
Polarised random k-SAT
Joel Larsson Danielsson, Klas Markström
In this paper we study a variation of the random -SAT problem, called polarized random -SAT. In this model there is a polarization parameter , and in half of the clauses e…
Biased random k-SAT
Joel Larsson, Klas Markström
The basic random -SAT problem is: Given a set of Boolean variables, and clauses of size picked uniformly at random from the set of all such clauses on our variables,…
Speed and concentration of the covering time for structured coupon collectors
Victor Falgas-Ravry, Joel Larsson, Klas Markström
Let be an -set, and let be a random variable taking values in the powerset of . Suppose we are given a sequence of random coupons , where the …
The Minimum Perfect Matching in Pseudo-dimension
Joel Larsson
It is known that for equipped with i.i.d. edge costs, the minimum total cost of a perfect matching converges to in probability. Similar convergence has b…