8 citations · 33 across the 25 of their papers we have counts for
6 papers · 1 filter
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…
Near optimal bounds for weak and strong spatial mixing for the anti-ferromagnetic Potts model on trees
Ferenc Bencs, Khallil Berrekkal, Guus Regts
We show that the anti-ferromagnetic Potts model on trees exhibits strong spatial mixing for a near-optimal range of parameters. Our work complements recent results of Chen, Liu, Ma…
Uniqueness of the Gibbs measure for the anti-ferromagnetic Potts model on the infinite -regular tree for large
Ferenc Bencs, David de Boer, Pjotr Buys +1
In this paper we prove that for any integer , the anti-ferromagnetic -state Potts model on the infinite -regular tree has a unique Gibbs measure for all edge interac…
Factor-of-iid balanced orientation of non-amenable graphs
Ferenc Bencs, Aranka Hrušková, László Márton Tóth
We show that if a non-amenable, quasi-transitive, unimodular graph has all degrees even then it has a factor-of-iid balanced orientation, meaning each vertex has equal in- and…
Factor-of-iid Schreier decorations of lattices in Euclidean spaces
Ferenc Bencs, Aranka Hrušková, László Márton Tóth
A Schreier decoration is a combinatorial coding of an action of the free group on the vertex set of a -regular graph. We investigate whether a Schreier decoration exists…
Atoms of the matching measure
Ferenc Bencs, András Mészáros
We prove that the matching measure of an infinite vertex-transitive connected graph has no atoms. Generalizing the results of Salez, we show that for an ergodic non-amenable unimod…