Related papers: Maintaining a Bounded Degree Expander in Dynamic P…
We study how to spread $k$ tokens of information to every node on an $n$-node dynamic network, the edges of which are changing at each round. This basic {\em gossip problem} can be completed in $O(n + k)$ rounds in any static network, and…
In this paper, we study "robust" dominating sets of random graphs that retain the domination property even if a small \emph{deterministic} set of edges are removed. We motivate our study by illustrating with examples from wireless networks…
In this work we consider three well-studied broadcast protocols: Push, Pull and Push&Pull. A key property of all these models, which is also an important reason for their popularity, is that they are presumed to be very robust, since they…
Most of today's distributed machine learning systems assume {\em reliable networks}: whenever two machines exchange information (e.g., gradients or models), the network should guarantee the delivery of the message. At the same time, recent…
We generalize the poissonian evolving random graph model of Bauer and Bernard to deal with arbitrary degree distributions. The motivation comes from biological networks, which are well-known to exhibit non poissonian degree distribution. A…
We study which property testing and sublinear time algorithms can be transformed into graph streaming algorithms for random order streams. Our main result is that for bounded degree graphs, any property that is constant-query testable in…
Information dissemination is a fundamental and frequently occurring problem in large, dynamic, distributed systems. In order to solve this, there has been an increased interest in creating efficient overlay networks that can maintain…
A unified approach to studying convergence and stochastic stability of continuous time consensus protocols (CPs) is presented in this work. Our method applies to networks with directed information flow; both cooperative and noncooperative…
Epidemics on complex networks is a widely investigated topic in the last few years, mainly due to the last pandemic events. Usually, real contact networks are dynamic, hence much effort has been invested in studying epidemics on evolving…
We study the problem of counting the number of nodes in a slotted-time communication network, under the challenging assumption that nodes do not have identifiers and the network topology changes frequently. That is, for each time slot links…
Graph algorithms applied in many applications, including social networks, communication networks, VLSI design, graphics, and several others, require dynamic modifications -- addition and removal of vertices and/or edges -- in the graph.…
Ubiquitous sensing devices frequently disseminate data among them. The use of a distributed event-based system that decouples publishers from subscribers arises as an ideal candidate to implement the dissemination process. In this paper, we…
The problem of controllability of the dynamical state of a network is central in network theory and has wide applications ranging from network medicine to financial markets. The driver nodes of the network are the nodes that can bring the…
This work examines the problem of graph learning over a diffusion network when data can be collected from a limited portion of the network (partial observability). The main question is to establish technical guarantees of consistent…
Information dissemination is a fundamental problem in parallel and distributed computing. In its simplest variant, the broadcasting problem, a message has to be spread among all nodes of a graph. A prominent communication protocol for this…
We consider the problem of designing an overlay network and routing mechanism that permits finding resources efficiently in a peer-to-peer system. We argue that many existing approaches to this problem can be modeled as the construction of…
In this paper we study the controllability of networked systems with static network topologies using tools from algebraic graph theory. Each agent in the network acts in a decentralized fashion by updating its state in accordance with a…
Recent work on the internet, social networks, and the power grid has addressed the resilience of these networks to either random or targeted deletion of network nodes. Such deletions include, for example, the failure of internet routers or…
Distributed resource allocation (DRA) is fundamental to modern networked systems, spanning applications from economic dispatch in smart grids to CPU scheduling in data centers. Conventional DRA approaches require reliable communication, yet…
We consider a basic model of a dynamical distribution network, modeled as a directed graph with storage variables corresponding to every vertex and flow inputs corresponding to every edge, subject to unknown but constant inflows and…