23 citations · 87 across the 20 of their papers we have counts for
5 papers · 1 filter
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…
Drift Analysis and Evolutionary Algorithms Revisited
Johannes Lengler, Angelika Steger
One of the easiest randomized greedy optimization algorithms is the following evolutionary algorithm which aims at maximizing a boolean function . The…
The (1+1) Elitist Black-Box Complexity of LeadingOnes
Carola Doerr, Johannes Lengler
One important goal of black-box complexity theory is the development of complexity models allowing to derive meaningful lower bounds for whole classes of randomized search heuristi…
Bootstrap percolation on geometric inhomogeneous random graphs
Christoph Koch, Johannes Lengler
Geometric inhomogeneous random graphs (GIRGs) are a model for scale-free networks with underlying geometry. We study bootstrap percolation on these graphs, which is a process model…
Average Distance in a General Class of Scale-Free Networks with Underlying Geometry
Karl Bringmann, Ralph Keusch, Johannes Lengler
In Chung-Lu random graphs, a classic model for real-world networks, each vertex is equipped with a weight drawn from a power-law distribution, and two vertices form an edge indepen…