{"id":"https://openalex.org/W1985234177","doi":"https://doi.org/10.1137/0403039","title":"The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees","display_name":"The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees","publication_year":1990,"publication_date":"1990-11-01","ids":{"openalex":"https://openalex.org/W1985234177","doi":"https://doi.org/10.1137/0403039","mag":"1985234177"},"language":"en","primary_location":{"id":"doi:10.1137/0403039","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0403039","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://escholarship.org/content/qt4gc8v9f6/qt4gc8v9f6.pdf?t=p3z7os","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083558768","display_name":"David Aldous","orcid":"https://orcid.org/0000-0001-7793-2357"},"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":"David J. Aldous","raw_affiliation_strings":["Department of Statistics University of California Berkeley CA 94720"],"affiliations":[{"raw_affiliation_string":"Department of Statistics University of California Berkeley CA 94720","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5083558768"],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":5.0219,"has_fulltext":true,"cited_by_count":328,"citation_normalized_percentile":{"value":0.96009281,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"3","issue":"4","first_page":"450","last_page":"465"},"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.9995999932289124,"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.9995999932289124,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9987000226974487,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"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/mathematics","display_name":"Mathematics","score":0.8210718631744385},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.8064995408058167},{"id":"https://openalex.org/keywords/random-walk","display_name":"Random walk","score":0.7491576671600342},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7199934720993042},{"id":"https://openalex.org/keywords/loop-erased-random-walk","display_name":"Loop-erased random walk","score":0.6710810661315918},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.6258269548416138},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5586362481117249},{"id":"https://openalex.org/keywords/random-tree","display_name":"Random tree","score":0.5482795238494873},{"id":"https://openalex.org/keywords/uniform-distribution","display_name":"Uniform distribution (continuous)","score":0.5341811180114746},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5096313953399658},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.44826871156692505},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4384000897407532},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4243139326572418},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1267988681793213},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.10434854030609131}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8210718631744385},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8064995408058167},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.7491576671600342},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7199934720993042},{"id":"https://openalex.org/C37727645","wikidata":"https://www.wikidata.org/wiki/Q6675770","display_name":"Loop-erased random walk","level":4,"score":0.6710810661315918},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.6258269548416138},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5586362481117249},{"id":"https://openalex.org/C2776839635","wikidata":"https://www.wikidata.org/wiki/Q14942679","display_name":"Random tree","level":4,"score":0.5482795238494873},{"id":"https://openalex.org/C108882938","wikidata":"https://www.wikidata.org/wiki/Q274506","display_name":"Uniform distribution (continuous)","level":2,"score":0.5341811180114746},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5096313953399658},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.44826871156692505},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4384000897407532},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4243139326572418},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1267988681793213},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10434854030609131},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/0403039","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0403039","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:qt4gc8v9f6","is_oa":true,"landing_page_url":"http://www.escholarship.org/uc/item/4gc8v9f6","pdf_url":"https://escholarship.org/content/qt4gc8v9f6/qt4gc8v9f6.pdf?t=p3z7os","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Aldous, DJ. (1990). The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees. SIAM Journal on Discrete Mathematics, 3(4), 450 - 465. doi: 10.1137/0403039. UC Berkeley: Retrieved from: http://www.escholarship.org/uc/item/4gc8v9f6","raw_type":"article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.123.5608","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.5608","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.stat.berkeley.edu/~aldous/Papers/me43.ps.Z","raw_type":"text"},{"id":"pmh:oai:escholarship.org/ark:/13030/qt4gc8v9f6","is_oa":false,"landing_page_url":"https://escholarship.org/uc/item/4gc8v9f6","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Discrete Mathematics, vol 3, iss 4","raw_type":"article"}],"best_oa_location":{"id":"pmh:qt4gc8v9f6","is_oa":true,"landing_page_url":"http://www.escholarship.org/uc/item/4gc8v9f6","pdf_url":"https://escholarship.org/content/qt4gc8v9f6/qt4gc8v9f6.pdf?t=p3z7os","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Aldous, DJ. (1990). The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees. SIAM Journal on Discrete Mathematics, 3(4), 450 - 465. doi: 10.1137/0403039. UC Berkeley: Retrieved from: http://www.escholarship.org/uc/item/4gc8v9f6","raw_type":"article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.5899999737739563}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1985234177.pdf","grobid_xml":"https://content.openalex.org/works/W1985234177.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W1340063","https://openalex.org/W599250420","https://openalex.org/W1515707356","https://openalex.org/W1964554189","https://openalex.org/W1989466175","https://openalex.org/W2048653445","https://openalex.org/W2059959102","https://openalex.org/W2072211488","https://openalex.org/W2075108920","https://openalex.org/W2079458472","https://openalex.org/W2084768526","https://openalex.org/W2090160477","https://openalex.org/W2095181329","https://openalex.org/W2111933629","https://openalex.org/W2138033161","https://openalex.org/W2146369691","https://openalex.org/W2156184725","https://openalex.org/W2752853835","https://openalex.org/W2752908210","https://openalex.org/W2983896310","https://openalex.org/W4298236575"],"related_works":["https://openalex.org/W4224251989","https://openalex.org/W2149927264","https://openalex.org/W1991421283","https://openalex.org/W2951475756","https://openalex.org/W4308416203","https://openalex.org/W2950349984","https://openalex.org/W2072536307","https://openalex.org/W4220861011","https://openalex.org/W2099915933","https://openalex.org/W1985234177"],"abstract_inverted_index":{"A":[0],"random":[1,14,19,34],"walk":[2,20],"on":[3],"a":[4,12],"finite":[5],"graph":[6],"can":[7,22],"be":[8,23],"used":[9],"to":[10,25],"construct":[11],"uniform":[13,33],"spanning":[15,35],"tree.We":[16],"show":[17],"how":[18],"techniques":[21],"applied":[24],"the":[26,32,37,41,46],"study":[27],"of":[28,31,39,43],"several":[29],"properties":[30],"tree:":[36],"proportion":[38],"leaves,":[40],"distribution":[42],"degrees,":[44],"and":[45],"diameter.":[47]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":15},{"year":2024,"cited_by_count":10},{"year":2023,"cited_by_count":19},{"year":2022,"cited_by_count":12},{"year":2021,"cited_by_count":15},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":12},{"year":2016,"cited_by_count":13},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":11},{"year":2013,"cited_by_count":17},{"year":2012,"cited_by_count":11}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}