activity
20142026
most citedThe interchange process with reversals on the complete graph

14 citations · 54 across the 14 of their papers we have counts for

collaborators

17 papers

math.PR2026

Infinite-mean Galton-Watson trees have zero random-interchange threshold

Andreas Klippel, Benjamin Lees, Christian Mönch

We prove that, on a Galton-Watson tree with almost surely finite offspring and infinite offspring mean, the random interchange process has critical parameter zero for infinite cycl…

math.PR2026

Rainbow percolation

Peter Gracar, Benjamin Lees

We consider the weight-dependent random connection model on a Poisson point process of intensity on in which the vertices and are joined…

math.PR2025

Loop vs. Bernoulli percolation on trees: strict inequality of critical values

Andreas Klippel, Benjamin Lees, Christian Mönch

We study loop ensembles on locally finite rooted trees. The loops are induced by a Poisson process of links on the edges; the transposition-only case is the random interchange proc…

math.PR2024

Combinatorial identities from an inhomogeneous Ising chain

Jessica Jay, Benjamin Lees

We study a family of inhomogeneous Ising chain models along with an equivalent family of nearest neighbour particle systems. By the correspondence between the two families we prove…

math.PR2022

Griffiths inequalities for the -spin model

Benjamin Lees

We prove Griffiths inequalities for the -spin model with inhomogeneous coupling constants and external magnetic field for any . This is achieved by using a represent…

math.PR2022

Correlation inequalities for the uniform 8-vertex model and the toric code model

Jakob E. Björnberg, Benjamin Lees

We elucidate connections between four models in statistical physics and probability theory: (1) the toric code model of Kitaev, (2) the uniform eight-vertex model, (3) random walk…