A cyclic representation of discrete coordination procedures

DOI10.1134/S0005117912010134zbMath1307.93019arXiv1112.0404OpenAlexW3105872184MaRDI QIDQ2261692

R. P. Agaev, Pavel Yu. Chebotarev

Publication date: 13 March 2015

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1112.0404

Mathematics Subject Classification ID

Decentralized systems (93A14)

Related Items (1)

Static consensus in passifiable linear networks

Cites Work

• Unnamed Item
• Dynamic models of informational control in social networks
• Forest matrices around the Laplacian matrix
• The matrix of maximum out forests of a digraph and its applications
• On reaching a consensus using DeGroot's iterative pooling
• The projection method for reaching consensus and the regularized power limit of a stochastic matrix
• ON SMALL RANDOM PERTURBATIONS OF DYNAMICAL SYSTEMS
• Reaching a Consensus

This page was built for publication: A cyclic representation of discrete coordination procedures