Local Update Algorithms for Random Graphs

Philippe Duchon (1) , Romaric Duvignau (1)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique

We study the problem of maintaining a given distribution of random graphs under an arbitrary sequence of vertex insertions and deletions. Since our goal is to model the evolution of dynamic logical networks, we work in a local model where we do not have direct access to the list of all vertices. Instead, we assume access to a global primitive that returns a random vertex, chosen uniformly from the whole vertex set. In this preliminary work, we focus on a simple model of uniform directed random graphs where all vertices have a fixed outdegree. We describe and analyze several algorithms for the maintenance task; the most elaborate of our algorithms are asymptotically optimal.

Mots clés: random graphs; dynamic graphs; logical network maintenance; randomness preservation

Domaines: Modélisation et simulation

Philippe Duchon, Romaric Duvignau. Local Update Algorithms for Random Graphs. LATIN 2014: Theoretical Informatics, Mar 2014, Montevideo, Uruguay. pp.367-378, ⟨10.1007/978-3-642-54423-1_32⟩. ⟨hal-01015599⟩