{"id":"https://openalex.org/W7225807368","doi":"https://doi.org/10.5281/zenodo.24143541","title":"An upper bound to second order for the longest minimum-weight path in a complete graph","display_name":"An upper bound to second order for the longest minimum-weight path in a complete graph","publication_year":2026,"publication_date":"2026-11-11","ids":{"openalex":"https://openalex.org/W7225807368","doi":"https://doi.org/10.5281/zenodo.24143541"},"language":"en","primary_location":{"id":"doi:10.5281/zenodo.24143541","doi":"https://doi.org/10.5281/zenodo.24143541","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.24143541","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.5281/zenodo.24143541","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041315596","display_name":"Yitzchak Shmalo","orcid":"https://orcid.org/0000-0002-2886-3049","observed_orcids":["https://orcid.org/0000-0002-2886-3049"]},"institutions":[{"id":"https://openalex.org/I197251160","display_name":"Hebrew University of Jerusalem","ror":"https://ror.org/03qxff017","country_code":"IL","type":"education","lineage":["https://openalex.org/I197251160"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Shmalo, Yitzchak","raw_affiliation_strings":["Einstein Institute of Mathematics, The Hebrew University of Jerusalem, Jerusalem, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Einstein Institute of Mathematics, The Hebrew University of Jerusalem, Jerusalem, Israel","institution_ids":["https://openalex.org/I197251160"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5041315596"],"corresponding_institution_ids":["https://openalex.org/I197251160"],"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/T11152","display_name":"Stochastic processes and statistical mechanics","score":0.5199999809265137,"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.5199999809265137,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.27709999680519104,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.04430000111460686,"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":[],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8222000002861023},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8163999915122986},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.635699987411499},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.6147000193595886},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5300999879837036},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5224000215530396},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4641000032424927},{"id":"https://openalex.org/C125080357","wikidata":"https://www.wikidata.org/wiki/Q45715","display_name":"Complete graph","level":3,"score":0.45809999108314514},{"id":"https://openalex.org/C7321624","wikidata":"https://www.wikidata.org/wiki/Q205","display_name":"Infinity","level":2,"score":0.39149999618530273},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.3578000068664551},{"id":"https://openalex.org/C2777724877","wikidata":"https://www.wikidata.org/wiki/Q2548661","display_name":"Crossing number (knot theory)","level":3,"score":0.34700000286102295},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.3447999954223633},{"id":"https://openalex.org/C179254644","wikidata":"https://www.wikidata.org/wiki/Q13222844","display_name":"Moment (physics)","level":2,"score":0.32010000944137573},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.31540000438690186},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.3127000033855438},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.30489999055862427},{"id":"https://openalex.org/C58228413","wikidata":"https://www.wikidata.org/wiki/Q15704639","display_name":"Induced path","level":5,"score":0.2955999970436096},{"id":"https://openalex.org/C141042865","wikidata":"https://www.wikidata.org/wiki/Q200125","display_name":"Expected value","level":2,"score":0.27730000019073486},{"id":"https://openalex.org/C80763892","wikidata":"https://www.wikidata.org/wiki/Q958394","display_name":"Hypercube graph","level":5,"score":0.27639999985694885},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.26899999380111694}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.5281/zenodo.24143541","doi":"https://doi.org/10.5281/zenodo.24143541","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.24143541","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},{"id":"doi:10.5281/zenodo.24143542","doi":"https://doi.org/10.5281/zenodo.24143542","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.24143542","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.5281/zenodo.24143541","doi":"https://doi.org/10.5281/zenodo.24143541","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.24143541","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Give":[0],"the":[1,4,17,44,76,80,106,131,138],"edges":[2,21,96],"of":[3,20,22,79,83,85,92,109,130,133,140],"complete":[5],"graph":[6],"on":[7,137],"$n$":[8],"vertices":[9,86],"independent":[10],"exponential":[11],"weights":[12],"and":[13,31,69,120],"let":[14],"$M_n$":[15,141],"be":[16],"largest":[18],"number":[19,82,111],"a":[23,89],"minimum-weight":[24,90],"path":[25,91],"between":[26],"two":[27],"vertices.":[28],"Addario-Berry,":[29],"Broutin":[30],"Lugosi":[32],"proved":[33],"that":[34,53,102,122],"$M_n/\\log":[35],"n\\to\\alpha$":[36],"in":[37,67],"probability,":[38],"where":[39,60],"$\\alpha\\approx3.5911$":[40],"solves":[41],"$\\alpha\\log\\alpha-\\alpha=1$,":[42],"with":[43],"bounds":[45],"$\\alpha\\log":[46],"n-L\\log\\log":[47],"n\\le":[48],"M_n\\le\\alpha\\log":[49],"n+\\omega(n)$.":[50],"We":[51,73],"prove":[52,121],"$\\mathbb{P}(M_n\\ge":[54],"b_n+x)\\le":[55],"C\\alpha^{-x}$":[56],"for":[57,124],"all":[58],"$x\\ge0$,":[59],"$b_n=\\alpha\\log":[61],"n-(\\log\\log":[62],"n)/(2\\log\\alpha)$.":[63],"Hence":[64],"$M_n-\\alpha\\log":[65],"n\\to-\\infty$":[66],"probability":[68],"$\\mathbb{E}":[70],"M_n\\le":[71],"b_n+O(1)$.":[72],"also":[74],"find":[75],"asymptotic":[77],"value":[78],"expected":[81],"pairs":[84],"joined":[87],"by":[88],"at":[93,103],"least":[94],"$k$":[95],"when":[97],"$k=\\alpha\\log":[98],"n+O(\\log\\log":[99],"n)$,":[100],"show":[101],"$k=\\lceil":[104],"b_n\\rceil$":[105],"second":[107],"moment":[108],"this":[110],"tends":[112],"to":[113],"infinity":[114],"although":[115],"its":[116],"mean":[117],"stays":[118,142],"bounded,":[119],"$\\mathbb{P}(M_n=n-1)=n/(2\\,(n-1)!)$":[123],"every":[125],"$n\\ge2$.":[126],"The":[127],"lower":[128],"side":[129],"question":[132],"van":[134],"der":[135],"Hofstad":[136],"fluctuations":[139],"open.":[143]},"counts_by_year":[],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2026-11-12T00:00:00"}