1 citations · 2 across the 9 of their papers we have counts for
5 papers · 1 filter
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…
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…
Sublinear Cuts are the Exception in BDF-GIRGs
Marc Kaufmann, Raghu Raman Ravi, Ulysse Schaller
The introduction of geometry has proven instrumental in the efforts towards more realistic models for real-world networks. In Geometric Inhomogeneous Random Graphs (GIRGs), Euclide…
Faster Optimization Through Genetic Drift
Cella Florescu, Marc Kaufmann, Johannes Lengler +1
The compact Genetic Algorithm (cGA), parameterized by its hypothetical population size , offers a low-memory alternative to evolving a large offspring population of solutions. I…
Expressivity of Geometric Inhomogeneous Random Graphs -- Metric and Non-Metric
Benjamin Dayan, Marc Kaufmann, Ulysse Schaller
Recently there has been increased interest in fitting generative graph models to real-world networks. In particular, Bläsius et al. have proposed a framework for systematic evaluat…