Matthew Jenssen

activity

20172021

most citedThe singularity probability of a random symmetric matrix is exponentially small

1 citations · 1 across the 2 of their papers we have counts for

collaborators

9 papers

cs.DS2021

Approximately counting independent sets in bipartite graphs via graph containers

Matthew Jenssen, Will Perkins, Aditya Potukuchi

By implementing algorithmic versions of Sapozhenko's graph container methods, we give new algorithms for approximating the number of independent sets in bipartite graphs. Our first…

math.PR2021★ 1 cited

The singularity probability of a random symmetric matrix is exponentially small

Marcelo Campos, Matthew Jenssen, Marcus Michelen +1

Let $A$ be drawn uniformly at random from the set of all $n \times n$ symmetric matrices with entries in ${- 1, 1}$ . We show that \[ \mathbb{P}( \det(A) = 0 ) \leq e^{-cn},\] where…

math.PR2020

Singularity of random symmetric matrices revisited

Marcelo Campos, Matthew Jenssen, Marcus Michelen +1

Let $M_{n}$ be drawn uniformly from all $\pm 1$ symmetric $n \times n$ matrices. We show that the probability that $M_{n}$ is singular is at most $exp (- c (n lo g n)^{1/2})$ , which repre…

math.CO2020

Homomorphisms from the torus

Matthew Jenssen, Peter Keevash

We present a detailed probabilistic and structural analysis of the set of weighted homomorphisms from the discrete torus $Z_{m}^{n}$ , where $m$ is even, to any fixed graph: we…

math.CO2019

Distinct degrees in induced subgraphs

Matthew Jenssen, Peter Keevash, Eoin Long +1

An important theme of recent research in Ramsey theory has been establishing pseudorandomness properties of Ramsey graphs. An $N$ -vertex graph is called $C$ -Ramsey if it has no hom…

math.CO2018

The multicolour size-Ramsey number of powers of paths

Jie Han, Matthew Jenssen, Yoshiharu Kohayakawa +2

Given a positive integer $s$ , a graph $G$ is $s$ -Ramsey for a graph $H$ , denoted $G \to (H)_{s}$ , if every $s$ -colouring of the edges of $G$ contains a monochromatic copy of $…