Sublinear Random Access Generators for Preferential Attachment Graphs.

DOI10.4230/LIPICS.ICALP.2017.6zbMATH Open1441.68177arXiv1602.06159OpenAlexW3204625017MaRDI QIDQ5111335FDOQ5111335

Adi Rosén, Moti Medina, Guy Even, Reut Levi

Publication date: 27 May 2020

Abstract: We consider the problem of sampling from a distribution on graphs, specifically when the distribution is defined by an evolving graph model, and consider the time, space and randomness complexities of such samplers. In the standard approach, the whole graph is chosen randomly according to the randomized evolving process, stored in full, and then queries on the sampled graph are answered by simply accessing the stored graph. This may require prohibitive amounts of time, space and random bits, especially when only a small number of queries are actually issued. Instead, we propose to generate the graph on-the-fly, in response to queries, and therefore to require amounts of time, space, and random bits which are a function of the actual number of queries. We focus on two random graph models: the Barab{'{a}}si-Albert Preferential Attachment model (BA-graphs) and the random recursive tree model. We give on-the-fly generation algorithms for both models. With probability $1-1/mboxpoly(n)$, each and every query is answered in $mboxpolylog(n)$ time, and the increase in space and the number of random bits consumed by any single query are both $mboxpolylog(n)$, where $n$ denotes the number of vertices in the graph. Our results show that, although the BA random graph model is defined by a sequential process, efficient random access to the graph's nodes is possible. In addition to the conceptual contribution, efficient on-the-fly generation of random graphs can serve as a tool for the efficient simulation of sublinear algorithms over large BA-graphs, and the efficient estimation of their performance on such graphs.

Full work available at URL: https://arxiv.org/abs/1602.06159

zbMATH Keywords

sublinear algorithmsrandom recursive treeslocal computation algorithmspreferential attachment graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20)

Cited In (3)

• Generating Practical Random Hyperbolic Graphs in Near-Linear Time and with Sub-Linear Memory
• Distributed Testing of Graph Isomorphism in the CONGEST Model.
• Sublinear Random Access Generators for Preferential Attachment Graphs

This page was built for publication: Sublinear Random Access Generators for Preferential Attachment Graphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111335)