activity
20112023
most citedReaching a Quantum Consensus: Master Equations that Generate Symmetrization and Synchronization

61 citations · 329 across the 74 of their papers we have counts for

collaborators
Showing 2012Show all

6 papers · 1 filter

eess.SY2012★ 5 cited

Distributed Optimization: Convergence Conditions from a Dynamical System Perspective

Guodong Shi, Alexandre Proutiere, Karl Henrik Johansson

This paper explores the fundamental properties of distributed minimization of a sum of functions with each function only known to one node, and a pre-specified level of node knowle…

cs.SI2012

How Agreement and Disagreement Evolve over Random Dynamic Networks

Guodong Shi, Mikael Johansson, Karl Henrik Johansson

The dynamics of an agreement protocol interacting with a disagreement process over a common random network is considered. The model can represent the spreading of true and false in…

cs.DC2012★ 29 cited

Finite-time Convergent Gossiping

Guodong Shi, Bo Li, Mikael Johansson +1

Gossip algorithms are widely used in modern distributed systems, with applications ranging from sensor networks and peer-to-peer networks to mobile vehicle networks and social netw…

eess.SY2012★ 4 cited

An Approximate Projected Consensus Algorithm for Computing Intersection of Convex Sets

Youcheng Lou, Guodong Shi, Karl Henrik Johansson +1

In this paper, we propose an approximate projected consensus algorithm for a network to cooperatively compute the intersection of convex sets. Instead of assuming the exact convex…

cs.DC2012★ 17 cited

Finite-time and Asymptotic Convergence of Distributed Averaging and Maximizing Algorithms

Guodong Shi, Karl Henrik Johansson

In this paper, we formulate and investigate a generalized consensus algorithm which makes an attempt to unify distributed averaging and maximizing algorithms considered in the lite…

cs.IT2012★ 4 cited

Randomized Gossip Algorithm with Unreliable Communication

Guodong Shi, Mikael Johansson, Karl Henrik Johansson

In this paper, we study an asynchronous randomized gossip algorithm under unreliable communication. At each instance, two nodes are selected to meet with a given probability. When…