3 papers
math.PR2020
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.CO2012
Optimal packings of Hamilton cycles in graphs of high minimum degree
Daniela Kühn, John Lapinskas, Deryk Osthus
We study the number of edge-disjoint Hamilton cycles one can guarantee in a sufficiently large graph G on n vertices with minimum degree d = (1/2+a)n. For any constant a > 0, we gi…