Related papers: How Agreement and Disagreement Evolve over Random …
We introduce a probabilistic pairwise \emph{attraction--repulsion} model for opinion dynamics on multilayer social networks, in which agents hold layer-specific states and interact through random matchings that couple multiple, time-varying…
We study the connections between network structure, opinion dynamics, and an adversary's power to artificially induce disagreements. We approach these questions by extending models of opinion formation in the social sciences to represent…
In this paper, we consider the consensus problem of dynamical multiple agents that communicate via a directed moving neighborhood random network. Each agent performs random walk on a weighted directed network. Agents interact with each…
In this work, we study the consensus problem in which legitimate agents send their values over an undirected communication network in the presence of an unknown subset of malicious or faulty agents. In contrast to former works, we…
Understanding how reliable information emerges in interconnected populations is a challenge in social science, network theory and data analysis. Many existing approaches model treat truth as an external reference or a property of individual…
Emerging collective behavior in complex dynamical networks depends on both coupling function and underlying coupling topology. Through this perspective, we provide a brief yet profound excerpt of recent research efforts that explore how the…
In a recent article [1] we surveyed advances related to adaptation, learning, and optimization over synchronous networks. Various distributed strategies were discussed that enable a collection of networked agents to interact locally in…
Models of the consensus of the individual state in social systems have been the subject of recent researches in the physics literature. We investigate how network structures coevolve with the individual state under the framework of social…
We define a dynamic model of random networks, where new vertices are connected to old ones with a probability proportional to a sublinear function of their degree. We first give a strong limit law for the empirical degree distribution, and…
We study the asymptotic properties of distributed consensus algorithms over switching directed random networks. More specifically, we focus on consensus algorithms over independent and identically distributed, directed random graphs, where…
In this paper, we investigate the approximate consensus problem in highly dynamic networks in which topology may change continually and unpredictably. We prove that in both synchronous and partially synchronous systems, approximate…
Collective phenomena in systems of interacting agents have helped us understand diverse social, ecological and biological observations. The corresponding explanations are challenged by incorrect information processing. In particular, the…
We consider a class of models of opinion formation where the dissemination of individual opinions occurs through the spreading of local consensus and disagreement. We study the emergence of full collective consensus or maximal disagreement…
This paper introduces a novel continuous-time dynamic average consensus algorithm for networks whose interaction is described by a strongly connected and weight-balanced directed graph. The proposed distributed algorithm allows agents to…
It is interesting and of significant importance to investigate how network structures co-evolve with opinions. The existing models of such co-evolution typically lead to the final states where network nodes either reach a global consensus…
In this work and the supporting Parts II [2] and III [3], we provide a rather detailed analysis of the stability and performance of asynchronous strategies for solving distributed optimization and adaptation problems over networks. We…
In linear models of consensus dynamics, the state of the various agents converges to a value which is a convex combination of the agents' initial states. We call it democratic if in the large scale limit (number of agents going to infinity)…
We consider the problems of reaching average consensus and solving consensus-based optimization over unreliable communication networks wherein packets may be dropped accidentally during transmission. Existing work either assumes that the…
There has been substantial work studying consensus problems for which there is a single common final state, although there are many real-world complex networks for which the complete consensus may be undesirable. More recently, the concept…
Classical approaches for asymptotic convergence to the global average in a distributed fashion typically assume timely and reliable exchange of information between neighboring components of a given multi-component system. These assumptions…