Optimal design for manipulation of random consensus over discrete information in networked systems
type: Item
instance of: scholarly article
title: Optimal design for manipulation of random consensus over discrete information in networked systems
zbMATH Open document ID: 1465.93194
author: Sidney Roberto Carvalho
author: Ubirajara F. Moreno
published in: Journal of the Franklin Institute
publication date: 2021-06-08T00:00:00Z
Mathematics Subject Classification ID: 93D50
Mathematics Subject Classification ID: 93B70
Mathematics Subject Classification ID: 90C22
zbMATH DE Number: 7356377
zbMATH Keywords: consensus algorithms
zbMATH Keywords: semidefinite programming
zbMATH Keywords: network adjacency matrix
describes a project that uses: YALMIP
describes a project that uses: Robotics
MaRDI profile type: Publication
full work available at URL: j.jfranklin.2021.04.027
OpenAlex ID: W3154460803
cites work: From Kuramoto to Crawford: Exploring the onset of synchronization in population of coupled oscillators
cites work: Reaching a Consensus
cites work: Consensus and Cooperation in Networked Multi-Agent Systems
cites work: Ergodic theorems for weakly interacting infinite systems and the voter model
cites work: A model for spatial conflict
cites work: Epidemic spreading on weighted networks with adaptive topology based on infective information
cites work: Dynamical rewiring in adaptive weighted heterogeneous networks
cites work: Effect of local rewiring in adaptive epidemic networks
cites work: Distributed Topology Manipulation to Control Epidemic Spreading Over Networks
cites work: A Differential Game Approach to Decentralized Virus-Resistant Weight Adaptation Policy Over Complex Networks
cites work: Individual-based optimal weight adaptation for heterogeneous epidemic spreading networks
cites work: Analysis and Control of Epidemics: A Survey of Spreading Processes on Complex Networks
cites work: Opinion Dynamics and Social Power Evolution over Reducible Influence Networks
cites work: Fast linear iterations for distributed averaging
cites work: On the competition of two conflicting messages
cites work: Analysis and Control of a Continuous-Time Bi-Virus Model
cites work: The \(N\)-intertwined SIS epidemic network model
cites work: Q2716030
cites work: Performance Analysis of Communications Networks and Systems
cites work: Applications of second-order cone programming
cites work: Q4324980
cites work: Semidefinite Programming
cites work: Achieving consensus in robot swarms. Design and analysis of strategies for the best-of-\(n\) problem
cites work: Random Geometric Graphs
cites work: Network modules help the identification of key transport routes, signaling pathways in cellular and other networks
DOI: 10.1016/J.JFRANKLIN.2021.04.027
description: scientific article; zbMATH DE number 7356377