4 papers
Fast In-Spectrum Graph Watermarks
Jade Garcia Bourrée, Anne-Marie Kermarrec, Erwan Le Merrer +1
We address the problem of watermarking graph objects, which consists in hiding information within them, to prove their origin. The two existing methods to watermark graphs use subg…
Batched Bandits with Crowd Externalities
Romain Laroche, Othmane Safsafi, Raphael Feraud +1
In Batched Multi-Armed Bandits (BMAB), the policy is not allowed to be updated at each time step. Usually, the setting asserts a maximum number of allowed policy updates and the al…
The diameter of the minimum spanning tree of the complete graph with inhomogeneous random weights
Othmane Safsafi
We study a new type of random minimum spanning trees. It is built on the complete graph where each vertex is given a weight, which is a positive real number. Then, each edge is giv…
Exponential bounds for inhomogeneous random graphs in a Gaussian case
Othmane Safsafi
Rank 1 inhomogeneous random graphs are a natural generalization of Erdős Rényi random graphs. In this generalization each node is given a weight. Then the probability that an edge…