115 citations · 254 across the 43 of their papers we have counts for
52 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…
Decay of correlations and zeros for the hard-core model
Han Peters, Guus Regts, Josias Reppekus
In a recent paper the last author proved that absence of complex zeros of the partition function of the hard-core model near a parameter implies a form of correlation decay c…
On the complex zeros and the computational complexity of approximating the reliability polynomial
Ferenc Bencs, Chiara Piombi, Guus Regts
In this paper we relate the location of the complex zeros of the reliability polynomial to parameters at which a certain family of rational functions derived from the reliability p…
On zeros and algorithms for disordered systems: mean-field spin glasses
Ferenc Bencs, Brice Huang, Daniel Z. Lee +2
Spin glasses are fundamental probability distributions at the core of statistical physics, the theory of average-case computational complexity, and modern high-dimensional statisti…
Barvinok's interpolation method meets Weitz's correlation decay approach
Ferenc Bencs, Guus Regts
In this paper we take inspiration from Weit'z algorithm for approximating the independence polynomial to provide a new algorithm for computing the coefficients of the Taylor series…
Improved bounds on the zeros of the chromatic polynomial of graphs and claw-free graphs
Ferenc Bencs, Guus Regts
We prove that for any graph the (complex) zeros of its chromatic polynomial, , lie inside the disk centered at of radius , where denotes the maxim…