Johannes Lengler

Geometric Inhomogeneous Random Graphs

Real-world networks, like social networks or the internet infrastructure, have structural properties such as their large clustering coefficient that can best be described in terms of an underlying geometry. This is why the focus of the literature on theoretical models for real-world networks shifted from classic models without geometry, such as Chung-Lu random graphs, to modern geometry-based models, such as hyperbolic random graphs. With this paper we contribute to the theoretical analysis of these modern, more realistic random graph models. However, we do not directly study hyperbolic random graphs, but replace them by a more general model that we call \emph{geometric inhomogeneous random graphs} (GIRGs). Since we ignore constant factors in the edge probabilities, our model is technically simpler (specifically, we avoid hyperbolic cosines), while preserving the qualitative behaviour of hyperbolic random graphs, and we suggest to replace hyperbolic random graphs by our new model in future theoretical studies. We prove the following fundamental structural and algorithmic results on GIRGs. (1) We provide a sampling algorithm that generates a random graph from our model in expected linear time, improving the best-known sampling algorithm for hyperbolic random graphs by a factor

Elitist Black-Box Models: Analyzing the Impact of Elitist Selection on the Performance of Evolutionary Algorithms

O(\sqrt{n})

OneMax in Black-Box Models with Several Restrictions

, (2) we establish that GIRGs have a constant clustering coefficient, (3) we show that GIRGs have small separators, i.e., it suffices to delete a sublinear number of edges to break the giant component into two large pieces, and (4) we show how to compress GIRGs using an expected linear number of bits.

Bootstrap Percolation on Geometric Inhomogeneous Random Graphs

Black-box complexity theory provides lower bounds for the runtime %classes of black-box optimizers like evolutionary algorithms and serves as an inspiration for the design of new genetic algorithms. Several black-box models covering different classes of algorithms exist, each highlighting a different aspect of the algorithms under considerations. In this work we add to the existing black-box notions a new \emph{elitist black-box model}, in which algorithms are required to base all decisions solely on (a fixed number of) the best search points sampled so far. Our model combines features of the ranking-based and the memory-restricted black-box models with elitist selection. We provide several examples for which the elitist black-box complexity is exponentially larger than that the respective complexities in all previous black-box models, thus showing that the elitist black-box complexity can be much closer to the runtime of typical evolutionary algorithms. We also introduce the concept of

Reliable neuronal systems: the importance of heterogeneity.

p

Can quantum search accelerate evolutionary algorithms

-Monte Carlo black-box complexity, which measures the time it takes to optimize a problem with failure probability at most p. Even for small

Black-box complexities of combinatorial problems

p

Greedy Routing and the Algorithmic Small-World Phenomenon

, the

Sampling Geometric Inhomogeneous Random Graphs in Linear Time.

p

Bounding bloat in genetic programming

-Monte Carlo black-box complexity of a function class F can be smaller by an exponential factor than its typically regarded Las Vegas complexity (which measures the expected time it takes to optimize F).