{"id":"https://openalex.org/W6966313752","doi":"https://doi.org/10.4230/lipics.sand.2024.27","title":"Brief Announcement: On the Existence of \u03b4-Temporal Cliques in Random Simple Temporal Graphs","display_name":"Brief Announcement: On the Existence of \u03b4-Temporal Cliques in Random Simple Temporal Graphs","publication_year":2024,"publication_date":"2024-01-01","ids":{"openalex":"https://openalex.org/W6966313752","doi":"https://doi.org/10.4230/lipics.sand.2024.27"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:19905","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.27","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol292-sand2024/LIPIcs.SAND.2024.27/LIPIcs.SAND.2024.27.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"","raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol292-sand2024/LIPIcs.SAND.2024.27/LIPIcs.SAND.2024.27.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Mertzios, George B.","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":true,"raw_author_name":"Mertzios, George B.","raw_affiliation_strings":["Department of Computer Science, Durham University, UK"],"raw_orcid":"https://orcid.org/0000-0001-7182-585X","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Durham University, UK","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Nikoletseas, Sotiris","orcid":"https://orcid.org/0000-0003-3765-5636"},"institutions":[{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Nikoletseas, Sotiris","raw_affiliation_strings":["Computer Engineering and Informatics Department, University of Patras, Greece"],"raw_orcid":"https://orcid.org/0000-0003-3765-5636","affiliations":[{"raw_affiliation_string":"Computer Engineering and Informatics Department, University of Patras, Greece","institution_ids":["https://openalex.org/I174878644"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Raptopoulos, Christoforos","orcid":"https://orcid.org/0000-0002-9837-2632"},"institutions":[{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Raptopoulos, Christoforos","raw_affiliation_strings":["Department of Mathematics, University of Patras, Greece"],"raw_orcid":"https://orcid.org/0000-0002-9837-2632","affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Patras, Greece","institution_ids":["https://openalex.org/I174878644"]}]},{"author_position":"last","author":{"id":null,"display_name":"Spirakis, Paul G.","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":"Spirakis, Paul G.","raw_affiliation_strings":["Department of Computer Science, University of Liverpool, UK"],"raw_orcid":"https://orcid.org/0000-0001-5396-3749","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Liverpool, UK","institution_ids":["https://openalex.org/I146655781"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I190082696"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.46404073,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9562000036239624,"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.9562000036239624,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.009800000116229057,"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.0066999997943639755,"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/random-graph","display_name":"Random graph","score":0.67330002784729},{"id":"https://openalex.org/keywords/random-regular-graph","display_name":"Random regular graph","score":0.52920001745224},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.4893999993801117},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4489000141620636},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.428600013256073},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4223000109195709},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4189999997615814},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.4097000062465668},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.37049999833106995}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7669000029563904},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7383000254631042},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.67330002784729},{"id":"https://openalex.org/C4255713","wikidata":"https://www.wikidata.org/wiki/Q7291988","display_name":"Random regular graph","level":5,"score":0.52920001745224},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5194000005722046},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.4893999993801117},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4489000141620636},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.428600013256073},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4223000109195709},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4189999997615814},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.4097000062465668},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.37049999833106995},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.36880001425743103},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.35760000348091125},{"id":"https://openalex.org/C189239283","wikidata":"https://www.wikidata.org/wiki/Q17101022","display_name":"Clique graph","level":5,"score":0.34470000863075256},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.31450000405311584},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.30250000953674316},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.29660001397132874},{"id":"https://openalex.org/C5737132","wikidata":"https://www.wikidata.org/wiki/Q1101814","display_name":"Clique-width","level":5,"score":0.2937999963760376},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.2847999930381775},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.27230000495910645},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.2687999904155731},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.2583000063896179},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.2502000033855438}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:19905","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.27","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol292-sand2024/LIPIcs.SAND.2024.27/LIPIcs.SAND.2024.27.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"","raw_type":"InProceedings"},{"id":"pmh:oai:durham-repository.worktribe.com:2431671","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/2431671","pdf_url":"https://durham-repository.worktribe.com/file/2431671/1/Published%20Conference%20Proceeding","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":"publishedVersion"},{"id":"doi:10.4230/lipics.sand.2024.27","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.sand.2024.27","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:19905","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.27","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol292-sand2024/LIPIcs.SAND.2024.27/LIPIcs.SAND.2024.27.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"","raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5260088266","display_name":"Algorithmic Aspects of Temporal Graphs","funder_award_id":"EP/P02002X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G6811041424","display_name":"Algorithmic Aspects of Temporal Graphs","funder_award_id":"EP/P020372/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320327859","display_name":"Hellenic Foundation for Research and Innovation","ror":null},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W6966313752.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,154],"consider":[1],"random":[2,54,96,111,116],"simple":[3,97],"temporal":[4,98],"graphs":[5,117],"in":[6,53,125],"which":[7,104],"every":[8],"edge":[9],"of":[10,37,56,74,113,121,134,175],"the":[11,18,35,66,72,95,114,119,122,126,130,135,139,145],"complete":[12],"graph":[13,99],"K_n":[14],"appears":[15],"once":[16],"within":[17,51],"time":[19,163],"interval":[20,147],"[0,1]":[21],"independently":[22],"and":[23,129],"uniformly":[24],"at":[25,47],"random.":[26],"Our":[27],"main":[28],"result":[29,157],"is":[30,78,91,151,168],"a":[31,42,75,149],"sharp":[32],"threshold":[33],"on":[34],"size":[36,73,120,133],"any":[38,60,161],"maximum":[39,76,123,131],"\u03b4-clique":[40,77,124,150],"(namely":[41],"clique":[43,132],"with":[44,84],"edges":[45],"appearing":[46],"most":[48],"\u03b4":[49],"apart":[50],"[0,1])":[52],"instances":[55,112],"this":[57,156],"model,":[58,118],"for":[59,165],"constant":[61],"\u03b4.":[62],"In":[63],"particular,":[64],"using":[65],"probabilistic":[67],"method,":[68],"we":[69,142],"prove":[70],"that":[71,144,160],"approximately":[79,138],"(2":[80],"log":[81],"n)/(log":[82],"1/\u03b4)":[83],"high":[85],"probability":[86,174],"(whp).":[87],"What":[88],"seems":[89],"surprising":[90],"that,":[92],"even":[93],"though":[94],"contains":[100],"\u0398(n\u00b2)":[101],"overlapping":[102],"\u03b4-windows,":[103],"(when":[105],"viewed":[106],"separately)":[107],"correspond":[108],"to":[109,158,170],"different":[110],"Erd\u0151s-R\u00e9nyi":[115],"former":[127],"model":[128],"latter":[136],"are":[137],"same.":[140],"Furthermore,":[141],"show":[143,159],"minimum":[146],"containing":[148],"\u03b4-o(\u03b4)":[152],"whp.":[153],"use":[155],"polynomial":[162],"algorithm":[164],"\u03b4-Temporal":[166],"Clique":[167],"unlikely":[169],"have":[171],"very":[172],"large":[173],"success.":[176]},"counts_by_year":[],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}