{"id":"https://openalex.org/W7225174374","doi":"https://doi.org/10.48550/arxiv.2611.03457","title":"Expander Routing under Adversarial Deletions via Temporal Aggregation","display_name":"Expander Routing under Adversarial Deletions via Temporal Aggregation","publication_year":2026,"publication_date":"2026-11-02","ids":{"openalex":"https://openalex.org/W7225174374","doi":"https://doi.org/10.48550/arxiv.2611.03457"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2611.03457","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2611.03457","pdf_url":"https://arxiv.org/pdf/2611.03457","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2611.03457","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080591933","display_name":"Bernhard Haeupler","orcid":"https://orcid.org/0000-0003-3381-0459","observed_orcids":["https://orcid.org/0000-0003-3381-0459"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Haeupler, Bernhard","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5067587616","display_name":"Anton Paramonov","orcid":"https://orcid.org/0009-0000-0760-8746","observed_orcids":["https://orcid.org/0009-0000-0760-8746"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Paramonov, Anton","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.98580002784729,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.98580002784729,"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/T12288","display_name":"Optimization and Search Problems","score":0.003700000001117587,"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/T11269","display_name":"Algorithms and Data Compression","score":0.0008999999845400453,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/expander-graphs","display_name":"expander graphs","score":0.8360000252723694},{"id":"https://openalex.org/keywords/edge-deletion","display_name":"edge deletion","score":0.7580000162124634},{"id":"https://openalex.org/keywords/adaptive-adversaries","display_name":"adaptive adversaries","score":0.5720000267028809},{"id":"https://openalex.org/keywords/dilation","display_name":"dilation","score":0.8009999990463257},{"id":"https://openalex.org/keywords/congestion","display_name":"congestion","score":0.9010000228881836},{"id":"https://openalex.org/keywords/temporal-aggregation","display_name":"temporal aggregation","score":0.8360000252723694},{"id":"https://openalex.org/keywords/random-walks","display_name":"random walks","score":0.8149999976158142},{"id":"https://openalex.org/keywords/randomized-algorithms","display_name":"randomized algorithms","score":0.621999979019165}],"concepts":[{"id":"https://openalex.org/C2780757906","wikidata":"https://www.wikidata.org/wiki/Q5276676","display_name":"Dilation (metric space)","level":2,"score":0.683899998664856},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6258999705314636},{"id":"https://openalex.org/C154547637","wikidata":"https://www.wikidata.org/wiki/Q776602","display_name":"Expander graph","level":3,"score":0.5879999995231628},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5710999965667725},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5322999954223633},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4537999927997589},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4154999852180481},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40380001068115234},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.39309999346733093},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3659000098705292},{"id":"https://openalex.org/C24856439","wikidata":"https://www.wikidata.org/wiki/Q352483","display_name":"Adaptive routing","level":5,"score":0.36419999599456787},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.3553999960422516},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.3221000134944916},{"id":"https://openalex.org/C138236772","wikidata":"https://www.wikidata.org/wiki/Q25098575","display_name":"Edge device","level":3,"score":0.31859999895095825},{"id":"https://openalex.org/C195563490","wikidata":"https://www.wikidata.org/wiki/Q180368","display_name":"Network congestion","level":3,"score":0.29660001397132874},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.29319998621940613},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.29260000586509705},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.29030001163482666},{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.27900001406669617},{"id":"https://openalex.org/C147297375","wikidata":"https://www.wikidata.org/wiki/Q6674930","display_name":"Look-ahead","level":2,"score":0.27790001034736633},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.26910001039505005},{"id":"https://openalex.org/C69919132","wikidata":"https://www.wikidata.org/wiki/Q1144819","display_name":"Polyomino","level":3,"score":0.2554999887943268},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.2554999887943268},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.2515999972820282}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2611.03457","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2611.03457","pdf_url":"https://arxiv.org/pdf/2611.03457","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2611.03457","doi":"https://doi.org/10.48550/arxiv.2611.03457","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2611.03457","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"pmh:oai:arXiv.org:2611.03457","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2611.03457","pdf_url":"https://arxiv.org/pdf/2611.03457","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4415310104","https://openalex.org/W7118605452","https://openalex.org/W7100040931","https://openalex.org/W4399374372","https://openalex.org/W2042956300","https://openalex.org/W4316652305","https://openalex.org/W3083570594","https://openalex.org/W2108736261","https://openalex.org/W7134281334","https://openalex.org/W1486664114"],"abstract_inverted_index":{"In":[0],"expander":[1,10,43],"routing,":[2],"we":[3],"seek":[4],"to":[5,59,115,125],"establish":[6],"paths":[7,61,84],"in":[8,32],"the":[9,38],"graph":[11,40],"between":[12],"given":[13],"source-target":[14,49],"pairs":[15,50],"while":[16,65,94],"minimizing":[17],"both":[18],"dilation":[19,67,87],"(maximum":[20,25],"path":[21],"length)":[22],"and":[23,48,68,71,88],"congestion":[24,69,89],"edge":[26,46],"load).":[27],"We":[28,77],"study":[29],"this":[30],"problem":[31],"a":[33,79,109,117],"decremental":[34],"dynamic":[35],"setting":[36],"where":[37],"underlying":[39],"remains":[41],"an":[42,91],"despite":[44],"ongoing":[45],"deletions,":[47],"can":[51],"be":[52],"added":[53],"or":[54],"removed.":[55],"Our":[56,106],"goal":[57],"is":[58],"maintain":[60,116],"under":[62],"these":[63],"updates":[64],"keeping":[66],"low":[70,73],"performing":[72],"computation":[74,99],"per":[75,100],"update.":[76],"present":[78],"randomized":[80],"algorithm":[81],"that":[82],"maintains":[83],"with":[85,103],"polylogarithmic":[86,97],"against":[90],"adaptive":[92,126],"adversary,":[93],"incurring":[95],"only":[96],"amortized":[98],"update,":[101],"all":[102],"high":[104],"probability.":[105],"approach":[107],"leverages":[108],"recent":[110],"technique":[111],"called":[112],"Temporal":[113],"Aggregation":[114],"collection":[118],"of":[119],"low-congestion,":[120],"low-dilation":[121],"random":[122],"walks":[123],"resilient":[124],"adversaries.":[127]},"counts_by_year":[],"updated_date":"2026-11-05T12:25:35.769452","created_date":"2026-11-04T00:00:00"}