Related papers: Fixation to Consensus on Tree-related Graphs
The aim of this paper is to analyze a class of consensus algorithms with finite-time or fixed-time convergence for dynamic networks formed by agents with first-order dynamics. In particular, in the analyzed class a single evaluation of a…
In this paper, we study finite-time state consensus problems for continuous nonlinear multi-agent systems. Building on the theory of finite-time Lyapunov stability, we propose sufficient criteria which guarantee the system to reach a…
We consider a system of $N$ particles whose interactions are characterized by a (weighted) graph $G^N$. Each particle is a node of the graph with an internal state. The state changes according to Markovian dynamics that depend on the states…
This article deals with the consensus problem involving agents with time-varying singularities in the dynamics or communication in undirected graph networks. Existing results provide control laws which guarantee asymptotic consensus. These…
This paper addresses the consensus problem and the formation problem on SE(3) in multi-agent systems with directed and switching interconnection topologies. Several control laws are introduced for the consensus problem. By a simple…
We investigate the convergence to (quasi--)equilibrium of a density dependent Markov chain in~${\mathbb Z}^d$, whose drift satisfies a system of ordinary differential equations having an attractive fixed point. For a sequence of such…
In zero-temperature Glauber dynamics, vertices of a graph are given i.i.d.~initial spins $\sigma_x(0)$ from $\{-1,+1\}$ with $\mathbb{P}_p(\sigma_x(0) = +1)=p$, and they update their spins at the arrival times of i.i.d. Poisson processes to…
We consider a class of stochastic dynamical systems, called piecewise deterministic Markov processes, with states $(x, \s)\in \O\times \G$, $\O$ being a region in $\bbR^d$ or the $d$--dimensional torus, $\G$ being a finite set. The…
In this paper, we investigate the approximate consensus problem in highly dynamic networks in which topology may change continually and unpredictably. We prove that in both synchronous and partially synchronous systems, approximate…
Distributed consensus computation over random graph processes is considered. The random graph process is defined as a sequence of random variables which take values from the set of all possible digraphs over the node set. At each time step,…
The strip entropy is studied in this article. We prove that the strip entropy approximation is valid for every ray of a golden-mean tree. This result extends the previous result of [Petersen-Salama, Discrete \& Continuous Dynamical Systems,…
We study the asymptotic behaviour of Markov processes on large weighted Erdos-Renyi graphs where the transition rates of the vertices are only influenced by the state of their neighbours and the corresponding weight on the edges. We find…
In this paper we investigate a model of consensus decision making [Hartnett A. T., et al., Phys. Rev. Lett., 2016, 116, 038701] following a statistical physics approach presented in [Sarkanych P., et al., Phys. Biol., 2023, 20, 045005].…
We study majority dynamics on the binomial random graph $G(n,p)$ with $p = d/n$ and $d > \lambda n^{1/2}$, for some large $\lambda>0$. In this process, each vertex has a state in $\{-1,+1 \}$ and at each round every vertex adopts the state…
We study a variable length Markov chain model associated with a group of stationary processes that share the same context tree but each process has potentially different conditional probabilities. We propose a new model selection and…
We study the collective motion of a large set of self-propelled particles subject to voter-like interactions. Each particle moves on a two-dimensional space at a constant speed in a direction that is randomly assigned initially. Then, at…
We study continuous time Markov processes on graphs. The notion of frequency is introduced, which serves well as a scaling factor between any Markov time of a continuous time Markov process and that of its jump chain. As an application, we…
We analyze a class of distributed quantized consensus algorithms for arbitrary static networks. In the initial setting, each node in the network has an integer value. Nodes exchange their current estimate of the mean value in the network,…
We consider a random graph in which vertices can have one of two possible colours. Each vertex switches its colour at a rate that is proportional to the number of vertices of the other colour to which it is connected by an edge. Each edge…
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…