Matthew Jenssen

activity

20152026

most citedOn the average size of independent sets in triangle-free graphs

41 citations · 162 across the 24 of their papers we have counts for

collaborators

Showing 2022Show all

3 papers · 1 filter

cs.DS2022

Quasipolynomial-time algorithms for Gibbs point processes

Matthew Jenssen, Marcus Michelen, Mohan Ravichandran

We demonstrate a quasipolynomial-time deterministic approximation algorithm for the partition function of a Gibbs point process interacting via a finite-range stable potential. Thi…

math.CO2022★ 1 cited

A robust Corrádi--Hajnal Theorem

Peter Allen, Julia Böttcher, Jan Corsten +5

For a graph $G$ and $p \in [0, 1]$ , we denote by $G_{p}$ the random sparsification of $G$ obtained by keeping each edge of $G$ independently, with probability $p$ . We show that there ex…

math.PR2022

The least singular value of a random symmetric matrix

Marcelo Campos, Matthew Jenssen, Marcus Michelen +1

Let $A$ be a $n \times n$ symmetric matrix with $(A_{i, j})_{i \leq j}$ , independent and identically distributed according to a subgaussian distribution. We show that $$\mathbb{P}(σ…