Artykuł w czasopiśmie
Brak miniatury
Licencja
Dostęp zamkniętyWalking randomly, massively, and efficiently
| cris.lastimport.scopus | 2024-02-12T19:48:23Z |
| dc.abstract.en | We introduce a set of techniques that allow for efficiently generating many independent random walks in the Massively Parallel Computation (MPC) model with space per machine strongly sublinear in the number of vertices. In this space-per-machine regime, many natural approaches to graph problems struggle to overcome the Θ(log n) MPC round complexity barrier, where n is the number of vertices. Our techniques enable achieving this for PageRank—one of the most important applications of random walks—even in more challenging directed graphs, as well as for approximate bipartiteness and expansion testing. In the undirected case, we start our random walks from the stationary distribution, which implies that we approximately know the empirical distribution of their next steps. This allows for preparing continuations of random walks in advance and applying a doubling approach. As a result we can generate multiple random walks of length l in Θ(log l) rounds on MPC. Moreover, we show that under the popular 1-vs.-2-Cycles conjecture, this round complexity is asymptotically tight. For directed graphs, our approach stems from our treatment of the PageRank Markov chain. We first compute the PageRank for the undirected version of the input graph and then slowly transition towards the directed case, considering convex combinations of the transition matrices in the process. For PageRank, we achieve the following round complexities for damping factor equal to 1 − є: in O(log log n + log 1 / є) rounds for undirected graphs (with Õ(m / є2) total space), in Õ(log2 log n + log2 1/є) rounds for directed graphs (with Õ((m+n 1+o(1)) / poly(є)) total space). The round complexity of our result for computing PageRank has only logarithmic dependence on 1/є. We use this to show that our PageRank algorithm can be used to construct directed length-l random walks in O(log2 log n + log2 l) rounds with Õ((m+n 1+o(1)) poly(l)) total space. More specifically, by setting є = Θ(1 / l), a length-l PageRank walk with constant probability contains no random jump, and hence is a directed random walk. |
| dc.affiliation | Uniwersytet Warszawski |
| dc.conference.country | Stany Zjednoczone |
| dc.conference.datefinish | 2020-06-26 |
| dc.conference.datestart | 2020-06-22 |
| dc.conference.place | Chicago |
| dc.conference.series | ACM Symposium on Theory of Computing |
| dc.conference.series | ACM Symposium on Theory of Computing |
| dc.conference.seriesshortcut | STOC |
| dc.conference.shortcut | STOC 2020 |
| dc.conference.weblink | http://acm-stoc.org/stoc2020/ |
| dc.contributor.author | Łącki, Jakub |
| dc.contributor.author | Sankowski, Piotr |
| dc.contributor.author | Onak, Krzysztof |
| dc.contributor.author | Mitrovic, Slobodan |
| dc.date.accessioned | 2024-01-26T11:55:23Z |
| dc.date.available | 2024-01-26T11:55:23Z |
| dc.date.issued | 2020 |
| dc.description.finance | Środki finansowe przyznane na realizację projektu w zakresie badań naukowych lub prac rozwojowych |
| dc.identifier.doi | 10.1145/3357713.3384303 |
| dc.identifier.issn | 0737-8017 |
| dc.identifier.uri | https://repozytorium.uw.edu.pl//handle/item/124753 |
| dc.identifier.weblink | https://doi.org/10.1145/3357713.3384303 |
| dc.language | eng |
| dc.pbn.affiliation | computer and information sciences |
| dc.relation.ispartof | SYMPOSIUM ON THEORY OF COMPUTING |
| dc.relation.pages | 364-377 |
| dc.rights | ClosedAccess |
| dc.sciencecloud | nosend |
| dc.title | Walking randomly, massively, and efficiently |
| dc.type | JournalArticle |
| dspace.entity.type | Publication |