3 papers
math.PR2026
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…
cs.CC2026
Symmetric Parameterised Holants on Hypergraphs: Towards a Classification for Parameterised VCSPs
Panagiotis Aivasiliotis, Andreas Göbel, Marc Roth
We study the complexity of the parameterised counting constraint satisfaction problem: given a set of constraints over a set of variables and a positive integer , how many ways…
cs.CC2025
Parameterised Holant Problems
Panagiotis Aivasiliotis, Andreas Göbel, Marc Roth +1
We investigate the complexity of parameterised holant problems p- for families of signatures . The parameterised holant framework was int…