{"id":"https://openalex.org/W2768170171","doi":"https://doi.org/10.1145/3188745.3188852","title":"An almost-linear time algorithm for uniform random spanning tree generation","display_name":"An almost-linear time algorithm for uniform random spanning tree generation","publication_year":2018,"publication_date":"2018-06-20","ids":{"openalex":"https://openalex.org/W2768170171","doi":"https://doi.org/10.1145/3188745.3188852","mag":"2768170171"},"language":"en","primary_location":{"id":"doi:10.1145/3188745.3188852","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3188745.3188852","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 50th 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":"green","oa_url":"https://arxiv.org/pdf/1711.06455","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5063643701","display_name":"Aaron Schild","orcid":"https://orcid.org/0000-0003-0476-6479"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Aaron Schild","raw_affiliation_strings":["University of California at Berkeley, USA"],"affiliations":[{"raw_affiliation_string":"University of California at Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5063643701"],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":0.7296,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.6394521,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"214","last_page":"227"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11152","display_name":"Stochastic processes and statistical mechanics","score":0.9911999702453613,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11152","display_name":"Stochastic processes and statistical mechanics","score":0.9911999702453613,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9714000225067139,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9664000272750854,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7235210537910461},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6456505060195923},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6232465505599976},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5511012077331543},{"id":"https://openalex.org/keywords/random-walk","display_name":"Random walk","score":0.5505983829498291},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.5479252338409424},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5208421349525452},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.4863472580909729},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4853276312351227},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.46587273478507996},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.447769433259964},{"id":"https://openalex.org/keywords/laplace-operator","display_name":"Laplace operator","score":0.4350851774215698},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.42040368914604187},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41743823885917664},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3520999550819397}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7235210537910461},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6456505060195923},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6232465505599976},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5511012077331543},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.5505983829498291},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.5479252338409424},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5208421349525452},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.4863472580909729},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4853276312351227},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.46587273478507996},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.447769433259964},{"id":"https://openalex.org/C165700671","wikidata":"https://www.wikidata.org/wiki/Q203484","display_name":"Laplace operator","level":2,"score":0.4350851774215698},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.42040368914604187},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41743823885917664},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3520999550819397},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/3188745.3188852","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3188745.3188852","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1711.06455","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1711.06455","pdf_url":"https://arxiv.org/pdf/1711.06455","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":null,"raw_type":"text"},{"id":"mag:2768170171","is_oa":true,"landing_page_url":"http://export.arxiv.org/pdf/1711.06455","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":"pmh:oai:smartech.gatech.edu:1853/59354","is_oa":false,"landing_page_url":"http://hdl.handle.net/1853/59354","pdf_url":null,"source":{"id":"https://openalex.org/S4377196313","display_name":"SMARTech Repository (Georgia Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I130701444","host_organization_name":"Georgia Institute of Technology","host_organization_lineage":["https://openalex.org/I130701444"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Moving Image"},{"id":"doi:10.48550/arxiv.1711.06455","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1711.06455","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":"pmh:oai:arXiv.org:1711.06455","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1711.06455","pdf_url":"https://arxiv.org/pdf/1711.06455","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":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3995038234","display_name":null,"funder_award_id":"CCF-1535977","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G92832488","display_name":null,"funder_award_id":"1535977","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2768170171.pdf","grobid_xml":"https://content.openalex.org/works/W2768170171.grobid-xml"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W121824094","https://openalex.org/W1916091028","https://openalex.org/W1968057111","https://openalex.org/W1979505770","https://openalex.org/W1985234177","https://openalex.org/W2018691712","https://openalex.org/W2021272950","https://openalex.org/W2028122921","https://openalex.org/W2029673229","https://openalex.org/W2038652993","https://openalex.org/W2045533739","https://openalex.org/W2058706632","https://openalex.org/W2062877152","https://openalex.org/W2064379477","https://openalex.org/W2066653142","https://openalex.org/W2081444009","https://openalex.org/W2099143789","https://openalex.org/W2111933629","https://openalex.org/W2129027292","https://openalex.org/W2150148016","https://openalex.org/W2162793293","https://openalex.org/W2293001982","https://openalex.org/W2552685338","https://openalex.org/W2963324223","https://openalex.org/W3106163788"],"related_works":["https://openalex.org/W3149702735","https://openalex.org/W3170428146","https://openalex.org/W2068727363","https://openalex.org/W1500012667","https://openalex.org/W2569149672","https://openalex.org/W2168519036","https://openalex.org/W2538469359","https://openalex.org/W2063911102","https://openalex.org/W1975344016","https://openalex.org/W2949614607","https://openalex.org/W2752747244","https://openalex.org/W1604585469","https://openalex.org/W2900627138","https://openalex.org/W2921999720","https://openalex.org/W3166803466","https://openalex.org/W2795850823","https://openalex.org/W2110004664","https://openalex.org/W3126084272","https://openalex.org/W124627512","https://openalex.org/W1590194775"],"abstract_inverted_index":{"We":[0],"give":[1],"an":[2],"m1+o(1)\u03b2o(1)-time":[3],"algorithm":[4],"for":[5],"generating":[6],"uniformly":[7],"random":[8],"spanning":[9],"trees":[10],"in":[11,27],"weighted":[12],"graphs":[13],"with":[14],"max-to-min":[15],"weight":[16],"ratio":[17],"\u03b2.":[18],"In":[19],"the":[20,43],"process,":[21],"we":[22],"illustrate":[23],"how":[24],"fundamental":[25],"tradeoffs":[26],"graph":[28,38],"partitioning":[29],"can":[30],"be":[31],"overcome":[32],"by":[33],"eliminating":[34],"vertices":[35],"from":[36],"a":[37],"using":[39],"Schur":[40],"complements":[41],"of":[42],"associated":[44],"Laplacian":[45],"matrix.":[46]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}