2 citations · 5 across the 13 of their papers we have counts for
14 papers
Deception by Omission: Language Models Knowingly Hide Their Mistakes
Lucas Florin, Amelie Knecht, Ulysse Schaller +1
Large language models (LLMs) increasingly act as agents with little human oversight, so potential mistakes they make can go unnoticed. Users then depend on the model to report what…
Shutdown Sabotage Propensities in Multi-Agent Systems
Amelie Knecht, Ulysse Schaller, Christopher Summerfield +1
The final safeguard against rogue AI behavior is the human ability to shut systems down. It has been theorized that when an AI is instructed to perform a task, self-preservation ca…
Geometric Routing in Geometric Inhomogeneous Random Graphs
Yu-Cheng Chiu, Marc Kaufmann, Kostas Lakis +1
We present the first rigorous analysis of decentralized geometric routing in Geometric Inhomogeneous Random Graphs (GIRGs), a weight-agnostic variant of the greedy routing protocol…
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…
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…
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…
Adversarially-Robust Gossip Algorithms for Approximate Quantile and Mean Computations
Bernhard Haeupler, Marc Kaufmann, Raghu Raman Ravi +1
This paper presents gossip algorithms for aggregation tasks that demonstrate both robustness to adversarial corruptions of any order of magnitude and optimality across a substantia…
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…
Polynomial growth in degree-dependent first passage percolation on spatial random graphs
Júlia Komjáthy, John Lapinskas, Johannes Lengler +1
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 p…
Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs I
Júlia Komjáthy, John Lapinskas, Johannes Lengler +1
One-dependent first passage percolation is a spreading process on a graph where the transmission time through each edge depends on the direct surroundings of the edge. In particula…