Related papers: Finite-time consensus using stochastic matrices wi…

In the classical theory of Markov chains, one may study the mean time to reach some chosen state, and it is well-known that in the irreducible, finite case, such quantity can be calculated in terms of the fundamental matrix of the walk, as…

We study synchronization and consensus in a group of dynamical systems coupled via multiple directed networks. We show that even though the coupling in a single network may not be sufficient to synchronize the systems, combination of…

Joint time-vertex graph signals are pervasive in real-world. This paper focuses on the fundamental problem of sampling and reconstruction of joint time-vertex graph signals. We prove the existence and the necessary condition of a critical…

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…

Multi agent consensus algorithms with update steps based on so-called balanced asymmetric chains, are analyzed. For such algorithms it is shown that (i) the set of accumulation points of states is finite, (ii) the asymptotic unconditional…

In this paper, we study asynchronous consensus problems of continuous-time multi-agent systems with discontinuous information transmission. The proposed consensus control strategy is implemented only based on the state information at some…

Identification of the parameters of stable linear dynamical systems is a well-studied problem in the literature, both in the low and high-dimensional settings. However, there are hardly any results for the unstable case, especially…

A positive definite completion problem pertains to determining whether the unspecified positions of a partial (or incomplete) matrix can be completed in a desired subclass of positive definite matrices. In this paper we study an important…

We propose generalizations of a number of standard network models, including the classic random graph, the configuration model, and the stochastic block model, to the case of time-varying networks. We assume that the presence and absence of…

In this paper we study the realizability question for commuting graphs of finite groups: Given an undirected graph $X$ is it the commuting graph of a group $G$? And if so, to determine such a group. We seek efficient algorithms for this…

Distributed averaging of agent initial conditions is a well-studied problem in context of networked systems where coordination amongst the agents is of paramount importance. The asymptotic nature of convergence of distributed averaging…

This paper investigates the role persistent arcs play for a social network to reach a global belief agreement under discrete-time or continuous-time evolution. Each (directed) arc in the underlying communication graph is assumed to be…

Coalescing random walk on a unimodular random rooted graph for which the root has finite expected degree visits each site infinitely often almost surely. A corollary is that an opinion in the voter model on such graphs has infinite expected…

This paper examines the structural controllability for a group of agents, called followers, connected to each other based on the consensus law under commands of multiple leaders, which are agents with superior capabilities, over a fixed…

This paper considers a strongly connected network of agents, each capable of partially observing and controlling a discrete-time linear time-invariant (LTI) system that is jointly observable and controllable. Additionally, agents…

In this paper, we consider finite-time state agreement problems for continuous-time multi-agent systems and propose two protocols, which ensure that states of agents reach an agreement in a finite time. Moreover, the second protocol solves…

In this paper, for any homogeneous system of agents with linear continuous time dynamics, we formulate an optimal control problem. In this problem a convex cost functional of the control signals of the agents shall be minimized, while the…

We present a class of iterative fully distributed fixed point methods to solve a system of linear equations, such that each agent in the network holds one of the equations of the system. Under a generic directed, strongly connected network,…

This paper studies consensus problems for multi-agent systems defined on directed graphs where the consensus dynamics involves nonlinear and discontinuous functions. Sufficient conditions, involving the nonlinear functions and the topology…

This paper presents novel controllers that yield finite-time stability for linear systems. We first present a sufficient condition for the origin of a scalar system to be finite-time stable. Then we present novel finite-time controllers…