1 citations · 1 across the 4 of their papers we have counts for
7 papers
On the self-intersection time of non-backtracking random walks
Ferenc Bencs, Leslie Ann Goldberg, Matthew Jenssen +4
We study the self-intersection time of the non-backtracking random walk on connected undirected graphs. For every fixed we show that the expected self-intersection time i…
Uniqueness, analyticity and mixing for Gibbs point processes via spectral gaps
Andreas Göbel, Matthew Jenssen, Marcus Michelen +3
A Gibbs point process models particles interacting in the continuum through a potential. Among the most classical examples is the hard-sphere model, where given an activity paramet…
A simple proof of rapid mixing on random regular graphs beyond uniqueness
Andreas Göbel, Matthew Jenssen, Marcus Michelen +3
A recent breakthrough of Chen, Chen, Chen, Yin, and Zhang shows rapid mixing for Glauber dynamics for the hard-core model on random regular graphs beyond the tree uniqueness thresh…
A robust Corrádi--Hajnal Theorem
Peter Allen, Julia Böttcher, Jan Corsten +5
For a graph and , we denote by the random sparsification of obtained by keeping each edge of independently, with probability . We show that there ex…
Non-existence probabilities and lower tails in the critical regime via Belief Propagation
Matthew Jenssen, Will Perkins, Aditya Potukuchi +1
We compute the logarithmic asymptotics of the non-existence probability (and more generally the lower-tail probability) for a wide variety of combinatorial problems for a range of…
On the evolution of structure in triangle-free graphs
Matthew Jenssen, Will Perkins, Aditya Potukuchi
We study the typical structure and the number of triangle-free graphs with vertices and edges where is large enough so that a typical triangle-free graph has a cut cont…