Related papers: Degree Fluctuations and the Convergence Time of Co…
Distributed consensus has been widely studied for sensor network applications. Whereas the asymptotic convergence rate has been extensively explored in prior work, other important and practical issues, including energy efficiency and link…
We study the distributed consensus of state vectors in a discrete-time multi-agent network with matrix edge weights using stochastic matrix convergence theory. We present a distributed asynchronous time update model wherein one randomly…
Motivated by the recent advances in the field of quantum computing, quantum systems are modelled and analyzed as networks of decentralized quantum nodes which employ distributed quantum consensus algorithms for coordination. In the…
We developed a statistical mechanics approach to the problem of opinion formation in interacting agents, constrained by a set of social rules, $B$. To provide the agents with an adaptive quality, we represented both the social agents and…
Distributed consensus has been intensively studied in recent years as a means to mitigate state differences among dynamic nodes on a graph. It has been successfully employed in various applications, e.g., formation control of multi-robots,…
Average consensus theory is intensely popular for building time synchronization in wireless sensor network (WSN). However, the average consensus-based time synchronization algorithm is based on iteration that pose challenges for efficiency,…
Breaking of equivalence between the microcanonical ensemble and the canonical ensemble, describing a large system subject to hard and soft constraints, respectively, was recently shown to occur in large random graphs. Hard constraints must…
The asynchronous rumor algorithm spreading propagates a piece of information, the so-called rumor, in a network. Starting with a single informed node, each node is associated with an exponential time clock with rate $1$ and calls a random…
The evolution of many stochastic systems is accurately described by random walks on graphs. We here explore the close connection between local steady-state fluctuations of random walks and the global structure of the underlying graph.…
We consider multi-agent systems with cooperative interactions and study the convergence to consensus in the case of time-dependent connections, with possible communication failure. We prove a new condition ensuring consensus: we define a…
In this paper, we study a convergence condition for asynchronous consensus problems in multi-agent systems. The convergence in this context implies the asynchronous consensus value converges to the synchronous one and is unique. Although it…
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 knowledge and computational capacity. We define the optimization…
We give almost sure convergence rate bounds of ratio consensus algorithms when the protocol can be reformulated to be linear updates of vector values on a possibly larger, augmented network. This is an improvement of the results of…
Graph embedding, representing local and global neighborhood information by numerical vectors, is a crucial part of the mathematical modeling of a wide range of real-world systems. Among the embedding algorithms, random walk-based algorithms…
We consider the problem of determining the existence of a sequence of matrices driving a discrete-time consensus system to consensus. We transform this problem into one of the existence of a product of the transition (stochastic) matrices…
We investigate the performance of linear consensus algorithms subject to a scaling of the underlying network size. Specifically, we model networked systems with $n^{\text{th}}$ order integrator dynamics over families of undirected, weighted…
We consider distributed optimization by a collection of nodes, each having access to its own convex function, whose collective goal is to minimize the sum of the functions. The communications between nodes are described by a time-varying…
The present paper considers distributed consensus algorithms that involve N agents evolving on a connected compact homogeneous manifold. The agents track no external reference and communicate their relative state according to a…
In this paper, we present two main results. First, by only one conjecture (Conjecture 2.9) for recognizing a vertex symmetric graph, which is the hardest task for our problem, we construct an algorithm for finding an isomorphism between two…
We consider ad-hoc networks consisting of $n$ wireless nodes that are located on the plane. Any two given nodes are called neighbors if they are located within a certain distance (communication range) from one another. A given node can be…