6 citations · 9 across the 4 of their papers we have counts for
Showing math.PRShow all
2 papers · 1 filter
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
When Does Hillclimbing Fail on Monotone Functions: An entropy compression argument
Johannes Lengler, Anders Martinsson, Angelika Steger
Hillclimbing is an essential part of any optimization algorithm. An important benchmark for hillclimbing algorithms on pseudo-Boolean functions are (s…