Markovian evolving graphs are dynamic-graph models where the links among a fixed set of nodes change during time according to an arbitrary Markovian rule. They are extremely general and they can well describe important dynamic-network scenarios.We study the speed of information spreading in the stationary phase by analyzing the completion time of the flooding mechanism. We prove a general theorem that establishes an upper bound on flooding time in any stationary Markovian evolving graph in terms of its node-expansion properties.We apply our theorem in two natural and relevant cases of such dynamic graphs. Geometric Markovian evolving graphs where the Markovian behaviour is yielded by n mobile radio stations, with fixed transmission radius, that perform independent random walks over a square region of the plane. Edge-Markovian evolving graphs where the probability of existence of any edge at time t depends on the existence (or not) of the same edge at time t − 1.In both cases, the obtained upper bounds hold with high probability and they are nearly tight. In fact, they turn out to be tight for a large range of the values of the input parameters. As for geometric Markovian evolving graphs, our result represents the first analytical upper bound for flooding time on a class of concrete mobile networks. * A preliminary version of this work was presented at the 24th IEEE IPDPS 2009

We introduce stochastic time-dependency in evolving graphs: starting from in arbitrary, initial edge probability distribution, at every time step! every edge changes it's state (existing or not) according to a two-state Markovian process with probabilities 1) (edge birth-rate) and q (edge death-rate). If all edge exists at time t then, at time t+1 it dies with probability q. If instead the edge does not exist at time 1, then it will come into existence at time t + 1 with Probability 1). Such evolving graph model is a. wide generalization of time-independent dynamic random graphs [6] and will be called edge-Markovian. dynamic graphs. We investigate the speed of information dissemination in such dynamic graphs. We provide nearly tight; bounds (which in fact turn out to be tight for a wide range of probabilities p and q) oil the completion Chile of the flooding mechanism aiming to broadcast a piece of information from a source node to all nodes. In particular, we provide: i) A tight characterization of the class of edge-Markovian dynamic graphs where flooding time is constant and. thus, it does not asymptotically depend oil the initial probability distribution. ii) A flight characterization of the class of edge-Markovian dynamic graphs where flooding time does not asymptotically depend oil the edge death-rate q

Given a finite set S of points (i.e. the stations of a radio network) on a d-dimensional Euclidean space and a positive integer 1h|S|–1, the MIN DD H-RANGE ASSIGNMENT problem consists of assigning transmission ranges to the stations so as to minimize the total power consumption, provided that the transmission ranges of the stations ensure the communication between any pair of stations in at most h hops.\ud Two main issues related to this problem are considered in this paper: the trade-off between the power consumption and the number of hops; the computational complexity of the MIN DD H-RANGE ASSIGNMENT problem.\ud As for the first question, we provide a lower bound on the minimum power consumption of stations on the plane for constant h. The lower bound is a function of |S|, h and the minimum distance over all the pairs of stations in S. Then, we derive a constructive upper bound as a function of |S|, h and the maximum distance over all pairs of stations in S (i.e. the diameter of S). It turns out that when the minimum distance between any two stations is not too small (i.e. well spread instances) the upper bound matches the lower bound. Previous results for this problem were known only for very special 1-dimensional configurations (i.e., when points are arranged on a line at unitary distance) [Kirousis, Kranakis, Krizanc and Pelc, 1997].\ud As for the second question, we observe that the tightness of our upper bound implies that MIN 2D H-RANGE ASSIGNMENT restricted to well spread instances admits a polynomial time approximation algorithm. Then, we also show that the same approximation result can be obtained for random instances. On the other hand, we prove that for h=|S|–1 (i.e. the unbounded case) MIN 2D H-RANGE ASSIGNMENT is NP-hard and MIN 3D H-RANGE ASSIGNMENT is APX-complete

A multi-hop synchronous radio network is said to be unknown if the nodes have no knowledge of the topology. A basic task in radio network is that of broadcasting a message (created by a fixed source node) to all nodes of the network. Typical operations in real-life radio networks is the multi-broadcast that consists in performing a set of r independent broadcasts. The study of broadcast operations on unknown radio network is started by the seminal paper of Bar-Yehuda et al. [J. Comput. System Sci. 45 (1992) 104] and has been the subject of several recent works. In this paper, we study the completion and the termination time of distributed protocols for both the (single) broadcast and the multi-broadcast operations on unknown networks as functions of the number of nodes n, the maximum eccentricity D, the maximum in-degree Delta, and the congestion c of the networks. We establish new connections between these operations and some combinatorial concepts, such as selective families, strongly selective families (also known as superimposed codes), and pairwise r-different families. Such connections, combined with a set of new lower and upper bounds on the size of the above families, allow us to derive new lower bounds and new distributed protocols for the broadcast and multi-broadcast operations. In particular, our upper bounds are almost tight and strongly improve over the previous bounds for a large class of networks. (C) 2002 Elsevier Science B.V. All rights reserved

We introduce stochastic time-dependency in evolving graphs: starting from an initial graph, at every time step, every edge changes its state (existing or not) according to a two-state Markovian process with probabilities $p$ (edge birth-rate) and $q$ (edge death-rate). If an edge exists at time $t$, then, at time $t+1$, it dies with probability $q$. If instead the edge does not exist at time $t$, then it will come into existence at time $t+1$ with probability $p$. Such an evolving graph model is a wide generalization of time-independent dynamic random graphs [A. E. F. Clementi, A. Monti, F. Pasquale, and R. Silvestri, J. Comput. System Sci., 75 (2009), pp. 213–220] and will be called edge-Markovian evolving graphs. We investigate the speed of information spreading in such evolving graphs. We provide nearly tight bounds (which in fact turn out to be tight for a wide range of probabilities $p$ and $q$) on the completion time of the flooding mechanism aiming to broadcast a piece of information from a source node to all nodes. In particular, we provide i) a tight characterization of the class of edge-Markovian evolving graphs where flooding time is constant and, thus, it does not asymptotically depend on the initial graph; ii) a tight characterization of the class of edge-Markovian evolving graphs where flooding time does not asymptotically depend on the edge death-rate $q$. An interesting consequence of our results is that information spreading can be fast even if the graph, at every time step, is very sparse and disconnected. Furthermore, our bounds imply that the flooding time can be exponentially shorter than the mixing time of the edge-Markovian graph

We study Plurality Consensus in the GOSSIP Model over a network of n anonymous agents. Each agent supports an initial opinion or color. We assume that at the onset, the number of agents supporting the plurality color exceeds that of the agents supporting any other color by a sufficiently-large bias, though the initial plurality itself might be very far from absolute majority. The goal is to provide a protocol that, with high probability, brings the system into the configuration in which all agents support the (initial) plurality color.We consider the Undecided-State Dynamics, a wellknown protocol which uses just one more state (the undecided one) than those necessary to store colors.We show that the speed of convergence of this protocol depends on the initial color configuration as a whole, not just on the gap between the plurality and the second largest color community. This dependence is best captured by a novel notion we introduce, namely, the monochromatic distance md(c) which measures the distance of the initial color configurationc from the closest monochromatic one. In the complete graph, we prove that, for a wide range of the input parameters, this dynamics converges within O(md(c) log n) rounds. We prove that this upper bound is almost tight in the strong sense: Starting from any color configurationc, the convergence time is Ω(md(c)).Finally, we adapt the Undecided-State Dynamics to obtain a fast, random walk-based protocol for plurality consensus on regular expanders. This protocol converges in O(md(c) polylog(n)) rounds using only polylog(n) local memory. A key-ingredient to achieve the above bounds is a new analysis of the maximum node congestion that results from performing n parallel random walks on regular expanders.All our bounds hold with high probability.

We study a plurality-consensus process in which each of n anonymous agents of a communication network initially supports a color chosen from the set [k]. Then, in every round, each agent can revise his color according to the colors currently held by a random sample of his neighbors. It is assumed that the initial color configuration exhibits a sufficiently large biass towards a fixed plurality color, that is, the number of nodes supporting the plurality color exceeds the number of nodes supporting any other color by s additional nodes. The goal is having the process to converge to the stable configuration in which all nodes support the initial plurality. We consider a basic model in which the network is a clique and the update rule (called here the 3-majority dynamics) of the process is the following: each agent looks at the colors of three random neighbors and then applies the majority rule (breaking ties uniformly). We prove that the process converges in time (Formula presented.) with high probability, provided that (Formula presented.). We then prove that our upper bound above is tight as long as (Formula presented.). This fact implies an exponential time-gap between the plurality-consensus process and the median process (see Doerr et al. in Proceedings of the 23rd annual ACM symposium on parallelism in algorithms and architectures (SPAAâ\u80\u9911), pp 149â\u80\u93158. ACM, 2011). A natural question is whether looking at more (than three) random neighbors can significantly speed up the process. We provide a negative answer to this question: in particular, we show that samples of polylogarithmic size can speed up the process by a polylogarithmic factor only

No abstract