Maximizing algebraic connectivity in the space of graphs with fixed number of vertices and edges

Kohnosuke Ogiwara, Tatsuya Fukami, Norikazu Takahashi

Research output: Contribution to journalArticle

14 Citations (Scopus)

Abstract

The second smallest eigenvalue of the Laplacian matrix, also known as the algebraic connectivity, characterizes the performance of some dynamic processes on networks, such as consensus in multiagent networks, synchronization of coupled oscillators, random walks on graphs, and so on. In a multiagent network, for example, the larger the algebraic connectivity of the graph representing interactions between agents is, the faster the convergence speed of a representative consensus algorithm is. This paper tackles the problem of finding graphs that maximize or locally maximize the algebraic connectivity in the space of graphs with a fixed number of vertices and edges. It is shown that some well-known classes of graphs such as star graphs, cycle graphs, complete bipartite graphs and circulant graphs are algebraic connectivity maximizers or local maximizers under certain conditions.

Original languageEnglish
Article number7336529
JournalIEEE Transactions on Control of Network Systems
VolumePP
Issue number99
DOIs
Publication statusPublished - 2015

Fingerprint

Algebraic Connectivity
Stars
Synchronization
Graph in graph theory
Maximise
Circulant Graph
Star Graph
Laplacian Matrix
Smallest Eigenvalue
Complete Bipartite Graph
Speed of Convergence
Dynamic Process
Coupled Oscillators
Random walk
Cycle
Interaction

Keywords

  • Algebraic connectivity
  • Consensus algorithm
  • Convergence rate
  • Laplacian matrix
  • Multiagent network

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Signal Processing
  • Computer Networks and Communications
  • Control and Optimization

Cite this

Maximizing algebraic connectivity in the space of graphs with fixed number of vertices and edges. / Ogiwara, Kohnosuke; Fukami, Tatsuya; Takahashi, Norikazu.

In: IEEE Transactions on Control of Network Systems, Vol. PP, No. 99, 7336529, 2015.

Research output: Contribution to journalArticle

@article{9c4650f4d40a4611adc9e1bfb0bb9073,
title = "Maximizing algebraic connectivity in the space of graphs with fixed number of vertices and edges",
abstract = "The second smallest eigenvalue of the Laplacian matrix, also known as the algebraic connectivity, characterizes the performance of some dynamic processes on networks, such as consensus in multiagent networks, synchronization of coupled oscillators, random walks on graphs, and so on. In a multiagent network, for example, the larger the algebraic connectivity of the graph representing interactions between agents is, the faster the convergence speed of a representative consensus algorithm is. This paper tackles the problem of finding graphs that maximize or locally maximize the algebraic connectivity in the space of graphs with a fixed number of vertices and edges. It is shown that some well-known classes of graphs such as star graphs, cycle graphs, complete bipartite graphs and circulant graphs are algebraic connectivity maximizers or local maximizers under certain conditions.",
keywords = "Algebraic connectivity, Consensus algorithm, Convergence rate, Laplacian matrix, Multiagent network",
author = "Kohnosuke Ogiwara and Tatsuya Fukami and Norikazu Takahashi",
year = "2015",
doi = "10.1109/TCNS.2015.2503561",
language = "English",
volume = "PP",
journal = "IEEE Transactions on Control of Network Systems",
issn = "2325-5870",
publisher = "IEEE CONTROL SYSTEMS SOCIETY",
number = "99",

}

TY - JOUR

T1 - Maximizing algebraic connectivity in the space of graphs with fixed number of vertices and edges

AU - Ogiwara, Kohnosuke

AU - Fukami, Tatsuya

AU - Takahashi, Norikazu

PY - 2015

Y1 - 2015

N2 - The second smallest eigenvalue of the Laplacian matrix, also known as the algebraic connectivity, characterizes the performance of some dynamic processes on networks, such as consensus in multiagent networks, synchronization of coupled oscillators, random walks on graphs, and so on. In a multiagent network, for example, the larger the algebraic connectivity of the graph representing interactions between agents is, the faster the convergence speed of a representative consensus algorithm is. This paper tackles the problem of finding graphs that maximize or locally maximize the algebraic connectivity in the space of graphs with a fixed number of vertices and edges. It is shown that some well-known classes of graphs such as star graphs, cycle graphs, complete bipartite graphs and circulant graphs are algebraic connectivity maximizers or local maximizers under certain conditions.

AB - The second smallest eigenvalue of the Laplacian matrix, also known as the algebraic connectivity, characterizes the performance of some dynamic processes on networks, such as consensus in multiagent networks, synchronization of coupled oscillators, random walks on graphs, and so on. In a multiagent network, for example, the larger the algebraic connectivity of the graph representing interactions between agents is, the faster the convergence speed of a representative consensus algorithm is. This paper tackles the problem of finding graphs that maximize or locally maximize the algebraic connectivity in the space of graphs with a fixed number of vertices and edges. It is shown that some well-known classes of graphs such as star graphs, cycle graphs, complete bipartite graphs and circulant graphs are algebraic connectivity maximizers or local maximizers under certain conditions.

KW - Algebraic connectivity

KW - Consensus algorithm

KW - Convergence rate

KW - Laplacian matrix

KW - Multiagent network

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

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

U2 - 10.1109/TCNS.2015.2503561

DO - 10.1109/TCNS.2015.2503561

M3 - Article

AN - SCOPUS:85027516330

VL - PP

JO - IEEE Transactions on Control of Network Systems

JF - IEEE Transactions on Control of Network Systems

SN - 2325-5870

IS - 99

M1 - 7336529

ER -