{"id":"https://openalex.org/W2156555546","doi":"https://doi.org/10.1145/2612669.2612693","title":"Ephemeral networks with random availability of links","display_name":"Ephemeral networks with random availability of links","publication_year":2014,"publication_date":"2014-06-21","ids":{"openalex":"https://openalex.org/W2156555546","doi":"https://doi.org/10.1145/2612669.2612693","mag":"2156555546"},"language":"en","primary_location":{"id":"doi:10.1145/2612669.2612693","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2612669.2612693","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://durham-repository.worktribe.com/output/1155634","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007555796","display_name":"Eleni C. Akrida","orcid":"https://orcid.org/0000-0002-1126-1623"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Eleni C. Akrida","raw_affiliation_strings":["University of Liverpool, Liverpool, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Liverpool, Liverpool, United Kingdom","institution_ids":["https://openalex.org/I146655781"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052366414","display_name":"Leszek G\u0105sieniec","orcid":"https://orcid.org/0000-0003-1809-9814"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Leszek Gasieniec","raw_affiliation_strings":["University of Liverpool, Liverpool, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Liverpool, Liverpool, United Kingdom","institution_ids":["https://openalex.org/I146655781"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018078197","display_name":"George B. Mertzios","orcid":"https://orcid.org/0000-0001-7182-585X"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"George B. Mertzios","raw_affiliation_strings":["Durham University, UK, Durham, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Durham University, UK, Durham, United Kingdom","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011756177","display_name":"Paul G. Spirakis","orcid":"https://orcid.org/0000-0001-5396-3749"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Paul G. Spirakis","raw_affiliation_strings":["University of Liverpool, Liverpool, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Liverpool, Liverpool, United Kingdom","institution_ids":["https://openalex.org/I146655781"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5007555796"],"corresponding_institution_ids":["https://openalex.org/I146655781"],"apc_list":null,"apc_paid":null,"fwci":4.3165,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.94877831,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"6","issue":null,"first_page":"267","last_page":"276"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9998999834060669,"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9998999834060669,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9976000189781189,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.9958000183105469,"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/randomness","display_name":"Randomness","score":0.6978148818016052},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6035505533218384},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5513316988945007},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.5449272394180298},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4589383006095886},{"id":"https://openalex.org/keywords/ephemeral-key","display_name":"Ephemeral key","score":0.4422135055065155},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.43609383702278137},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4227580428123474},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4226461350917816},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.414995402097702},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40228158235549927},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24101191759109497},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12950772047042847},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.12281113862991333},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11619877815246582}],"concepts":[{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.6978148818016052},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6035505533218384},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5513316988945007},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.5449272394180298},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4589383006095886},{"id":"https://openalex.org/C76947770","wikidata":"https://www.wikidata.org/wiki/Q4533181","display_name":"Ephemeral key","level":2,"score":0.4422135055065155},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.43609383702278137},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4227580428123474},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4226461350917816},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.414995402097702},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40228158235549927},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24101191759109497},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12950772047042847},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.12281113862991333},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11619877815246582},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2612669.2612693","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2612669.2612693","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:dro.dur.ac.uk.OAI2:13473","is_oa":false,"landing_page_url":"http://dro.dur.ac.uk/13473/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196258","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Blelloch, Guy & Sanders, Peter (Eds.). (2014). Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures. New York, NY, USA: Association for Computing Machinery, pp. 267-276","raw_type":"Book chapter"},{"id":"pmh:oai:durham-repository.worktribe.com:1155634","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1155634","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"acceptedVersion"}],"best_oa_location":{"id":"pmh:oai:durham-repository.worktribe.com:1155634","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1155634","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"acceptedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6214505137","display_name":null,"funder_award_id":"EP/K022660/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G7325551107","display_name":"Algorithmic Aspects of Intersection Graph Models","funder_award_id":"EP/K022660/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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W390146837","https://openalex.org/W1496893056","https://openalex.org/W1746637951","https://openalex.org/W1847535063","https://openalex.org/W1945448203","https://openalex.org/W1970075049","https://openalex.org/W1983815693","https://openalex.org/W1984196269","https://openalex.org/W1984697505","https://openalex.org/W2004308928","https://openalex.org/W2006162221","https://openalex.org/W2029823601","https://openalex.org/W2038562061","https://openalex.org/W2039657689","https://openalex.org/W2048610995","https://openalex.org/W2059014957","https://openalex.org/W2070755358","https://openalex.org/W2086991377","https://openalex.org/W2103485813","https://openalex.org/W2105431882","https://openalex.org/W2120741723","https://openalex.org/W2120957127","https://openalex.org/W2139539283","https://openalex.org/W2155704505","https://openalex.org/W2157004711","https://openalex.org/W2189567298","https://openalex.org/W2217013297","https://openalex.org/W2706788079","https://openalex.org/W2905110430","https://openalex.org/W4210634265","https://openalex.org/W4237496336","https://openalex.org/W4312512934","https://openalex.org/W4389615622","https://openalex.org/W4389615669","https://openalex.org/W6659431881"],"related_works":["https://openalex.org/W4289599811","https://openalex.org/W1972252235","https://openalex.org/W4308671133","https://openalex.org/W2125057284","https://openalex.org/W4316652277","https://openalex.org/W2952711994","https://openalex.org/W1586535663","https://openalex.org/W2073918695","https://openalex.org/W4298162383","https://openalex.org/W4300812862"],"abstract_inverted_index":{"In":[0,86,191],"this":[1,206,356,378],"work":[2],"we":[3,165,193,354,380,390],"consider":[4,284],"temporal":[5,19,46,95,176,248,275,307,370],"networks,":[6,50,88],"the":[7,41,75,82,99,134,142,167,170,174,218,221,241,247,251,257,268,274,285,315,319,322,382,385],"links":[8,27],"of":[9,40,66,71,101,109,122,144,169,250,270,289,312,314,330,350,363,365,375,384,387],"which":[10,81,102,123,295,326],"are":[11,23,54,103,233],"available":[12,18,128],"only":[13,30,129,239,323],"at":[14,31,80,294,304],"random":[15,59,131,175,222,290],"times":[16],"(randomly":[17],"networks).":[20],"Our":[21,225,230],"networks":[22,47,349],"{\\em":[24],"ephemeral}:":[25],"their":[26],"appear":[28],"sporadically,":[29],"certain":[32],"times,":[33],"within":[34],"a":[35,64,105,114,118,149,152,160,263,306,369],"given":[36],"maximum":[37],"time":[38,79,132,135,293],"(lifetime":[39],"net).":[42],"More":[43],"specifically,":[44],"our":[45],"notion":[48,168,383],"concerns":[49],"whose":[51],"edges":[52,100],"(arcs)":[53],"assigned":[55,104],"one":[56,130,328],"or":[57],"more":[58],"discrete-time":[60],"labels":[61,70,364],"drawn":[62],"from":[63],"set":[65],"natural":[67],"numbers.":[68],"The":[69],"an":[72,296,359,392],"edge":[73,83,121,297],"indicate":[74],"discrete":[76],"moments":[77],"in":[78,133,158,189,205,292,300],"is":[84,124,141,182,198,215,228,237,253,264,298,321,343],"available.":[85],"such":[87,159],"information":[89,196],"(e.g.,":[90],"messages)":[91],"have":[92],"to":[93,126,154,211,217,302,358],"follow":[94],"paths,":[96,98],"i.e.,":[97],"strictly":[106],"increasing":[107],"sequence":[108],"labels.":[110],"We":[111,243,339],"first":[112],"examine":[113],"very":[115,199],"hostile":[116,207],"network:":[117],"clique,":[119],"each":[120],"known":[125],"be":[127,278],"period":[136],"{1,2,":[137],"...,":[138],"n}":[139],"(n":[140],"number":[143,269],"vertices).":[145],"How":[146],"fast":[147,200],"can":[148],"vertex":[150],"send":[151],"message":[153],"all":[155],"other":[156],"vertices":[157,313],"network?":[161],"To":[162],"answer":[163],"this,":[164],"define":[166],"Temporal":[171],"Diameter":[172],"for":[173,220,325,337,347,395],"clique":[177,252,320],"and":[178,188,235,389],"prove":[179],"that":[180,195,246,318,341,367],"it":[181],"\u0398(log":[183],"n)":[184,345],"with":[185,201,209],"high":[186,202],"probability":[187,203],"expectation.":[190],"fact,":[192],"show":[194,244,340,391],"dissemination":[197],"even":[204,334,346],"network":[208,316,324],"regard":[210],"availability.":[212],"This":[213],"result":[214],"similar":[216],"results":[219],"phone-call":[223],"model.":[224],"model,":[226],"though,":[227],"weaker.":[229],"availability":[231,331,366],"assumptions":[232],"different":[234],"randomness":[236],"provided":[238],"by":[240,256],"input.":[242],"here":[245],"diameter":[249,276,351],"crucially":[254],"affected":[255],"clique's":[258],"lifetime,":[259],"a,":[260],"e.g.,":[261],"when":[262],"asymptotically":[265],"larger":[266],"than":[267],"vertices,":[271],"n,":[272],"then":[273],"must":[277],"\u03a9(a/nlog":[279],"n":[280],").":[281],"We,":[282],"then,":[283],"least":[286,305],"number,":[287],"r,":[288],"points":[291],"available,":[299],"order":[301],"guarantee":[303],"path":[308,371],"between":[309,372],"any":[310,373],"pair":[311,374],"(notice":[317],"just":[327],"instance":[329],"per":[332],"edge,":[333],"non-random,":[335],"suffices":[336],"this).":[338],"r":[342],"\u03a9(log":[344],"some":[348],"2.":[352],"Finally,":[353],"compare":[355],"cost":[357],"(optimal)":[360],"deterministic":[361],"allocation":[362],"guarantees":[368],"vertices.":[376],"For":[377],"reason,":[379],"introduce":[381],"Price":[386],"Randomness":[388],"upper":[393],"bound":[394],"general":[396],"networks.":[397]},"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2016-06-24T00:00:00"}