{"id":"https://openalex.org/W3183894834","doi":"https://doi.org/10.1017/s0963548323000445","title":"On minimum spanning trees for random Euclidean bipartite graphs","display_name":"On minimum spanning trees for random Euclidean bipartite graphs","publication_year":2023,"publication_date":"2023-11-30","ids":{"openalex":"https://openalex.org/W3183894834","doi":"https://doi.org/10.1017/s0963548323000445","mag":"3183894834"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548323000445","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1017/s0963548323000445","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","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2107.08452","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5026914065","display_name":"Mario Correddu","orcid":null},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Mario Correddu","raw_affiliation_strings":["Dipartimento di Matematica, Universit\u00e0 di Pisa, Pisa, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica, Universit\u00e0 di Pisa, Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060889284","display_name":"Dario Trevisan","orcid":"https://orcid.org/0000-0002-4563-5638"},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Dario Trevisan","raw_affiliation_strings":["Dipartimento di Matematica, Universit\u00e0 di Pisa, Pisa, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica, Universit\u00e0 di Pisa, Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5026914065"],"corresponding_institution_ids":["https://openalex.org/I108290504"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00585593,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"33","issue":"3","first_page":"319","last_page":"350"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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/T11476","display_name":"Graph theory and applications","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"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/T11152","display_name":"Stochastic processes and statistical mechanics","score":0.9977999925613403,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7758501768112183},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7311644554138184},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6835781335830688},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5639103651046753},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.529857337474823},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.4920019805431366},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4827936887741089},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.46020668745040894},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.42879554629325867},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36940306425094604},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35005223751068115},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.16770052909851074}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7758501768112183},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7311644554138184},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6835781335830688},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5639103651046753},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.529857337474823},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.4920019805431366},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4827936887741089},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.46020668745040894},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.42879554629325867},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36940306425094604},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35005223751068115},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.16770052909851074},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1017/s0963548323000445","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1017/s0963548323000445","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:2107.08452","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2107.08452","pdf_url":"https://arxiv.org/pdf/2107.08452","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":null},{"id":"pmh:oai:arpi.unipi.it:11568/1215751","is_oa":false,"landing_page_url":"https://hdl.handle.net/11568/1215751","pdf_url":null,"source":{"id":"https://openalex.org/S4377196265","display_name":"CINECA IRIS Institutial research information system (University of Pisa)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I108290504","host_organization_name":"University of Pisa","host_organization_lineage":["https://openalex.org/I108290504"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},{"id":"doi:10.48550/arxiv.2107.08452","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2107.08452","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2107.08452","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2107.08452","pdf_url":"https://arxiv.org/pdf/2107.08452","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":null},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1489238841","https://openalex.org/W1573820523","https://openalex.org/W1597809183","https://openalex.org/W1893250775","https://openalex.org/W1973974944","https://openalex.org/W1975290397","https://openalex.org/W1981557399","https://openalex.org/W1983822424","https://openalex.org/W1991951594","https://openalex.org/W1993966762","https://openalex.org/W1996075091","https://openalex.org/W1999823999","https://openalex.org/W2005322908","https://openalex.org/W2014068360","https://openalex.org/W2015610066","https://openalex.org/W2023278335","https://openalex.org/W2029565994","https://openalex.org/W2032841680","https://openalex.org/W2037889639","https://openalex.org/W2052882549","https://openalex.org/W2054812794","https://openalex.org/W2087216833","https://openalex.org/W2117226423","https://openalex.org/W2129892937","https://openalex.org/W2138304862","https://openalex.org/W2488793974","https://openalex.org/W2786183070","https://openalex.org/W2832075751","https://openalex.org/W2962904658","https://openalex.org/W2963434094","https://openalex.org/W2989661724"],"related_works":["https://openalex.org/W98489388","https://openalex.org/W1985149601","https://openalex.org/W3187208706","https://openalex.org/W3001850742","https://openalex.org/W1561849181","https://openalex.org/W1964611452","https://openalex.org/W3099328339","https://openalex.org/W4308416203","https://openalex.org/W3081212354","https://openalex.org/W4295683043"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"consider":[2],"the":[3,26,36,49,67,72,79,105,111,138],"minimum":[4],"spanning":[5],"tree":[6,73],"problem":[7],"on":[8,89],"a":[9,84,116,124,130,143],"weighted":[10],"complete":[11],"bipartite":[12,139],"graph":[13],"$K_{n_R,":[14],"n_B}$":[15],"whose":[16],"$n=n_R+n_B$":[17],"vertices":[18],"are":[19,35,100],"random,":[20],"i.i.d.":[21],"uniformly":[22],"distributed":[23],"points":[24],"in":[25,29,76],"unit":[27],"cube":[28],"$d$":[30,90],"dimensions":[31],"and":[32,58,135,141,148],"edge":[33,107],"weights":[34],"$p$":[37],"-th":[38],"power":[39],"of":[40,71,126,133,145],"their":[41],"Euclidean":[42],"distance,":[43],"with":[44,53,78],"$p\\gt":[45],"0$":[46],".":[47],"In":[48],"large":[50],"$n$":[51],"limit":[52],"$n_R/n":[54],"\\to":[55],"\\alpha":[56,60],"_R$":[57],"$0\\lt":[59],"_R\\lt":[61],"1$":[62],",":[63,98],"we":[64,99],"show":[65],"that":[66,104,119],"maximum":[68],"vertex":[69],"degree":[70],"grows":[74],"logarithmically,":[75],"contrast":[77],"classical,":[80],"non-bipartite,":[81],"case,":[82],"where":[83],"uniform":[85],"bound":[86],"holds":[87],"depending":[88],"only.":[91],"Despite":[92],"this":[93],"difference,":[94],"for":[95],"$p\\lt":[96],"d$":[97],"able":[101],"to":[102,115,137],"prove":[103],"total":[106],"costs":[108],"normalized":[109],"by":[110],"rate":[112],"$n^{1-p/d}$":[113],"converge":[114],"limiting":[117],"constant":[118],"can":[120],"be":[121],"represented":[122],"as":[123],"series":[125],"integrals,":[127],"thus":[128],"extending":[129],"classical":[131],"result":[132],"Avram":[134],"Bertsimas":[136],"case":[140],"confirming":[142],"conjecture":[144],"Riva,":[146],"Caracciolo":[147],"Malatesta.":[149]},"counts_by_year":[],"updated_date":"2026-03-18T14:38:29.013473","created_date":"2021-08-02T00:00:00"}