{"id":"https://openalex.org/W2100172709","doi":"https://doi.org/10.1017/s096354831100023x","title":"First Passage Percolation on the Erd\u0151s\u2013R\u00e9nyi Random Graph","display_name":"First Passage Percolation on the Erd\u0151s\u2013R\u00e9nyi Random Graph","publication_year":2011,"publication_date":"2011-06-20","ids":{"openalex":"https://openalex.org/W2100172709","doi":"https://doi.org/10.1017/s096354831100023x","mag":"2100172709"},"language":"en","primary_location":{"id":"doi:10.1017/s096354831100023x","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s096354831100023x","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":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032815468","display_name":"Shankar Bhamidi","orcid":"https://orcid.org/0009-0000-3953-936X"},"institutions":[{"id":"https://openalex.org/I114027177","display_name":"University of North Carolina at Chapel Hill","ror":"https://ror.org/0130frc33","country_code":"US","type":"education","lineage":["https://openalex.org/I114027177"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"SHANKAR BHAMIDI","raw_affiliation_strings":["Department of Statistics and Operations Research, 304 Hanes Hall, University of North Carolina, Chapel Hill, NC 27599, USA (e-mail:","Department of statistics and operations research, 304 hanes hall, university of north carolina, chapel hill, nc 27599, usa (e-mail: bhamidi@email.unc.edu)#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Statistics and Operations Research, 304 Hanes Hall, University of North Carolina, Chapel Hill, NC 27599, USA (e-mail:","institution_ids":["https://openalex.org/I114027177"]},{"raw_affiliation_string":"Department of statistics and operations research, 304 hanes hall, university of north carolina, chapel hill, nc 27599, usa (e-mail: bhamidi@email.unc.edu)#TAB#","institution_ids":["https://openalex.org/I114027177"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034587660","display_name":"Remco van der Hofstad","orcid":"https://orcid.org/0000-0003-1331-9697"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"REMCO VAN DER HOFSTAD","raw_affiliation_strings":["Department of Mathematics and Computer Science, Eindhoven University of Technology, PO Box 513, 5600 MB Eindhoven, The Netherlands (e-mail:","Department of Mathematics and Computer Science, Eindhoven University of Technology, PO Box 513, 5600 MB Eindhoven, The Netherlands (e-mail: rhofstad@win.tue.nl)#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Eindhoven University of Technology, PO Box 513, 5600 MB Eindhoven, The Netherlands (e-mail:","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science, Eindhoven University of Technology, PO Box 513, 5600 MB Eindhoven, The Netherlands (e-mail: rhofstad@win.tue.nl)#TAB#","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077651434","display_name":"Gerard Hooghiemstra","orcid":null},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"GERARD HOOGHIEMSTRA","raw_affiliation_strings":["DIAM, Delft University of Technology, Mekelweg 4, 2628CD Delft, The Netherlands (e-mail:","Diam, delft university of technology, mekelweg 4, 2628cd delft, the netherlands (e-mail: g.hooghiemstra@tudelft.nl)#TAB#"],"affiliations":[{"raw_affiliation_string":"DIAM, Delft University of Technology, Mekelweg 4, 2628CD Delft, The Netherlands (e-mail:","institution_ids":["https://openalex.org/I98358874"]},{"raw_affiliation_string":"Diam, delft university of technology, mekelweg 4, 2628cd delft, the netherlands (e-mail: g.hooghiemstra@tudelft.nl)#TAB#","institution_ids":["https://openalex.org/I98358874"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5032815468"],"corresponding_institution_ids":["https://openalex.org/I114027177"],"apc_list":null,"apc_paid":null,"fwci":6.5562,"has_fulltext":false,"cited_by_count":57,"citation_normalized_percentile":{"value":0.97890061,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"20","issue":"5","first_page":"683","last_page":"707"},"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/T11716","display_name":"Random Matrices and Applications","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9944000244140625,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"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/combinatorics","display_name":"Combinatorics","score":0.8150972723960876},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.767035961151123},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.5333162546157837},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5045088529586792},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.4998588562011719},{"id":"https://openalex.org/keywords/central-limit-theorem","display_name":"Central limit theorem","score":0.48944154381752014},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42124372720718384},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.41650065779685974},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4138030707836151},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.2242826521396637},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.21654385328292847},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10473516583442688},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.09662342071533203}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8150972723960876},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.767035961151123},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.5333162546157837},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5045088529586792},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.4998588562011719},{"id":"https://openalex.org/C166785042","wikidata":"https://www.wikidata.org/wiki/Q190391","display_name":"Central limit theorem","level":2,"score":0.48944154381752014},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42124372720718384},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.41650065779685974},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4138030707836151},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.2242826521396637},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.21654385328292847},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10473516583442688},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.09662342071533203}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1017/s096354831100023x","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s096354831100023x","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:pure.tue.nl:openaire_cris_publications/2a9af71f-cf03-412b-a8d2-4df51857ba7d","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/2a9af71f-cf03-412b-a8d2-4df51857ba7d","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bhamidi, S, Hofstad, van der, R W & Hooghiemstra, G 2011, 'First passage percolation on the Erd\u00f6s-R\u00e9nyi random graph', Combinatorics, Probability and Computing, vol. 20, no. 5, pp. 683-707. https://doi.org/10.1017/S096354831100023X","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:tudelft.nl:uuid:3c084fc2-8251-4548-bb9d-3658b811a2ad","is_oa":false,"landing_page_url":"http://resolver.tudelft.nl/uuid:3c084fc2-8251-4548-bb9d-3658b811a2ad","pdf_url":null,"source":{"id":"https://openalex.org/S4306400906","display_name":"Research Repository (Delft University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98358874","host_organization_name":"Delft University of Technology","host_organization_lineage":["https://openalex.org/I98358874"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"journal article"},{"id":"pmh:tue:oai:pure.tue.nl:publications/2a9af71f-cf03-412b-a8d2-4df51857ba7d","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/2a9af71f-cf03-412b-a8d2-4df51857ba7d","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Combinatorics, Probability and Computing, 20(5), 683 - 707. Cambridge University Press","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W78433401","https://openalex.org/W99540261","https://openalex.org/W571014280","https://openalex.org/W606269881","https://openalex.org/W619565225","https://openalex.org/W1520007244","https://openalex.org/W1580588137","https://openalex.org/W2005394933","https://openalex.org/W2013240448","https://openalex.org/W2031541804","https://openalex.org/W2062102322","https://openalex.org/W2073811812","https://openalex.org/W2130956934","https://openalex.org/W2132565565","https://openalex.org/W2134865468","https://openalex.org/W2138146164","https://openalex.org/W2165341195","https://openalex.org/W2290127356","https://openalex.org/W2478722229","https://openalex.org/W2501164176","https://openalex.org/W2799087070","https://openalex.org/W2802739963","https://openalex.org/W2804417073","https://openalex.org/W2964161254","https://openalex.org/W3105104202","https://openalex.org/W3144881883","https://openalex.org/W3150304496","https://openalex.org/W4250665764","https://openalex.org/W4300093168"],"related_works":["https://openalex.org/W3209044284","https://openalex.org/W4289128375","https://openalex.org/W2905560808","https://openalex.org/W1994644433","https://openalex.org/W4385501637","https://openalex.org/W2064737922","https://openalex.org/W2382250366","https://openalex.org/W1578001576","https://openalex.org/W1549783832","https://openalex.org/W2046496468"],"abstract_inverted_index":{"In":[0,36],"this":[1,83],"paper":[2,280],"we":[3,21,49,89,113],"explore":[4],"first":[5],"passage":[6],"percolation":[7],"(FPP)":[8],"on":[9,82,253,295,316],"the":[10,34,37,55,59,66,73,78,96,116,132,144,167,170,174,179,184,248,266,274,282,293,296,302,317],"Erd\u0151s\u2013R\u00e9nyi":[11,318],"random":[12,24,163,319],"graph":[13,146,151,320],"G":[14],"n":[15,18,44,108,122,137,160,177,188,191,193,203,206,208,213,216,218,230,239,255],"(":[16,75,201],"p":[17,187],"),":[19],"where":[20,135,211],"assign":[22],"independent":[23],"weights,":[25],"having":[26],"an":[27],"exponential":[28],"distribution":[29],"with":[30,98],"rate":[31],"1,":[32,48],"to":[33,105,292,310],"edges.":[35],"sparse":[38],"regime,":[39,134],"i.e.":[40,76],",":[41,77,189,210,241],"when":[42,237],"np":[43,136],"\u2192":[45,138,194],"\u03bb":[46,215,238,254],"&gt;":[47],"find":[50,141,262],"refined":[51],"asymptotics":[52],"both":[53,103],"for":[54,72,95,265],"minimal":[56,84,117],"weight":[57,85,118,276],"of":[58,80,169,186,271,273,284],"path":[60],"between":[61,153,314],"uniformly":[62,154],"chosen":[63,155],"vertices":[64,156],"in":[65,127,196,247,257,287,300],"giant":[67],"component,":[68],"as":[69,71],"well":[70],"hopcount":[74,175],"number":[79],"edges)":[81],"path.":[86],"More":[87],"precisely,":[88,200],"prove":[90,114],"a":[91,222,242,311],"central":[92],"limit":[93],"theorem":[94],"hopcount,":[97],"asymptotic":[99],"mean":[100],"and":[101,277,289,321],"variance":[102],"equal":[104],"(\u03bb":[106],"log":[107,207],")/(\u03bb":[109,123],"\u2212":[110,124,204,219],"1).":[111],"Furthermore,":[112],"that":[115,142,150,182,244],"centred":[119],"by":[120,234],"(log":[121,159],"1)":[125],"converges":[126],"distribution.":[128,226],"We":[129,140,260],"also":[130,261],"investigate":[131],"dense":[133],"\u221e.":[139],"although":[143],"base":[145],"is":[147],"ultra-small":[148],"(meaning":[149],"distances":[152],"are":[157,306],"o":[158],")),":[161],"attaching":[162],"edge":[164],"weights":[165],"changes":[166],"geometry":[168],"network":[171],"completely.":[172],"Indeed,":[173],"H":[176,190,202],"satisfies":[178],"universality":[180],"property":[181],"whatever":[183],"value":[185],"/log":[192],"1":[195,235],"probability":[197],"and,":[198],"more":[199],"\u03b2":[205,212,229],")/":[209],"=":[214],"/(\u03bb":[217],"1),":[220],"has":[221,245],"limiting":[223],"standard":[224],"normal":[225],"The":[227],"constant":[228],"can":[231],"be":[232],"replaced":[233],"precisely":[236],"\u226b":[240],"case":[243],"appeared":[246],"literature":[249],"(under":[250],"stronger":[251],"conditions":[252],")":[256],"[4,":[258],"13].":[259],"lower":[263],"bounds":[264],"maximum,":[267],"over":[268],"all":[269],"pairs":[270],"vertices,":[272],"optimal":[275],"hopcount.":[278],"This":[279],"continues":[281],"investigation":[283],"FPP":[285,315],"initiated":[286],"[4]":[288],"[5].":[290],"Compared":[291],"setting":[294],"configuration":[297],"model":[298],"studied":[299],"[5],":[301],"proofs":[303],"presented":[304],"here":[305],"much":[307],"simpler":[308],"due":[309],"direct":[312],"relation":[313],"thinned":[322],"continuous-time":[323],"branching":[324],"processes.":[325]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}
