{"id":"https://openalex.org/W7162799690","doi":"https://doi.org/10.48550/arxiv.2605.29566","title":"Sampling Directed Eulerian Tours in $\\widetilde O(m^{3/2})$ Time","display_name":"Sampling Directed Eulerian Tours in $\\widetilde O(m^{3/2})$ Time","publication_year":2026,"publication_date":"2026-05-28","ids":{"openalex":"https://openalex.org/W7162799690","doi":"https://doi.org/10.48550/arxiv.2605.29566"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.29566","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.29566","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":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.29566","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040375566","display_name":"Nima Anari","orcid":"https://orcid.org/0000-0002-4394-3530"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Anari, Nima","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5040375566"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.3312999904155731,"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.3312999904155731,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.3199000060558319,"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"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.0348999984562397,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/eulerian-path","display_name":"Eulerian path","score":0.8180000185966492},{"id":"https://openalex.org/keywords/pointwise","display_name":"Pointwise","score":0.720300018787384},{"id":"https://openalex.org/keywords/multigraph","display_name":"Multigraph","score":0.5777000188827515},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.47839999198913574},{"id":"https://openalex.org/keywords/core","display_name":"Core (optical fiber)","score":0.46070000529289246},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4560000002384186},{"id":"https://openalex.org/keywords/random-walk","display_name":"Random walk","score":0.44609999656677246},{"id":"https://openalex.org/keywords/mixing","display_name":"Mixing (physics)","score":0.383899986743927}],"concepts":[{"id":"https://openalex.org/C43058520","wikidata":"https://www.wikidata.org/wiki/Q624580","display_name":"Eulerian path","level":3,"score":0.8180000185966492},{"id":"https://openalex.org/C2777984123","wikidata":"https://www.wikidata.org/wiki/Q9248237","display_name":"Pointwise","level":2,"score":0.720300018787384},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6815999746322632},{"id":"https://openalex.org/C17758045","wikidata":"https://www.wikidata.org/wiki/Q2642629","display_name":"Multigraph","level":3,"score":0.5777000188827515},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.47839999198913574},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4690000116825104},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.46070000529289246},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4560000002384186},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.44609999656677246},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3962000012397766},{"id":"https://openalex.org/C138777275","wikidata":"https://www.wikidata.org/wiki/Q6884054","display_name":"Mixing (physics)","level":2,"score":0.383899986743927},{"id":"https://openalex.org/C188198153","wikidata":"https://www.wikidata.org/wiki/Q1613840","display_name":"Limiting","level":2,"score":0.3684999942779541},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.35989999771118164},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.35510000586509705},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34049999713897705},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.3370000123977661},{"id":"https://openalex.org/C194147245","wikidata":"https://www.wikidata.org/wiki/Q1076368","display_name":"Chord (peer-to-peer)","level":2,"score":0.33550000190734863},{"id":"https://openalex.org/C199277547","wikidata":"https://www.wikidata.org/wiki/Q5872687","display_name":"Hitting time","level":2,"score":0.334199994802475},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3328999876976013},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.30309998989105225},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2856999933719635},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2777000069618225},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.27300000190734863},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.26829999685287476},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.26159998774528503},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2556999921798706},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.25029999017715454}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.29566","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.29566","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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.29566","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.29566","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":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,50,84],"give":[1],"a":[2,7,13,47,52,64,100],"randomized":[3],"algorithm":[4],"that":[5,77,86],"samples":[6],"nearly":[8,91],"uniform":[9],"Eulerian":[10,15,32],"tour":[11,65],"of":[12],"directed":[14,31],"multigraph":[16],"with":[17,164],"$m$":[18],"arcs":[19],"in":[20,90],"$\\widetilde":[21,122],"O(m^{3/2})$":[22,123],"time.":[23,126],"The":[24,43,127,144],"guarantee":[25],"is":[26,46],"worst-case,":[27],"applies":[28],"to":[29,81,116],"arbitrary":[30,117],"multigraphs,":[33],"and":[34,69,95,134,153,167],"breaks":[35],"the":[36,57,74,79,97,110,121,131,135,142,147,151],"$mn$-type":[37],"arborescence-sampling":[38],"barrier":[39],"on":[40],"sparse":[41],"graphs.":[42],"core":[44,115],"case":[45],"$2$-in/$2$-out":[48],"graph.":[49],"introduce":[51],"new":[53],"local":[54,75],"Markov":[55],"chain,":[56],"flip--repair":[58],"walk:":[59],"one":[60,82],"step":[61],"locally":[62],"splits":[63],"into":[66],"two":[67],"circuits":[68],"then":[70],"chooses":[71],"uniformly":[72],"among":[73],"flips":[76],"repair":[78],"state":[80],"tour.":[83],"prove":[85],"this":[87,113],"walk":[88,98],"mixes":[89],"linear":[92],"many":[93],"steps":[94],"implement":[96],"using":[99],"dynamic":[101,136],"chord":[102],"data":[103],"structure.":[104],"A":[105],"pointwise":[106],"degree-reduction":[107],"wrapper":[108],"extends":[109],"sampler":[111],"from":[112],"degree-two":[114],"degrees":[118],"while":[119],"preserving":[120],"total":[124],"running":[125],"high-level":[128],"algorithmic":[129],"plan,":[130],"switching-network":[132],"reduction,":[133],"data-structure":[137],"argument":[138],"were":[139],"devised":[140],"by":[141],"author.":[143],"author":[145],"conjectured":[146],"mixing":[148],"theorem":[149],"underlying":[150],"analysis,":[152],"GPT":[154],"5.5":[155],"Pro":[156],"Extended":[157],"produced":[158],"its":[159],"linear-algebra":[160],"proof.":[161],"Codex":[162],"assisted":[163],"manuscript":[165],"assembly":[166],"typesetting.":[168]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-30T00:00:00"}