{"id":"https://openalex.org/W2046198426","doi":"https://doi.org/10.1017/s0963548315000024","title":"On the Length of a Random Minimum Spanning Tree","display_name":"On the Length of a Random Minimum Spanning Tree","publication_year":2015,"publication_date":"2015-01-23","ids":{"openalex":"https://openalex.org/W2046198426","doi":"https://doi.org/10.1017/s0963548315000024","mag":"2046198426"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548315000024","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548315000024","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1208.5170","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"COLIN COOPER","orcid":null},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"COLIN COOPER","raw_affiliation_strings":["Department of Computer Science, King's College, University of London, London WC2R 2LS, UK (e-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, King's College, University of London, London WC2R 2LS, UK (e-mail:","institution_ids":["https://openalex.org/I183935753"]}]},{"author_position":"middle","author":{"id":null,"display_name":"ALAN FRIEZE","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"ALAN FRIEZE","raw_affiliation_strings":["Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh PA15217, USA (e-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh PA15217, USA (e-mail:","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":null,"display_name":"NATE INCE","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"NATE INCE","raw_affiliation_strings":["Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh PA15217, USA (e-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh PA15217, USA (e-mail:","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":null,"display_name":"SVANTE JANSON","orcid":null},"institutions":[{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"SVANTE JANSON","raw_affiliation_strings":["Department of Mathematics, Uppsala University, SE-75310 Uppsala, Sweden (e-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Uppsala University, SE-75310 Uppsala, Sweden (e-mail:","institution_ids":["https://openalex.org/I123387679"]}]},{"author_position":"last","author":{"id":null,"display_name":"JOEL SPENCER","orcid":null},"institutions":[{"id":"https://openalex.org/I36672615","display_name":"Courant Institute of Mathematical Sciences","ror":"https://ror.org/037tm7f56","country_code":"US","type":"education","lineage":["https://openalex.org/I36672615","https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"JOEL SPENCER","raw_affiliation_strings":["Courant Institute, New York, NY 10012, USA (e-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Courant Institute, New York, NY 10012, USA (e-mail:","institution_ids":["https://openalex.org/I36672615"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.3967,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.86371073,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"25","issue":"1","first_page":"89","last_page":"107"},"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.2752000093460083,"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.2752000093460083,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.1842000037431717,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.11110000312328339,"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.6985999941825867},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.667900025844574},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.5031999945640564},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.48080000281333923},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.41830000281333923},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.41670000553131104},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.3921000063419342},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.37950000166893005}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7958999872207642},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7128999829292297},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6985999941825867},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.667900025844574},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.5031999945640564},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.48080000281333923},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.41830000281333923},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.41670000553131104},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4002000093460083},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.3921000063419342},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.37950000166893005},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.3075000047683716},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.29989999532699585},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.2888000011444092},{"id":"https://openalex.org/C141042865","wikidata":"https://www.wikidata.org/wiki/Q200125","display_name":"Expected value","level":2,"score":0.2827000021934509},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.27950000762939453},{"id":"https://openalex.org/C2776839635","wikidata":"https://www.wikidata.org/wiki/Q14942679","display_name":"Random tree","level":4,"score":0.27900001406669617},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.27619999647140503},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.2522999942302704}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s0963548315000024","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548315000024","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1208.5170","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1208.5170","pdf_url":"https://arxiv.org/pdf/1208.5170","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"pmh:oai:kclpure.kcl.ac.uk:publications/9c1fb02c-26d8-496d-aa82-4f82cd0de1cf","is_oa":false,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/9c1fb02c-26d8-496d-aa82-4f82cd0de1cf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400216","display_name":"Research Portal (King's College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I183935753","host_organization_name":"King's College London","host_organization_lineage":["https://openalex.org/I183935753"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"COOPER, COLIN, FRIEZE, ALAN, INCE, NATE, JANSON, SVANTE & SPENCER, JOEL 2016, 'On the Length of a Random Minimum Spanning Tree', Combinatorics, Probability and Computing, vol. 25, no. Special Issue 1, pp. 89-107. https://doi.org/10.1017/S0963548315000024","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1208.5170","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1208.5170","pdf_url":"https://arxiv.org/pdf/1208.5170","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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/G1159596240","display_name":null,"funder_award_id":"EP/M005038/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W390146837","https://openalex.org/W1592038233","https://openalex.org/W1597809183","https://openalex.org/W1971465382","https://openalex.org/W1975340857","https://openalex.org/W1981071442","https://openalex.org/W2001951510","https://openalex.org/W2003914969","https://openalex.org/W2010894431","https://openalex.org/W2017052287","https://openalex.org/W2037685635","https://openalex.org/W2052882549","https://openalex.org/W2054812794","https://openalex.org/W2089673240","https://openalex.org/W2096974843","https://openalex.org/W2121373282","https://openalex.org/W2130588964","https://openalex.org/W2139482880","https://openalex.org/W2147383508","https://openalex.org/W2154654198","https://openalex.org/W2159266476","https://openalex.org/W2165547676","https://openalex.org/W2171950634","https://openalex.org/W2332765978","https://openalex.org/W2478722229","https://openalex.org/W2977322974","https://openalex.org/W6635322419"],"related_works":[],"abstract_inverted_index":{"We":[0,34],"study":[1],"the":[2,6,11,16,36],"expected":[3],"value":[4],"of":[5,10,15,38],"length":[7],"L":[8,47],"n":[9,20,43,48],"minimum":[12],"spanning":[13],"tree":[14],"complete":[17],"graph":[18],"K":[19],"when":[21],"each":[22],"edge":[23,32],"e":[24],"is":[25],"given":[26],"an":[27],"independent":[28],"uniform":[29],"[0,":[30],"1]":[31],"weight.":[33],"sharpen":[35],"result":[37],"Frieze":[39],"[6]":[40],"that":[41,54],"lim":[42],"\u2192\u221e":[44],"$\\mathbb{E}$":[45],"(":[46],")":[49],"=":[50],"\u03b6(3)":[51],"and":[52],"show":[53],"$$":[55,57],"\\mathbb{E}(L_n)=\\zeta(3)+\\frac{c_1}{n}+\\frac{c_2+o(1)}{n^{4/3}},":[56],"where":[58],"c":[59,62],"1":[60],",":[61],"2":[63],"are":[64],"explicitly":[65],"defined":[66],"constants.":[67]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2016-06-24T00:00:00"}