Learn More
Motivated by applications to wireless sensor, peer-to-peer, and ad hoc networks, we study distributed broadcasting algorithms for exchanging information and computing in an arbitrarily connected network of nodes. Specifically, we study a broadcasting-based gossiping algorithm to compute the (possibly weighted) average of the initial measurements of the(More)
— While social networks do affect diffusion of innovations , the exact nature of these effects are far from clear, and, in many cases, there exist conflicting hypotheses among researchers. In this paper, we focus on the linear threshold model where each individual requires exposure to (potentially) multiple sources of adoption in her neighborhood before(More)
Average consensus algorithms are protocols to compute the average value of all sensor measurements via near neighbors communications. They offer a natural tradeoff between the number of messages exchanged among terminals and the accuracy in the computation. Most of the models adopted for the message exchange in the literature, however, neither include(More)
Recent advances in information technology have allowed firms to gather vast amounts of data regarding consumers' preferences and the structure and intensity of their social interactions. This paper examines a game-theoretic model of competition between firms which can target their marketing budgets to individuals embedded in a social network. We provide a(More)
BACKGROUND AND PURPOSE During the hyperacute phase of stroke, multiple hypointense vessels were identified specifically in the ischemic territory on gradient-echo T2*-weighted MR images (GRE-T2* WI) at 3T. The area was named a "region of multiple hypointense vessels (RMHV)." The aim of this study was to assess the usefulness of RMHV for the diagnosis of(More)
We study binary opinion dynamics in a social network with <i>stubborn agents</i> who influence others but do not change their opinions. We focus on a generalization of the classical voter model by introducing nodes (stubborn agents) that have a fixed state. We show that the presence of stubborn agents with opposing opinions precludes convergence to(More)
In this paper we consider the problem of transmitting quantized data while performing an average consensus algorithm. Average consensus algorithms are protocols to compute the average value of all sensor measurements via near neighbors communications. The main motivation for our work is the observation that consensus algorithms offer the perfect example of(More)
information diffusion via gossiping on static and dynamic networks. Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use. The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Abstract—(More)
A crucial problem of Social Sciences is under what conditions agreement, or disagreement, emerge in a network of interacting agents. This topic has application in many contexts, including business and marketing decisions, with potential impact on information and technological networks. In this paper we consider a particular model of interaction between a(More)