12 papers
Phase transitions for contact processes on sparse random graphs via metastability and local limits
Benedikt Jahnel, Lukas Lüchtrath, Christian Mönch
We propose a new perspective on the asymptotic regimes of fast and slow extinction in the contact process on locally converging sequences of sparse finite graphs. We characterise t…
Cluster sizes in subcritical soft Boolean models
Benedikt Jahnel, Lukas Lüchtrath, Marcel Ortgiese
We consider the soft Boolean model, a model that interpolates between the Boolean model and long-range percolation, where vertices are given via a stationary Poisson point process.…
Convex order and faster transmission in first contact percolation
Benedikt Jahnel, Jonas Köppl, Lukas Lüchtrath +1
Inspired by strict-monotonicity criteria for the time constant in first passage percolation, we investigate convex ordering of point processes in relation to the time constant in f…
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…
Detection, coverage and percolation in dynamic Boolean models with random radii based on -stable processes
Peter Gracar, Benedikt Jahnel, Lukas Lüchtrath +1
We consider a dynamic network in continuum time and space in which nodes, with initial locations given by a Poisson point process, move according to i.i.d. isotropic -stable pr…