An Infinity Norm-Based Pseudo-Decentralized Discrete-Time Algorithm for Computing Algebraic Connectivity

Katsuki Shimada; Tsuyoshi Migita; Norikazu Takahashi

doi:10.1109/SSCI44817.2019.9002875

An Infinity Norm-Based Pseudo-Decentralized Discrete-Time Algorithm for Computing Algebraic Connectivity

Katsuki Shimada, Tsuyoshi Migita, Norikazu Takahashi

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Citation (Scopus)

Abstract

In some applications of multiagent networks, it is desired that each agent can evaluate how well the network is connected. In this paper, we propose a novel discrete-time algorithm for each agent to compute the algebraic connectivity of the network in a pseudo-decentralized manner. The proposed algorithm requires less computational cost than the conventional algorithm. We also analyze the dynamical behavior of the proposed algorithm and prove under some assumptions on the parameter values and the initial state values of the agents that all agents can compute the algebraic connectivity.

Original language	English
Title of host publication	2019 IEEE Symposium Series on Computational Intelligence, SSCI 2019
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1292-1298
Number of pages	7
ISBN (Electronic)	9781728124858
DOIs	https://doi.org/10.1109/SSCI44817.2019.9002875
Publication status	Published - Dec 2019
Event	2019 IEEE Symposium Series on Computational Intelligence, SSCI 2019 - Xiamen, China Duration: Dec 6 2019 → Dec 9 2019

Publication series

Name	2019 IEEE Symposium Series on Computational Intelligence, SSCI 2019

Conference

Conference	2019 IEEE Symposium Series on Computational Intelligence, SSCI 2019
Country/Territory	China
City	Xiamen
Period	12/6/19 → 12/9/19

Keywords

algebraic connectivity
convergence
multiagent networks
pseudo-decentralized algorithm

ASJC Scopus subject areas

Artificial Intelligence
Computer Science Applications
Modelling and Simulation

Access to Document

10.1109/SSCI44817.2019.9002875

Cite this

Shimada, K., Migita, T., & Takahashi, N. (2019). An Infinity Norm-Based Pseudo-Decentralized Discrete-Time Algorithm for Computing Algebraic Connectivity. In 2019 IEEE Symposium Series on Computational Intelligence, SSCI 2019 (pp. 1292-1298). Article 9002875 (2019 IEEE Symposium Series on Computational Intelligence, SSCI 2019). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/SSCI44817.2019.9002875

An Infinity Norm-Based Pseudo-Decentralized Discrete-Time Algorithm for Computing Algebraic Connectivity. / Shimada, Katsuki; Migita, Tsuyoshi ; Takahashi, Norikazu.
2019 IEEE Symposium Series on Computational Intelligence, SSCI 2019. Institute of Electrical and Electronics Engineers Inc., 2019. p. 1292-1298 9002875 (2019 IEEE Symposium Series on Computational Intelligence, SSCI 2019).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Shimada, K, Migita, T & Takahashi, N 2019, An Infinity Norm-Based Pseudo-Decentralized Discrete-Time Algorithm for Computing Algebraic Connectivity. in 2019 IEEE Symposium Series on Computational Intelligence, SSCI 2019., 9002875, 2019 IEEE Symposium Series on Computational Intelligence, SSCI 2019, Institute of Electrical and Electronics Engineers Inc., pp. 1292-1298, 2019 IEEE Symposium Series on Computational Intelligence, SSCI 2019, Xiamen, China, 12/6/19. https://doi.org/10.1109/SSCI44817.2019.9002875

Shimada K, Migita T , Takahashi N. An Infinity Norm-Based Pseudo-Decentralized Discrete-Time Algorithm for Computing Algebraic Connectivity. In 2019 IEEE Symposium Series on Computational Intelligence, SSCI 2019. Institute of Electrical and Electronics Engineers Inc. 2019. p. 1292-1298. 9002875. (2019 IEEE Symposium Series on Computational Intelligence, SSCI 2019). doi: 10.1109/SSCI44817.2019.9002875

Shimada, Katsuki ; Migita, Tsuyoshi ; Takahashi, Norikazu. / An Infinity Norm-Based Pseudo-Decentralized Discrete-Time Algorithm for Computing Algebraic Connectivity. 2019 IEEE Symposium Series on Computational Intelligence, SSCI 2019. Institute of Electrical and Electronics Engineers Inc., 2019. pp. 1292-1298 (2019 IEEE Symposium Series on Computational Intelligence, SSCI 2019).

@inproceedings{a1fffe97d6e843b8830c472f03689bf7,

title = "An Infinity Norm-Based Pseudo-Decentralized Discrete-Time Algorithm for Computing Algebraic Connectivity",

abstract = "In some applications of multiagent networks, it is desired that each agent can evaluate how well the network is connected. In this paper, we propose a novel discrete-time algorithm for each agent to compute the algebraic connectivity of the network in a pseudo-decentralized manner. The proposed algorithm requires less computational cost than the conventional algorithm. We also analyze the dynamical behavior of the proposed algorithm and prove under some assumptions on the parameter values and the initial state values of the agents that all agents can compute the algebraic connectivity.",

keywords = "algebraic connectivity, convergence, multiagent networks, pseudo-decentralized algorithm",

author = "Katsuki Shimada and Tsuyoshi Migita and Norikazu Takahashi",

year = "2019",

month = dec,

doi = "10.1109/SSCI44817.2019.9002875",

language = "English",

series = "2019 IEEE Symposium Series on Computational Intelligence, SSCI 2019",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "1292--1298",

booktitle = "2019 IEEE Symposium Series on Computational Intelligence, SSCI 2019",

note = "2019 IEEE Symposium Series on Computational Intelligence, SSCI 2019 ; Conference date: 06-12-2019 Through 09-12-2019",

}

TY - GEN

T1 - An Infinity Norm-Based Pseudo-Decentralized Discrete-Time Algorithm for Computing Algebraic Connectivity

AU - Shimada, Katsuki

AU - Migita, Tsuyoshi

AU - Takahashi, Norikazu

PY - 2019/12

Y1 - 2019/12

N2 - In some applications of multiagent networks, it is desired that each agent can evaluate how well the network is connected. In this paper, we propose a novel discrete-time algorithm for each agent to compute the algebraic connectivity of the network in a pseudo-decentralized manner. The proposed algorithm requires less computational cost than the conventional algorithm. We also analyze the dynamical behavior of the proposed algorithm and prove under some assumptions on the parameter values and the initial state values of the agents that all agents can compute the algebraic connectivity.

AB - In some applications of multiagent networks, it is desired that each agent can evaluate how well the network is connected. In this paper, we propose a novel discrete-time algorithm for each agent to compute the algebraic connectivity of the network in a pseudo-decentralized manner. The proposed algorithm requires less computational cost than the conventional algorithm. We also analyze the dynamical behavior of the proposed algorithm and prove under some assumptions on the parameter values and the initial state values of the agents that all agents can compute the algebraic connectivity.

KW - algebraic connectivity

KW - convergence

KW - multiagent networks

KW - pseudo-decentralized algorithm

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

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

U2 - 10.1109/SSCI44817.2019.9002875

DO - 10.1109/SSCI44817.2019.9002875

M3 - Conference contribution

AN - SCOPUS:85080916017

T3 - 2019 IEEE Symposium Series on Computational Intelligence, SSCI 2019

SP - 1292

EP - 1298

BT - 2019 IEEE Symposium Series on Computational Intelligence, SSCI 2019

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2019 IEEE Symposium Series on Computational Intelligence, SSCI 2019

Y2 - 6 December 2019 through 9 December 2019

ER -

An Infinity Norm-Based Pseudo-Decentralized Discrete-Time Algorithm for Computing Algebraic Connectivity

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this