1 citations · 1 across the 2 of their papers we have counts for
3 papers
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…