{"id":"https://openalex.org/W2026985208","doi":"https://doi.org/10.1145/1148109.1148145","title":"Towards small world emergence","display_name":"Towards small world emergence","publication_year":2006,"publication_date":"2006-07-30","ids":{"openalex":"https://openalex.org/W2026985208","doi":"https://doi.org/10.1145/1148109.1148145","mag":"2026985208"},"language":"en","primary_location":{"id":"doi:10.1145/1148109.1148145","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1148109.1148145","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},"type":"conference-paper","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/A5018101364","display_name":"Philippe Duchon","orcid":null},"institutions":[{"id":"https://openalex.org/I4210142254","display_name":"Laboratoire Bordelais de Recherche en Informatique","ror":"https://ror.org/03adqg323","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210159245","https://openalex.org/I4210160189"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Philippe Duchon","raw_affiliation_strings":["Domaine universitaire, cours de la lib\u00e9ration, Talence Cedex, France","Algorithmics for computationally intensive applications over wide scale distributed platforms","Laboratoire Bordelais de Recherche en Informatique"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Domaine universitaire, cours de la lib\u00e9ration, Talence Cedex, France","institution_ids":[]},{"raw_affiliation_string":"Algorithmics for computationally intensive applications over wide scale distributed platforms","institution_ids":[]},{"raw_affiliation_string":"Laboratoire Bordelais de Recherche en Informatique","institution_ids":["https://openalex.org/I4210142254"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047477217","display_name":"Nicolas Hanusse","orcid":null},"institutions":[{"id":"https://openalex.org/I4210142254","display_name":"Laboratoire Bordelais de Recherche en Informatique","ror":"https://ror.org/03adqg323","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210159245","https://openalex.org/I4210160189"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nicolas Hanusse","raw_affiliation_strings":["Domaine universitaire, cours de la lib\u00e9ration, Talence Cedex, France","Laboratoire Bordelais de Recherche en Informatique","Algorithmics for computationally intensive applications over wide scale distributed platforms"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Domaine universitaire, cours de la lib\u00e9ration, Talence Cedex, France","institution_ids":[]},{"raw_affiliation_string":"Laboratoire Bordelais de Recherche en Informatique","institution_ids":["https://openalex.org/I4210142254"]},{"raw_affiliation_string":"Algorithmics for computationally intensive applications over wide scale distributed platforms","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054435097","display_name":"Emmanuelle Lebhar","orcid":null},"institutions":[{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I4210144566","display_name":"Laboratoire de l'Informatique du Parall\u00e9lisme","ror":"https://ror.org/04msnz457","country_code":"FR","type":"facility","lineage":["https://openalex.org/I100532134","https://openalex.org/I113428412","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I203339264","https://openalex.org/I203339264","https://openalex.org/I4210144566"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Emmanuelle Lebhar","raw_affiliation_strings":["LIP, ENS Lyon, all\u00e9e d'Italie, Lyon Cedex, France","Laboratoire de l'Informatique du Parall\u00e9lisme"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIP, ENS Lyon, all\u00e9e d'Italie, Lyon Cedex, France","institution_ids":["https://openalex.org/I113428412"]},{"raw_affiliation_string":"Laboratoire de l'Informatique du Parall\u00e9lisme","institution_ids":["https://openalex.org/I4210144566"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109853555","display_name":"Nicolas Schabanel","orcid":null},"institutions":[{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I4210144566","display_name":"Laboratoire de l'Informatique du Parall\u00e9lisme","ror":"https://ror.org/04msnz457","country_code":"FR","type":"facility","lineage":["https://openalex.org/I100532134","https://openalex.org/I113428412","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I203339264","https://openalex.org/I203339264","https://openalex.org/I4210144566"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nicolas Schabanel","raw_affiliation_strings":["LIP, ENS Lyon, all\u00e9e d'Italie, Lyon Cedex, France","Laboratoire de l'Informatique du Parall\u00e9lisme"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIP, ENS Lyon, all\u00e9e d'Italie, Lyon Cedex, France","institution_ids":["https://openalex.org/I113428412"]},{"raw_affiliation_string":"Laboratoire de l'Informatique du Parall\u00e9lisme","institution_ids":["https://openalex.org/I4210144566"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"225","last_page":"232"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9972000122070312,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.9970999956130981,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.7680220603942871},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5808329582214355},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5310989618301392},{"id":"https://openalex.org/keywords/average-path-length","display_name":"Average path length","score":0.5157456994056702},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.49048516154289246},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4854729473590851},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.48080721497535706},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.4686443507671356},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46754661202430725},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4314529299736023},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4277622699737549},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.42126908898353577},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4162631034851074},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.1723853349685669},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.16784217953681946},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.15034466981887817}],"concepts":[{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.7680220603942871},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5808329582214355},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5310989618301392},{"id":"https://openalex.org/C91886571","wikidata":"https://www.wikidata.org/wiki/Q432520","display_name":"Average path length","level":4,"score":0.5157456994056702},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.49048516154289246},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4854729473590851},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.48080721497535706},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.4686443507671356},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46754661202430725},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4314529299736023},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4277622699737549},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.42126908898353577},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4162631034851074},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.1723853349685669},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.16784217953681946},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.15034466981887817},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1148109.1148145","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1148109.1148145","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W45185860","https://openalex.org/W1486176979","https://openalex.org/W1573579329","https://openalex.org/W1599740739","https://openalex.org/W1605156262","https://openalex.org/W1967359086","https://openalex.org/W1994772769","https://openalex.org/W2020965855","https://openalex.org/W2034188144","https://openalex.org/W2045446569","https://openalex.org/W2056455770","https://openalex.org/W2058839687","https://openalex.org/W2107046847","https://openalex.org/W2120176025","https://openalex.org/W2128678576","https://openalex.org/W2141934596","https://openalex.org/W2142253242","https://openalex.org/W2154833764","https://openalex.org/W2158049821","https://openalex.org/W2163059190","https://openalex.org/W2164195254","https://openalex.org/W2295428206","https://openalex.org/W2613433911"],"related_works":["https://openalex.org/W2035522910","https://openalex.org/W2055932080","https://openalex.org/W4377371889","https://openalex.org/W2018076478","https://openalex.org/W1992470151","https://openalex.org/W2113623403","https://openalex.org/W2887154986","https://openalex.org/W1968512104","https://openalex.org/W78560857","https://openalex.org/W4206328227"],"abstract_inverted_index":{"We":[0,269],"investigate":[1],"the":[2,6,33,47,50,73,77,98,101,126,141,191,197,202,217,272,285,303],"problem":[3],"of":[4,9,55,61,76,97,103,128,143,168,193,205,214,222,236,274,287],"optimizing":[5],"routing":[7,209],"performance":[8],"a":[10,26,37,93,104,138,220,246,256,276,281,288,299],"virtual":[11],"network":[12,35,78],"by":[13,24],"adding":[14,25],"extra":[15,28],"random":[16],"links.":[17],"Our":[18,89],"asynchronous":[19],"and":[20,79,100,122,176,195,235],"distributed":[21,247],"algorithm":[22],"ensures,":[23],"single":[27],"link":[29],"per":[30,174],"node,":[31,187],"that":[32,271,293],"resulting":[34],"is":[36,83,135,190],"navigable":[38],"small":[39,68,257,304],"world,":[40],"i.e.,":[41,115],"in":[42,49,155,185,216,262,307],"which":[43,82],"greedy":[44,208],"routing,":[45],"using":[46],"distance":[48,131,146],"original":[51,206],"network,":[52,107,219],"computes":[53],"paths":[54],"polylogarithmic":[56,263,267],"length":[57,223,238],"between":[58,211],"any":[59,119,123,212,251],"pair":[60,213],"nodes":[62,99,129,144,215],"with":[63,152,162,201,230,259],"probability":[64,154,231,261],"1-O(1/n).":[65],"Previously":[66],"known":[67],"world":[69,258,305],"augmentation":[70,149],"processes":[71],"require":[72],"global":[74],"knowledge":[75,204],"centralized":[80],"computations,":[81],"unrealistic":[84],"for":[85,118,302],"large":[86,308],"decentralized":[87],"networks.":[88,311],"algorithm,":[90],"based":[91],"on":[92],"careful":[94],"multi-layer":[95],"sampling":[96],"construction":[102,291],"light":[105],"overlay":[106],"bypasses":[108],"these":[109],"limitations.":[110],"For":[111],"bounded":[112,252],"growth":[113,253],"graphs,":[114],"graphs":[116],"where,":[117],"node":[120,175],"u":[121,134],"radius":[124],"r":[125],"number":[127,142,192],"within":[130,145],"2r":[132],"from":[133],"at":[136,224],"most":[137,225],"constant":[139],"times":[140],"r,":[147],"our":[148],"process":[150,278,292],"proceeds":[151],"high":[153,260],"O(log":[156,163,170,179,239],"n":[157,164,180,189,227,240],"log":[158,165,181],"D)":[159,166,182,229],"communication":[160],"rounds,":[161],"messages":[167],"size":[169],"n)":[171],"bits":[172],"sent":[173],"requiring":[177,266],"only":[178,203],"bit":[183],"space":[184],"each":[186],"where":[188],"nodes,":[194],"D":[196],"diameter.":[198],"In":[199],"particular,":[200],"distances,":[207],"computes,":[210],"augmented":[218],"path":[221],"O(log2":[226],"log2":[228,241],"1":[232],"-":[233],"O(1/n),":[234],"expected":[237],"D).":[242],"Hence,":[243],"we":[244],"provide":[245],"scheme":[248],"to":[249],"augment":[250],"graph":[254],"into":[255],"time":[264],"while":[265],"memory.":[268],"consider":[270],"existence":[273],"such":[275],"lightweight":[277],"might":[279],"be":[280],"first":[282],"step":[283],"towards":[284],"definition":[286],"more":[289],"general":[290],"would":[294],"validate":[295],"Kleinberg's":[296],"model":[297],"as":[298],"plausible":[300],"explanation":[301],"phenomenon":[306],"real":[309],"interaction":[310]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-07-25T09:21:30.201066","created_date":"2025-10-10T00:00:00"}