activity
20242026
collaborators

11 papers

math.PR2026

Degree-dependent and distance-dependent contact rates interpolate between explosive, exponential and polynomial epidemic growth

Zylan Benjert, Júlia Komjáthy, Johannes Lengler +2

It is a fundamental question in epidemiology to estimate, model and predict the growth rate of a pandemic. Analogously, analysing the diffusion of innovation, (fake) news, memes, a…

cs.SI2025

Assortativity in geometric and scale-free networks

Marc Kaufmann, Ulysse Schaller, Thomas Bläsius +1

The assortative behavior of a network is the tendency of similar (or dissimilar) nodes to connect to each other. This tendency can have an influence on various properties of the ne…

math.PR2025

Rumour Spreading Depends on the Latent Geometry and Degree Distribution in Social Network Models

Marc Kaufmann, Kostas Lakis, Johannes Lengler +3

We study push-pull rumour spreading in ultra-small-world models for social networks where the degrees follow a power-law distribution. In a non-geometric setting, Fountoulakis, Pan…

cs.NE2025

Hardest Monotone Functions for Evolutionary Algorithms

Marc Kaufmann, Maxime Larcher, Johannes Lengler +1

In this paper we revisit the question how hard it can be for the Evolutionary Algorithm to optimize monotone pseudo-Boolean functions. By introducing a more pessimistic sto…

cs.SI2025

Expanders in Models of Social Networks

Marc Kaufmann, Johannes Lengler, Ulysse Schaller +1

A common model for social networks are Geometric Inhomogeneous Random Graphs (GIRGs), in which vertices draw a random position in some latent geometric space, and the probability o…

cs.SI2024

Balanced Bidirectional Breadth-First Search on Scale-Free Networks

Sacha Cerf, Benjamin Dayan, Umberto De Ambroggio +3

To find a shortest path between two nodes and in a given graph, a classical approach is to start a Breadth-First Search (BFS) from and run it until the search dis…