相关论文: The Asynchronous DeGroot Dynamics

We study the edge-averaging process on a finite, connected graph $G = (V, E)$. Initially, the vertices in $V$ are endowed with i.i.d.\ real-valued opinions $(f_0(v))_{v \in V}$. Edges are activated according to i.i.d.\ Poisson clocks of…

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…

We consider distributed plurality consensus in a complete graph of size $n$ with $k$ initial opinions. We design an efficient and simple protocol in the asynchronous communication model that ensures that all nodes eventually agree on the…

In the voter model, each node of a graph has an opinion, and in every round each node chooses independently a random neighbour and adopts its opinion. We are interested in the consensus time, which is the first point in time where all nodes…

We consider two simple asynchronous opinion dynamics on arbitrary graphs where every node $u$ has an initial value $\xi_u(0)$. In the first process, the NodeModel, at each time step $t\ge 0$, a random node $u$ and a random sample of $k$ of…

In majority dynamics, agents located at the vertices of an undirected simple graph update their binary opinions synchronously by adopting those of the majority of their neighbors. On infinite unimodular transitive graphs (e.g., Cayley…

We give an extension of the $G$ method, with results, the extension and results being partly suggested by the finite Markov chains and specially by the finite-time consensus problem for the DeGroot model and that for the DeGroot model on…

We consider 3-Majority, a probabilistic consensus dynamics on a complete graph with $n$ vertices, each vertex starting with one of $k$ initial opinions. At each discrete time step, a vertex $u$ is chosen uniformly at random. The selected…

We study distributed plurality consensus among $n$ nodes, each of which initially holds one of $k$ opinions. The goal is to eventually agree on the initially dominant opinion. We consider an asynchronous communication model in which each…

We study information aggregation in networks when agents interact to learn a binary state of the world. Initially each agent privately observes an independent signal which is "correct" with probability $\frac{1}{2}+\delta$ for some $\delta…

We consider a consensus algorithm in which every node in a sequence of undirected, B-connected graphs assigns equal weight to each of its neighbors. Under the assumption that the degree of each node is fixed (except for times when the node…

We study a simple random process in which vertices of a connected graph reach consensus through pairwise interactions. We compute outcome probabilities, which do not depend on the graph structure, and consider the expected time until a…

We consider the two-opinion voter model on a regular random graph with n vertices and degree $d \geq 3$. It is known that consensus is reached on time scale n and that on this time scale the volume of the set of vertices with one opinion…

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…

This paper analyzes a nonlinear opinion dynamics model which generalizes the DeGroot model by introducing a bias parameter for each individual. The original DeGroot model is recovered when the bias parameter is equal to zero. The magnitude…

In this paper, the question of expected time to convergence is addressed for unbiased quantized consensus on undirected connected graphs, and some strong results are obtained. The paper first provides a tight expression for the expected…

The Deffuant model is a spatial stochastic model for the dynamics of opinions in which individuals are located on a connected graph representing a social network and characterized by a number in the unit interval representing their opinion.…

We study the minority-opinion dynamics over a fully-connected network of $n$ nodes with binary opinions. Upon activation, a node receives a sample of opinions from a limited number of neighbors chosen uniformly at random. Each activated…

We consider a network of evolving opinions. It includes multiple individuals with first-order opinion dynamics defined in continuous time and evolving based on a general exogenously defined time-varying underlying graph. In such a network,…

In social networks, interaction patterns typically change over time. We study opinion dynamics on tie-decay networks in which tie strength increases instantaneously when there is an interaction and decays exponentially between interactions.…