1 citations · 2 across the 12 of their papers we have counts for
5 papers · 1 filter
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…
Critical-curve regularity for finite-lifespan frog models via local-to-global comparisons
Christian Mönch, Andreas Klippel
We study the phase boundary of the finite-lifespan frog model. For rate-one continuous-time simple random walk on an infinite, connected, locally finite transitive graph of superli…
The one-point Schreier Poisson boundary of Thompson's group
Christian Mönch
We identify the Poisson boundary of the one-point Schreier-chain random walk obtained by projecting the simple symmetric random walk on Thompson's group to the dyadic orbit poi…
Maximising homomorphism counts between digraphs
Lukas Lüchtrath, Christian Mönch
We prove a Sidorenko-type inequality for directed trees: for every oriented tree on vertices and every finite directed graph , the homomorphism count hom is bound…
Age-dependent random connection models with arc reciprocity: clustering and connectivity
Lukas Lüchtrath, Christian Mönch
We introduce a model for directed spatial networks. Starting from an age-based preferential attachment model in which all arcs point from younger to older vertices, we add \emph{re…