{"id":"https://openalex.org/W2957566694","doi":"https://doi.org/10.1145/3357713.3384303","title":"Walking randomly, massively, and efficiently","display_name":"Walking randomly, massively, and efficiently","publication_year":2020,"publication_date":"2020-06-07","ids":{"openalex":"https://openalex.org/W2957566694","doi":"https://doi.org/10.1145/3357713.3384303","mag":"2957566694"},"language":"en","primary_location":{"id":"doi:10.1145/3357713.3384303","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357713.3384303","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384303","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384303","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044510135","display_name":"Jakub \u0141\u0105cki","orcid":"https://orcid.org/0000-0001-9347-0041"},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jakub \u0141\u0105cki","raw_affiliation_strings":["Google Research, USA","Google Research  USA"],"affiliations":[{"raw_affiliation_string":"Google Research, USA","institution_ids":["https://openalex.org/I1291425158"]},{"raw_affiliation_string":"Google Research  USA","institution_ids":["https://openalex.org/I1291425158"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021154381","display_name":"Slobodan Mitrovi\u0107","orcid":"https://orcid.org/0000-0002-8571-0970"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Slobodan Mitrovi\u0107","raw_affiliation_strings":["Massachusetts Institute of Technology, USA","Massachusetts Institute of Technology , USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Massachusetts Institute of Technology , USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040763434","display_name":"Krzysztof Onak","orcid":"https://orcid.org/0000-0003-0226-7449"},"institutions":[{"id":"https://openalex.org/I4210156936","display_name":"IBM Research - Austin","ror":"https://ror.org/05gjbbg60","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115","https://openalex.org/I4210156936"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Krzysztof Onak","raw_affiliation_strings":["IBM Research, USA","IBM Research (USA)"],"affiliations":[{"raw_affiliation_string":"IBM Research, USA","institution_ids":[]},{"raw_affiliation_string":"IBM Research (USA)","institution_ids":["https://openalex.org/I4210156936"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025494465","display_name":"Piotr Sankowski","orcid":"https://orcid.org/0000-0002-0907-3754"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Piotr Sankowski","raw_affiliation_strings":["University of Warsaw, Poland","University of Warsaw - Poland"],"affiliations":[{"raw_affiliation_string":"University of Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]},{"raw_affiliation_string":"University of Warsaw - Poland","institution_ids":["https://openalex.org/I4654613"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5044510135"],"corresponding_institution_ids":["https://openalex.org/I1291425158"],"apc_list":null,"apc_paid":null,"fwci":0.14708811,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.47360483,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"364","last_page":"377"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/random-walk","display_name":"Random walk","score":0.7674752473831177},{"id":"https://openalex.org/keywords/pagerank","display_name":"PageRank","score":0.6923428177833557},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6752432584762573},{"id":"https://openalex.org/keywords/stationary-distribution","display_name":"Stationary distribution","score":0.6087417006492615},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5667689442634583},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.5476504564285278},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.5197784304618835},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.4733222424983978},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.4663723111152649},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4613357484340668},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45413288474082947},{"id":"https://openalex.org/keywords/hitting-time","display_name":"Hitting time","score":0.41977664828300476},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2539137601852417},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1566709280014038}],"concepts":[{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.7674752473831177},{"id":"https://openalex.org/C2779172887","wikidata":"https://www.wikidata.org/wiki/Q184316","display_name":"PageRank","level":2,"score":0.6923428177833557},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6752432584762573},{"id":"https://openalex.org/C98951983","wikidata":"https://www.wikidata.org/wiki/Q7604341","display_name":"Stationary distribution","level":3,"score":0.6087417006492615},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5667689442634583},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.5476504564285278},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5197784304618835},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.4733222424983978},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.4663723111152649},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4613357484340668},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45413288474082947},{"id":"https://openalex.org/C199277547","wikidata":"https://www.wikidata.org/wiki/Q5872687","display_name":"Hitting time","level":2,"score":0.41977664828300476},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2539137601852417},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1566709280014038},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3357713.3384303","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357713.3384303","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384303","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1907.05391","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1907.05391","pdf_url":"https://arxiv.org/pdf/1907.05391","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"mag:2957566694","is_oa":true,"landing_page_url":"https://arxiv.org/abs/1907.05391","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1907.05391","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1907.05391","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1145/3357713.3384303","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357713.3384303","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384303","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2957566694.pdf","grobid_xml":"https://content.openalex.org/works/W2957566694.grobid-xml"},"referenced_works_count":67,"referenced_works":["https://openalex.org/W1503698146","https://openalex.org/W1607251184","https://openalex.org/W1648776928","https://openalex.org/W1752265245","https://openalex.org/W1854214752","https://openalex.org/W1967172740","https://openalex.org/W1969830451","https://openalex.org/W1978583881","https://openalex.org/W1978624651","https://openalex.org/W1992626439","https://openalex.org/W1994598067","https://openalex.org/W1999617330","https://openalex.org/W2002770250","https://openalex.org/W2008199814","https://openalex.org/W2014478203","https://openalex.org/W2022994251","https://openalex.org/W2025220494","https://openalex.org/W2026795019","https://openalex.org/W2051586153","https://openalex.org/W2054651034","https://openalex.org/W2057037070","https://openalex.org/W2057082426","https://openalex.org/W2061297447","https://openalex.org/W2066636486","https://openalex.org/W2079485638","https://openalex.org/W2082227928","https://openalex.org/W2086254934","https://openalex.org/W2087439135","https://openalex.org/W2107577105","https://openalex.org/W2109176946","https://openalex.org/W2109448247","https://openalex.org/W2115464252","https://openalex.org/W2121411467","https://openalex.org/W2125493559","https://openalex.org/W2129565593","https://openalex.org/W2143917438","https://openalex.org/W2149410722","https://openalex.org/W2153977620","https://openalex.org/W2253610808","https://openalex.org/W2271854143","https://openalex.org/W2611773579","https://openalex.org/W2734687249","https://openalex.org/W2788015272","https://openalex.org/W2802632688","https://openalex.org/W2807926398","https://openalex.org/W2883361998","https://openalex.org/W2884132620","https://openalex.org/W2884459710","https://openalex.org/W2885807076","https://openalex.org/W2887341375","https://openalex.org/W2888820341","https://openalex.org/W2900062269","https://openalex.org/W2902899861","https://openalex.org/W2904719450","https://openalex.org/W2907502211","https://openalex.org/W2945994473","https://openalex.org/W2951940772","https://openalex.org/W2962710457","https://openalex.org/W2963298291","https://openalex.org/W2963629655","https://openalex.org/W2964294252","https://openalex.org/W2971407628","https://openalex.org/W2971736579","https://openalex.org/W2972236337","https://openalex.org/W2979506797","https://openalex.org/W3105716683","https://openalex.org/W3174944810"],"related_works":["https://openalex.org/W3034669632","https://openalex.org/W2979506797","https://openalex.org/W2475785066","https://openalex.org/W2884123809","https://openalex.org/W3132046926","https://openalex.org/W2883361998","https://openalex.org/W2802632688","https://openalex.org/W2281539709","https://openalex.org/W3098795159","https://openalex.org/W2962855378","https://openalex.org/W3208584311","https://openalex.org/W2963181990","https://openalex.org/W2061496873","https://openalex.org/W2044334960","https://openalex.org/W2908983407","https://openalex.org/W1970199308","https://openalex.org/W2883419362","https://openalex.org/W3042194019","https://openalex.org/W3141229161","https://openalex.org/W2952104302"],"abstract_inverted_index":{"We":[0,169],"introduce":[1],"a":[2,119,123],"set":[3],"of":[4,31,61,66,103,112,131,164,178,193],"techniques":[5,54],"that":[6,96,143],"allow":[7],"for":[8,59,75,109,174,208,227,247],"efficiently":[9],"generating":[10],"many":[11,37],"independent":[12],"random":[13,67,88,113,129],"walks":[14,89,114,130],"in":[15,28,69,115,134,197,217,238],"the":[16,29,46,62,82,91,100,145,165,172,175,179,187,194,198,204],"Massive":[17],"Parallel":[18],"Computation":[19],"(MPC)":[20],"model":[21],"with":[22],"space":[23],"per":[24],"machine":[25],"strongly":[26],"sublinear":[27],"number":[30],"vertices.":[32],"In":[33,81],"this":[34,57,149],"space-per-machine":[35],"regime,":[36],"natural":[38],"approaches":[39],"to":[40,44,212],"graph":[41,181],"problems":[42],"struggle":[43],"overcome":[45],"$\u0398(\\log":[47,135],"n)$":[48],"MPC":[49],"round":[50,150,206],"complexity":[51,151],"barrier.":[52],"Our":[53],"enable":[55],"breaking":[56],"barrier":[58],"PageRank---one":[60],"most":[63],"important":[64],"applications":[65],"walks---even":[68],"more":[70],"challenging":[71],"directed":[72,156,188,248],"graphs,":[73,157],"and":[74,78,117,182],"approximate":[76],"bipartiteness":[77],"expansion":[79],"testing.":[80],"undirected":[83,176,228],"case,":[84,189],"we":[85,97,125,141,202],"start":[86],"our":[87,158,162],"from":[90,161],"stationary":[92],"distribution,":[93],"which":[94],"implies":[95],"approximately":[98],"know":[99],"empirical":[101],"distribution":[102],"their":[104],"next":[105],"steps.":[106],"This":[107],"allows":[108],"preparing":[110],"continuations":[111],"advance":[116],"applying":[118],"doubling":[120],"approach.":[121],"As":[122],"result":[124],"can":[126],"generate":[127],"multiple":[128],"length":[132],"$l$":[133],"l)$":[136],"rounds":[137,226,246],"on":[138],"MPC.":[139],"Moreover,":[140],"show":[142],"under":[144],"popular":[146],"1-vs.-2-Cycles":[147],"conjecture,":[148],"is":[152],"asymptotically":[153],"tight.":[154],"For":[155,200],"approach":[159],"stems":[160],"treatment":[163],"PageRank":[166,173],"Markov":[167],"chain.":[168],"first":[170],"compute":[171],"version":[177],"input":[180],"then":[183],"slowly":[184],"transition":[185,195],"towards":[186],"considering":[190],"convex":[191],"combinations":[192],"matrices":[196],"process.":[199],"PageRank,":[201],"achieve":[203],"following":[205],"complexities":[207],"damping":[209],"factor":[210],"equal":[211],"$1":[213],"-":[214],"\u03b5$:":[215],"*":[216,237],"$O(\\log":[218],"\\log":[219,222,241],"n":[220,242],"+":[221,243],"1":[223],"/":[224,233,253],"\u03b5)$":[225,255],"graphs":[229,249],"(with":[230,250],"$\\tilde":[231,239,251],"O(m":[232],"\u03b5^2)$":[234],"total":[235,256],"space),":[236],"O(\\log^2":[240],"\\log^2":[244],"1/\u03b5)$":[245],"O((m+n^{1+o(1)})":[252],"poly\\,":[254],"space).":[257]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-02-09T09:26:11.010843","created_date":"2025-10-10T00:00:00"}