On the properties of optimal weak links in consensus networks

Makan Fardad, Xi Zhang, Fu Lin, Mihailo R. Jovanovic

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

We study consensus networks in which each node updates its state by taking a weighted average of the states of its neighbors. Our objective is to determine the optimal set of weak links whose addition to the network maximally improves the efficiency of reaching consensus. Allocating a small amount of resources to the entire network with which new links can be created, we employ a perturbation method to cast this problem as a linear program. We demonstrate that the set of optimal weak links is sparse and, based on extensive numerical experiments, conjecture that they are also long-range. Examples are provided to illustrate the utility of our developments.

Original languageEnglish (US)
Article number7039712
Pages (from-to)2124-2129
Number of pages6
JournalUnknown Journal
Volume2015-February
Issue numberFebruary
DOIs
StatePublished - 2014

Fingerprint

Experiments
Weighted Average
Perturbation Method
Linear Program
casts
resources
Update
Numerical Experiment
Entire
perturbation
Resources
Vertex of a graph
Range of data
Demonstrate

Keywords

  • Convex optimization
  • linear programming
  • long-range links
  • opinion dynamics
  • perturbation analysis
  • social networks
  • sparsity

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Cite this

Fardad, M., Zhang, X., Lin, F., & Jovanovic, M. R. (2014). On the properties of optimal weak links in consensus networks. Unknown Journal, 2015-February(February), 2124-2129. [7039712]. https://doi.org/10.1109/CDC.2014.7039712

On the properties of optimal weak links in consensus networks. / Fardad, Makan; Zhang, Xi; Lin, Fu; Jovanovic, Mihailo R.

In: Unknown Journal, Vol. 2015-February, No. February, 7039712, 2014, p. 2124-2129.

Research output: Contribution to journalArticle

Fardad, M, Zhang, X, Lin, F & Jovanovic, MR 2014, 'On the properties of optimal weak links in consensus networks', Unknown Journal, vol. 2015-February, no. February, 7039712, pp. 2124-2129. https://doi.org/10.1109/CDC.2014.7039712
Fardad M, Zhang X, Lin F, Jovanovic MR. On the properties of optimal weak links in consensus networks. Unknown Journal. 2014;2015-February(February):2124-2129. 7039712. https://doi.org/10.1109/CDC.2014.7039712
Fardad, Makan ; Zhang, Xi ; Lin, Fu ; Jovanovic, Mihailo R. / On the properties of optimal weak links in consensus networks. In: Unknown Journal. 2014 ; Vol. 2015-February, No. February. pp. 2124-2129.
@article{f61c0e9ddcbe49b6ab6e9fe049df2c2e,
title = "On the properties of optimal weak links in consensus networks",
abstract = "We study consensus networks in which each node updates its state by taking a weighted average of the states of its neighbors. Our objective is to determine the optimal set of weak links whose addition to the network maximally improves the efficiency of reaching consensus. Allocating a small amount of resources to the entire network with which new links can be created, we employ a perturbation method to cast this problem as a linear program. We demonstrate that the set of optimal weak links is sparse and, based on extensive numerical experiments, conjecture that they are also long-range. Examples are provided to illustrate the utility of our developments.",
keywords = "Convex optimization, linear programming, long-range links, opinion dynamics, perturbation analysis, social networks, sparsity",
author = "Makan Fardad and Xi Zhang and Fu Lin and Jovanovic, {Mihailo R.}",
year = "2014",
doi = "10.1109/CDC.2014.7039712",
language = "English (US)",
volume = "2015-February",
pages = "2124--2129",
journal = "Nuclear Physics A",
issn = "0375-9474",
publisher = "Elsevier",
number = "February",

}

TY - JOUR

T1 - On the properties of optimal weak links in consensus networks

AU - Fardad, Makan

AU - Zhang, Xi

AU - Lin, Fu

AU - Jovanovic, Mihailo R.

PY - 2014

Y1 - 2014

N2 - We study consensus networks in which each node updates its state by taking a weighted average of the states of its neighbors. Our objective is to determine the optimal set of weak links whose addition to the network maximally improves the efficiency of reaching consensus. Allocating a small amount of resources to the entire network with which new links can be created, we employ a perturbation method to cast this problem as a linear program. We demonstrate that the set of optimal weak links is sparse and, based on extensive numerical experiments, conjecture that they are also long-range. Examples are provided to illustrate the utility of our developments.

AB - We study consensus networks in which each node updates its state by taking a weighted average of the states of its neighbors. Our objective is to determine the optimal set of weak links whose addition to the network maximally improves the efficiency of reaching consensus. Allocating a small amount of resources to the entire network with which new links can be created, we employ a perturbation method to cast this problem as a linear program. We demonstrate that the set of optimal weak links is sparse and, based on extensive numerical experiments, conjecture that they are also long-range. Examples are provided to illustrate the utility of our developments.

KW - Convex optimization

KW - linear programming

KW - long-range links

KW - opinion dynamics

KW - perturbation analysis

KW - social networks

KW - sparsity

UR - http://www.scopus.com/inward/record.url?scp=84988044617&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84988044617&partnerID=8YFLogxK

U2 - 10.1109/CDC.2014.7039712

DO - 10.1109/CDC.2014.7039712

M3 - Article

VL - 2015-February

SP - 2124

EP - 2129

JO - Nuclear Physics A

JF - Nuclear Physics A

SN - 0375-9474

IS - February

M1 - 7039712

ER -