Skip to Main content Skip to Navigation
Conference papers

Local Update Algorithms for Random Graphs

Abstract : 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.
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download
Contributor : Romaric Duvignau <>
Submitted on : Monday, June 30, 2014 - 4:17:24 PM
Last modification on : Thursday, January 11, 2018 - 6:20:17 AM
Document(s) archivé(s) le : Tuesday, September 30, 2014 - 11:55:12 AM


Files produced by the author(s)




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⟩



Record views


Files downloads