Related papers: Networks maximizing the consensus time of voter mo…
In this paper, we consider the $\mathcal{H}_2$-norm of networked systems with multi-time scale consensus dynamics and vector-valued agent states. This allows us to explore how measurement and process noise affect consensus on…
The voter model with the node update rule is numerically investigated on a directed network. We start from a directed hierarchical tree, and split and rewire each incoming arc at the probability $p$. In order to discriminate the better and…
In many applications, it becomes necessary for a set of distributed network nodes to agree on a common value or opinion as quickly as possible and with minimal communication overhead. The classical 2-choices rule is a well-known distributed…
We generalize a binary majority-vote model on adaptive networks to a plurality-vote counterpart. When opinions are uniformly distributed in the population of voters in the initial state, it is found that having more available opinions in…
We study the behavior of a generalized consensus dynamics on a temporal network of interactions, the activity driven network with attractiveness. In this temporal network model, agents are endowed with an intrinsic activity $a$, ruling the…
In the deterministic binary majority process we are given a simple graph where each node has one out of two initial opinions. In every round, every node adopts the majority opinion among its neighbors. By using a potential argument first…
We investigate a variation of the classical voter model in which the set of influencing agents depends on an individual's current opinion. The initial population consists of a random sample of equally sized sub-populations for each state,…
We establish average consensus on graphs with dynamic topologies prescribed by evolutionary games among strategic agents. Each agent possesses a private reward function and dynamically decides whether to create new links and/or whether to…
We consider two-opinion voter models on dense dynamic random graphs. Our goal is to understand and describe the occurrence of consensus versus polarisation over long periods of time. The former means that all vertices have the same opinion,…
A hybrid model for opinion dynamics in complex multi-agent networks is introduced, wherein some continuous-valued agents average neighbors' opinions to update their own, while other discrete-valued agents use stochastic copying and voting…
We study a graph-based generalization of the Galam opinion formation model. Consider a simple connected graph which represents a social network. Each node in the graph is colored either blue or white, which indicates a positive or negative…
We study a discrete-time consensus model in which agents iteratively update their states through interactions on a dynamic social network. At each step, a single agent is selected asynchronously and averages the values of its current…
We generalize a binary majority-vote model on adaptive networks to its plurality-vote counterpart and analyze the time scale to consensus when voters are given more than two options. When opinions are uniformly distributed in the population…
The voter model and the Axelrod model are two of the main stochastic processes that describe the spread of opinions on networks. The former includes social influence, the tendency of individuals to become more similar when they interact,…
We describe a protocol for the average consensus problem on any fixed undirected graph whose convergence time scales linearly in the total number nodes $n$. The protocol is completely distributed, with the exception of requiring all nodes…
We explore the voter model dynamics on a directed random graph model ensemble (digraphs), given by the Directed Configuration Model. The voter model captures the evolution of opinions over time on a graph where each vertex represents an…
The adaptive voter model is widely used to model opinion dynamics in social complex networks. However, existing adaptive voter models are limited to only pairwise interactions and fail to capture the intricate social dynamics that arises in…
In several settings (e.g., sensor networks and social networks), nodes of a graph are equipped with initial opinions, and the goal is to estimate the average of these opinions using local operations. A natural algorithm to achieve this is…
The cover time C of a graph G is the expected time for a random walk starting from the worst vertex to cover all vertices in G. Similarly, the blanket time B is the expected time to visit all vertices within a constant factor of number of…
This paper considers the consensus problem for a network of nodes with random interactions and sampled-data control actions. We first show that consensus in expectation, in mean square, and almost surely are equivalent for a general random…