activity
20122026
most citedProof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments

31 citations · 62 across the 15 of their papers we have counts for

collaborators
Showing math.PRShow all

8 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.PR2026

The Instability of all Backoff Protocols

Leslie Ann Goldberg, John Lapinskas

In this paper we prove Aldous's conjecture from 1987 that there is no backoff protocol that is stable for any positive arrival rate. The setting is a communication channel for coor…

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…

math.PR2020★ 2 cited

Stopping explosion by penalising transmission to hubs in scale-free spatial random graphs

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

We study the spread of information in finite and infinite inhomogeneous spatial random graphs. We assume that each edge has a transmission cost that is a product of an i.i.d. rando…

math.PR2018

Phase Transitions of the Moran Process and Algorithmic Consequences

Leslie Ann Goldberg, John Lapinskas, David Richerby

The Moran process is a random process that models the spread of genetic mutations through graphs. If the graph is connected, the process eventually reaches "fixation", where every…

math.PR2016

Asymptotically Optimal Amplifiers for the Moran Process

Leslie Ann Goldberg, John Lapinskas, Johannes Lengler +3

We study the Moran process as adapted by Lieberman, Hauert and Nowak. This is a model of an evolving population on a graph or digraph where certain individuals, called "mutants" ha…

math.PR2015

Amplifiers for the Moran Process

Andreas Galanis, Andreas Göbel, Leslie Ann Goldberg +2

The Moran process, as studied by Lieberman, Hauert and Nowak, is a randomised algorithm modelling the spread of genetic mutations in populations. The algorithm runs on an underlyin…