相关论文: The Asynchronous DeGroot Dynamics

We consider the plurality consensus problem among $n$ agents. Initially, each agent has one of $k$ different opinions. Agents choose random interaction partners and revise their state according to a fixed transition function, depending on…

Distributed consensus protocols provide a mechanism for spreading information within clustered networks, allowing agents and clusters to make decisions without requiring direct access to the state of the ensemble. In this work, we propose a…

A graph (digraph) $G=(V,E)$ with a set $T\subseteq V$ of terminals is called inner Eulerian if each nonterminal node $v$ has even degree (resp. the numbers of edges entering and leaving $v$ are equal). Cherkassky and Lov\'asz showed that…

In this paper, we are interested in the mixing behaviour of simple random walks on inhomogeneous directed graphs. We focus our study on the Chung-Lu digraph, which is an inhomogeneous network that generalizes the Erd\H{o}s-R\'enyi digraph.…

Consensus over networked agents is typically studied using undirected or directed communication graphs. Undirected graphs enforce symmetry in information exchange, leading to convergence to the average of initial states, while directed…

We study a model of opinion exchange in social networks where a state of the world is realized and every agent receives a zero-mean noisy signal of the realized state. It is known from [Golub and Jackson 2010] that under DeGroot dynamics…

Consider the following computational problem: given a regular digraph $G=(V,E)$, two vertices $u,v \in V$, and a walk length $t\in \mathbb{N}$, estimate the probability that a random walk of length $t$ from $u$ ends at $v$ to within $\pm…

We propose an asynchronous, decentralized algorithm for consensus optimization. The algorithm runs over a network in which the agents communicate with their neighbors and perform local computation. In the proposed algorithm, each agent can…

Majority dynamics on the binomial Erd\H{o}s-R\'enyi graph $\mathsf{G}(n,p)$ with $p=\lambda/\sqrt{n}$ is studied. In this process, each vertex has a state in $\{0,1\}$ and at each round, every vertex adopts the state of the majority of its…

We generalize the classic multi-agent DeGroot model for opinion dynamics to incorporate the Spiral of Silence theory from political science. This theory states that individuals may withhold their opinions when they perceive them to be in…

In the age of technology, individuals accelerate their biased gathering of information which in turn leads to a population becoming extreme and more polarized. Here we study a partial differential equation model for opinion dynamics that…

We propose and analyze a mathematical model for the evolution of opinions on directed complex networks. Our model generalizes the popular DeGroot and Friedkin-Johnsen models by allowing vertices to have attributes that may influence the…

In this note we give sufficient conditions for the convergence of the iterative algorithm called weighted-average consensus in directed graphs. We study the discrete-time form of this algorithm. We use standard techniques from matrix theory…

Average consensus algorithms compute the global average of sensor data in a distributed fashion using local sensor nodes. Simple execution, decentralized philosophy make these algorithms suitable for WSN scenarios. Most of the researchers…

We have recently proposed quantized gossip algorithms which solve the consensus and averaging problems on directed graphs with the least restrictive connectivity requirements. In this paper we study the convergence time of these algorithms.…

Let $X$ be a lazy random walk on a graph $G$. If $G$ is undirected, then the mixing time is upper bounded by the maximum hitting time of the graph. This fails for directed chains, as the biased random walk on the cycle $\mathbb{Z}_n$ shows.…

We study concentration inequalities in gossip opinion dynamics over random graphs. In the model, a network is generated from a random graph model with independent edges, and agents interact pairwise randomly over the network. During the…

We consider the averaging process on an infinite connected graph with bounded degree and independent, identically distributed starting values or initial opinions. Assuming that the law of the initial opinion of a vertex has a finite second…

Given an undirected measurement graph $G = ([n], E)$, the classical angular synchronization problem consists of recovering unknown angles $\theta_1,\dots,\theta_n$ from a collection of noisy pairwise measurements of the form $(\theta_i -…

We analyze stability of consensus algorithms in networks of multi-agents with time-varying topologies and delays. The topology and delays are modeled as induced by an adapted process and are rather general, including i.i.d.\ topology…