Models of Smoothing in Dynamic Networks
Uri Meir, Ami Paz, Gregory Schwartzman

TL;DR
This paper extends smoothed analysis models for dynamic networks, exploring how different noise patterns and adversarial strategies affect network behavior and flooding times in long-lived networks.
Contribution
It introduces new models of noise for dynamic networks, including variable and localized noise, and analyzes their impact on flooding times and network robustness.
Findings
Different noise models significantly affect flooding times.
Localized noise models can improve network resilience.
Adaptive adversaries can influence network dynamics.
Abstract
Smoothed analysis is a framework suggested for mediating gaps between worst-case and average-case complexities. In a recent work, Dinitz et al.~[Distributed Computing, 2018] suggested to use smoothed analysis in order to study dynamic networks. Their aim was to explain the gaps between real-world networks that function well despite being dynamic, and the strong theoretical lower bounds for arbitrary networks. To this end, they introduced a basic model of smoothing in dynamic networks, where an adversary picks a sequence of graphs, representing the topology of the network over time, and then each of these graphs is slightly perturbed in a random manner. The model suggested above is based on a per-round noise, and our aim in this work is to extend it to models of noise more suited for multiple rounds. This is motivated by long-lived networks, where the amount and location of noise may…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
