相关论文: Networks maximizing the consensus time of voter mo…
In this paper we consider the modeling of opinion dynamics over time dependent large scale networks. A kinetic description of the agents' distribution over the evolving network is considered which combines an opinion update based on binary…
We study the dynamics of opinion formation in a heterogeneous voter model on a complete graph, in which each agent is endowed with an integer fitness parameter $k \ge 0$, in addition to its $+$ or $-$ opinion state. The evolution of the…
In this paper consensus in second-order multi-agent systems with a non-periodic sampled-data exchange among agents is investigated. The sampling is random with bounded inter-sampling intervals. It is assumed that each agent has exact…
Populations of mobile and communicating agents describe a vast array of technological and natural systems, ranging from sensor networks to animal groups. Here, we investigate how a group-level agreement may emerge in the continuously…
We introduce and study a novel majority-based opinion diffusion model. Consider a graph $G$, which represents a social network. Assume that initially a subset of nodes, called seed nodes or early adopters, are colored either black or white,…
The diffusion of opinions in Social Networks is a relevant process for adopting positions and attracting potential voters in political campaigns. Opinion polarization, bias, targeted diffusion, and the radicalization of postures are key…
We consider a linear consensus system with n agents that can switch between r different connectivity patterns. A natural question is which switching law yields the best (or worst) possible speed of convergence to consensus? We formulate…
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assume that initially one node in a given network holds some…
In the evolving voter model, when an individual interacts with a neighbor having an opinion different from theirs, they will with probability $1-\alpha$ imitate the neighbor but with probability $ \alpha$ will sever the connection and…
Problems of consensus in multi-agent systems are often viewed as a series of independent, simultaneous local decisions made between a limited set of options, all aimed at reaching a global agreement. Key challenges in these protocols…
We introduce two models of consensus following a majority rule on time-evolving stochastic block models (SBM), in which the network evolution is Markovian or non-Markovian. Under the majority rule, in each round, each agent simultaneously…
We consider \emph{plurality consensus} in a network of $n$ nodes. Initially, each node has one of $k$ opinions. The nodes execute a (randomized) distributed protocol to agree on the plurality opinion (the opinion initially supported by the…
Spreading (diffusion) of innovations is a stochastic process on social networks. When the key driving mechanism is peer effects (word of mouth), the rate at which the aggregate adoption level increases with time depends strongly on the…
The adaptive voter model is a paradigmatic model in the study of opinion formation. Here we propose an extension for this model, in which conflicts are resolved by obtaining another opinion, and analytically study the time required for…
We study a distributed consensus problem on a complete communication network of $n$ vertices, each holding one of two opinions. The vertices communicate in rounds, possibly in the presence of adversarial noise, and exchange information…
This paper gives lower bounds for the probability of consensus for two spatially explicit stochastic opinion models. Both processes are characterized by two finite connected graphs, that we call respectively the spatial graph and the…
In this paper, we study the consensus problem of multiple agents on a kind of famous graph, Peterson graph. It is an undirected graph with 10 vertices and 15 edges. Each agent randomly walks on this graph and communicates with each other if…
Consider n individuals who, by popular vote, choose among q >= 2 alternatives, one of which is "better" than the others. Assume that each individual votes independently at random, and that the probability of voting for the better…
We provide a protocol for real-valued average consensus by networks of agents which exchange only a single message from the ternary alphabet {-1,0,1} between neighbors at each step. Our protocol works on time-varying undirected graphs…
We consider the average-consensus problem in a multi-node network of finite size. Communication between nodes is modeled by a sequence of directed signals with arbitrary communication delays. Four distributed algorithms that achieve…