Zobrazeno 1 - 10
of 237
pro vyhledávání: '"Lengler, Johannes"'
Autor:
Kaufmann, Marc, Lakis, Kostas, Lengler, Johannes, Ravi, Raghu Raman, Schaller, Ulysse, Sturm, Konstantin
We study push-pull rumour spreading in small-world models for social networks where the degrees follow a power-law. In a non-geometric setting Fountoulakis, Panagiotou and Sauerwald have shown that rumours always spread fast (SODA 2012). On the other
Externí odkaz:
http://arxiv.org/abs/2408.01268
In this paper, we study graph distances in the geometric random graph models scale-free percolation SFP, geometric inhomogeneous random graphs GIRG, and hyperbolic random graphs HRG. Despite the wide success of the models, the parameter regime in whi
Externí odkaz:
http://arxiv.org/abs/2405.07217
Optimization problems in dynamic environments have recently been the source of several theoretical studies. One of these problems is the monotonic Dynamic Binary Value problem, which theoretically has high discriminatory power between different Genet
Externí odkaz:
http://arxiv.org/abs/2404.15837
Autor:
Cerf, Sacha, Lengler, Johannes
Our theoretical understanding of crossover is limited by our ability to analyze how population diversity evolves. In this study, we provide one of the first rigorous analyses of population diversity and optimization time in a setting where large dive
Externí odkaz:
http://arxiv.org/abs/2404.12268
The compact Genetic Algorithm (cGA), parameterized by its hypothetical population size $K$, offers a low-memory alternative to evolving a large offspring population of solutions. It evolves a probability distribution, biasing it towards promising sam
Externí odkaz:
http://arxiv.org/abs/2404.12147
Autor:
Lengler, Johannes, Sturm, Konstantin
The one-fifth rule and its generalizations are a classical parameter control mechanism in discrete domains. They have also been transferred to control the offspring population size of the $(1, \lambda)$-EA. This has been shown to work very well for h
Externí odkaz:
http://arxiv.org/abs/2404.12047
We compare the $(1,\lambda)$-EA and the $(1 + \lambda)$-EA on the recently introduced benchmark DisOM, which is the OneMax function with randomly planted local optima. Previous work showed that if all local optima have the same relative height, then
Externí odkaz:
http://arxiv.org/abs/2404.09687
The Jump$_k$ benchmark was the first problem for which crossover was proven to give a speedup over mutation-only evolutionary algorithms. Jansen and Wegener (2002) proved an upper bound of $O({\rm poly}(n) + 4^k/p_c)$ for the ($\mu$+1)~Genetic Algori
Externí odkaz:
http://arxiv.org/abs/2404.07061
The study of hardest and easiest fitness landscapes is an active area of research. Recently, Kaufmann, Larcher, Lengler and Zou conjectured that for the self-adjusting $(1,\lambda)$-EA, Adversarial Dynamic BinVal (ADBV) is the hardest dynamic monoton
Externí odkaz:
http://arxiv.org/abs/2311.07438
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 penalty factor polynomial in their expected degrees. Based on the expon
Externí odkaz:
http://arxiv.org/abs/2309.11880