Joel Larsson Danielsson

collaborators

2 papers

math.PR2024

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 $d$ -dimensional simplicial complex $K_{n}^{d}$ on $n$ vertices be equipped with i…

math.CO2024

A concentration inequality for random combinatorial optimisation problems

Joel Larsson Danielsson

Given a finite set $S$ , i.i.d. random weights ${X_{i}}_{i \in S}$ , and a family of subsets $F \subseteq 2^{S}$ , we consider the minimum weight of an $F \in F$ : \[ M(…