1 citations · 1 across the 3 of their papers we have counts for
3 papers
math.PR2026
Recurrence of strong-decay inhomogeneous long-range percolation clusters
Johannes Bäumler, Lukas Lüchtrath, Christian Mönch
We prove recurrence criteria for inhomogeneous long-range percolation in dimensions one and two. In dimension one, recurrence follows from a purely geometric scarcity condition: lo…
math.PR2024
Subcritical annulus crossing in spatial random graphs
Emmanuel Jacob, Benedikt Jahnel, Lukas Lüchtrath
We consider general continuum percolation models obeying sparseness, translation invariance, and spatial decorrelation. In particular, this includes models constructed on general p…
math.CO2024★ 1 cited
A very short proof of Sidorenko's inequality for counts of homomorphism between graphs
Lukas Lüchtrath, Christian Mönch
We provide a very elementary proof of a classical extremality result due to Sidorenko (Discrete Math. 131.1-3, 1994), which states that among all connected graphs on vertic…