#### Filter Results:

#### Publication Year

2007

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

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 trade-off 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)

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)

— In this paper we consider the problem of gossiping in a network to diffuse the average of a subset of nodes, called sources, and directing it to another subset of nodes in the network called destinations. This case generalizes the typical average consensus gossiping policy, where all nodes are both sources and destinations of the average of the nodes… (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 are interested in modeling diffusion of innovations on social networks. We focus on a scenario where innovation emerges at a small number of nodes in the society, and each individual needs certain portion of his neighbors (thresholds) to adopt the innovation before he does so. We analyze the dynamics of the diffusion process under… (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)

Given a network of N nodes with the i-th sensor's observation x i ∈ R M , the matrix containing all Euclidean distances among measurements ||x i − x j || ∀i, j ∈ {1,. .. , N} is a useful description of the data. While reconstructing a distance matrix has wide range of applications, we are particularly interested in the manifold reconstruction and its… (More)