[{"doi":"10.15479/AT-ISTA-22281","project":[{"call_identifier":"H2020","grant_number":"101019564","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","name":"The design and evaluation of modern fully dynamic data structures"},{"name":"Static and Dynamic Hierarchical Graph Decompositions","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","grant_number":"I05982"},{"_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","name":"Fast Algorithms for a Reactive Network Layer","grant_number":"P33775"}],"_id":"22281","oa_version":"Published Version","month":"07","date_created":"2026-07-13T09:39:59Z","date_updated":"2026-07-24T12:48:29Z","related_material":{"record":[{"relation":"part_of_dissertation","id":"20051","status":"public"},{"id":"18557","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","id":"19982","status":"public"},{"id":"21720","relation":"part_of_dissertation","status":"public"},{"id":"22374","relation":"part_of_dissertation","status":"public"},{"id":"22373","relation":"part_of_dissertation","status":"public"}]},"type":"dissertation","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","alternative_title":["ISTA Thesis"],"status":"public","corr_author":"1","ec_funded":1,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"ista":"El-Hayek A. 2026. Handling updates and failures: Dynamic graph algorithms and distributed computing on dynamic networks. Institute of Science and Technology Austria.","short":"A. El-Hayek, Handling Updates and Failures: Dynamic Graph Algorithms and Distributed Computing on Dynamic Networks, Institute of Science and Technology Austria, 2026.","chicago":"El-Hayek, Antoine. “Handling Updates and Failures: Dynamic Graph Algorithms and Distributed Computing on Dynamic Networks.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-22281\">https://doi.org/10.15479/AT-ISTA-22281</a>.","mla":"El-Hayek, Antoine. <i>Handling Updates and Failures: Dynamic Graph Algorithms and Distributed Computing on Dynamic Networks</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22281\">10.15479/AT-ISTA-22281</a>.","ama":"El-Hayek A. Handling updates and failures: Dynamic graph algorithms and distributed computing on dynamic networks. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22281\">10.15479/AT-ISTA-22281</a>","ieee":"A. El-Hayek, “Handling updates and failures: Dynamic graph algorithms and distributed computing on dynamic networks,” Institute of Science and Technology Austria, 2026.","apa":"El-Hayek, A. (2026). <i>Handling updates and failures: Dynamic graph algorithms and distributed computing on dynamic networks</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-22281\">https://doi.org/10.15479/AT-ISTA-22281</a>"},"doi_confirm":"1","date_published":"2026-07-13T00:00:00Z","publisher":"Institute of Science and Technology Austria","license":"https://creativecommons.org/licenses/by/4.0/","file_date_updated":"2026-07-20T11:29:38Z","department":[{"_id":"GradSch"},{"_id":"MoHe"}],"acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (MoDynStruct, No. 101019564)\r\n\"The Design and Evaluation of Modern Fully Dynamic Data Structures\" , from the\r\nAustrian Science Fund (FWF) grant DOI 10.55776/I5982 \"Static and Dynamic Hierarchical\r\nGraph Decompositions\", and from the Austrian Science Fund (FWF) and netIDEE SCIENCE\r\nproject P 33775-N, \"Fast Algorithms for a Reactive Network Layer\".\r\n","publication_status":"published","page":"244","title":"Handling updates and failures: Dynamic graph algorithms and distributed computing on dynamic networks","abstract":[{"text":"In this thesis, we took a look at networks, and more specifically, at networks that change over time, whether those are networks in the distributed algorithms sense of the word, or the graph algorithm sense. \r\n\r\nIn distributed algorithms, we looked at two main problems. First, the broadcast problem: given n agents, each agent is tasked to forward a (unique) message to every other agent. Agents collaborate and can copy and forward all messages they have received up until that point. Broadcast is achieved when one agent has successfully broadcast its message to everyone else. We studied the case where the communication network is controlled by an adversary, under the condition that the graph is rooted in every round of communication. We show that the adversary can delay broadcast for at most  l\r\n(1 + √\r\n2)n\r\nm\r\n rounds, improving on the $O(n\\log\\log n)$ previous upper bound~\\cite{fugger2020radius}, and asymptotically matching the $\\sim 1.5n$ lower bound~\\cite{schwarz2017linear}.\r\n\r\nWe then looked at the stochastic version of the problem: here, the adversary -- parametrized by $k$ where $k=0$ signifies that the adversary has no control,  and $k=n$ that the adversary has full control -- can choose parts of the graph, and the graph is then completed stochastically. Here, we are able to look at a stronger version of broadcast: instead of having $n$ messages trying to be broadcast in parallel, we can assume that only one message needs to be broadcasted. We show the bound $\\Theta(k+\\log n)$.\r\n\r\nThen, we looked at undecided states dynamics in population protocols: given a population of $n$ agents, where each initially holds an opinion among $k$ different ones. In each round, two agents are chosen uniformly at random, and can interact. If they have different opinions, they forget their opinions and become undecided. If one of them is undecided while the other has an opinion, they undecided agent copies they opinion of the decided one. The question is then, how many interactions does it take for the whole population to share the same opinion? We show a $\\Omega(kn\\log \\frac {\\sqrt n} {k \\log n})$ lower bound  for any $k = o\\left(\\frac {\\sqrt n}{\\log n}\\right)$.\r\nThis is tight for any $ k \\le n^{\\frac 1 2 - \\epsilon}$, where $\\epsilon >0$ can be any small constant, matching the known $O(kn\\log n)$ upper bound for $k = O\\left(\\frac {\\sqrt n} {\\log ^2 n}\\right)$~\\cite{DBLP:conf/podc/AmirABBHKL23}.\r\n\r\nFinally, in dynamic algorithms, we study the minimum cut problem: we are given a graph, whose vertex set we want to partition into two subsets such that the number of edges crossing from one subset to the other is minimized. Then, the graph can be updated via edge insertions or deletions, and we must update the solution without recomputing everything from scratch. We present an exact fully-dynamic minimum cut algorithm that runs in $n^{o(1)}$ deterministic update time when the minimum cut size is at most $2^{\\Theta(\\log^{3/4-c}n)}$ for any $c>0$, improving on the previous algorithm~\\cite{DBLP:conf/soda/JinST24} whose minimum cut size limit is $(\\log n)^{o(1)}$. Using sparsification and randomization techniques, we are able to extend this to all values of the minimum cut in weighted graphs, at the cost of a $(1+o(1))$-approximation ratio.","lang":"eng"}],"author":[{"last_name":"El-Hayek","id":"888a098e-fcac-11ee-aff7-d347be57b725","orcid":"0000-0003-4268-7368","first_name":"Antoine","full_name":"El-Hayek, Antoine"}],"ddc":["000"],"day":"13","supervisor":[{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H","full_name":"Henzinger, Monika H"}],"article_processing_charge":"No","degree_awarded":"PhD","oa":1,"OA_place":"publisher","year":"2026","publisher_comment":"Sections 2.4 and 7.1 and chapter 6 are not CC-BY 4.0, they are All Rights Reserved.","language":[{"iso":"eng"}],"file":[{"file_size":5465973,"date_updated":"2026-07-17T11:39:47Z","date_created":"2026-07-17T11:39:47Z","creator":"aelhayek","success":1,"access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_id":"22356","file_name":"2026_El-Hayek_Antoine_Thesis.pdf","checksum":"923e4ca769c9ef2f6b0b005444faf462"},{"relation":"source_file","file_id":"22357","file_name":"2026_El-Hayek_Antoine_Thesis.zip","checksum":"262689f9df27dd6c2c7c7861f1de7329","date_created":"2026-07-17T11:40:34Z","file_size":9116107,"date_updated":"2026-07-20T11:29:38Z","creator":"aelhayek","access_level":"closed","content_type":"application/x-zip-compressed"}],"publication_identifier":{"issn":["2663-337X"]}}]