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. © 2014 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Duchon, P., & Duvignau, R. (2014). Local update algorithms for random graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8392 LNCS, pp. 367–378). Springer Verlag. https://doi.org/10.1007/978-3-642-54423-1_32
Mendeley helps you to discover research relevant for your work.