activity
20232026
most citedPlus Strategies are Exponentially Slower for Planted Optima of Random Height

2 citations · 7 across the 11 of their papers we have counts for

collaborators
Showing math.PRShow all

5 papers · 1 filter

math.PR2026

Degree-dependent and distance-dependent contact rates interpolate between explosive, exponential and polynomial epidemic growth

Zylan Benjert, Júlia Komjáthy, Johannes Lengler +2

It is a fundamental question in epidemiology to estimate, model and predict the growth rate of a pandemic. Analogously, analysing the diffusion of innovation, (fake) news, memes, a…

math.PR2024

Rumour Spreading Depends on the Latent Geometry and Degree Distribution in Social Network Models

Marc Kaufmann, Kostas Lakis, Johannes Lengler +3

We study push-pull rumour spreading in ultra-small-world models for social networks where the degrees follow a power-law distribution. In a non-geometric setting, Fountoulakis, Pan…

math.PR2024

Improved bounds for polylogarithmic graph distances in scale-free percolation and related models

Kostas Lakis, Johannes Lengler, Kalina Petrova +1

In this paper, we study graph distances in the geometric random graph models scale-free percolation SFP, geometric inhomogeneous random graphs GIRG, and hyperbolic random graphs HR…

math.PR2023★ 1 cited

Polynomial growth in degree-dependent first passage percolation on spatial random graphs

Júlia Komjáthy, John Lapinskas, Johannes Lengler +1

In this paper we study a version of (non-Markovian) first passage percolation on graphs, where the transmission time between two connected vertices is non-iid, but increases by a p…

math.PR2023★ 2 cited

Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs I

Júlia Komjáthy, John Lapinskas, Johannes Lengler +1

One-dependent first passage percolation is a spreading process on a graph where the transmission time through each edge depends on the direct surroundings of the edge. In particula…