A new decentralized discrete-time algorithm for estimating algebraic connectivity of multiagent networks

Kento Endo; Norikazu Takahashi

doi:10.1109/APCCAS.2016.7803941

A new decentralized discrete-time algorithm for estimating algebraic connectivity of multiagent networks

Kento Endo, Norikazu Takahashi

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

5 Citations (Scopus)

Abstract

Algebraic connectivity of a network, which is defined as the second smallest eigenvalue of the Laplacian matrix, represents how strongly the network is connected. This paper proposes a new decentralized discrete-time algorithm for the estimation of the algebraic connectivity of multiagent networks. The validity of the proposed algorithm is verified by theoretical analysis and numerical experiments.

Original language	English
Title of host publication	2016 IEEE Asia Pacific Conference on Circuits and Systems, APCCAS 2016
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	232-235
Number of pages	4
ISBN (Electronic)	9781509015702
DOIs	https://doi.org/10.1109/APCCAS.2016.7803941
Publication status	Published - Jan 3 2017
Event	2016 IEEE Asia Pacific Conference on Circuits and Systems, APCCAS 2016 - Jeju, Korea, Republic of Duration: Oct 25 2016 → Oct 28 2016

Other

Other	2016 IEEE Asia Pacific Conference on Circuits and Systems, APCCAS 2016
Country/Territory	Korea, Republic of
City	Jeju
Period	10/25/16 → 10/28/16

ASJC Scopus subject areas

Electrical and Electronic Engineering
Signal Processing

Access to Document

10.1109/APCCAS.2016.7803941

Cite this

A new decentralized discrete-time algorithm for estimating algebraic connectivity of multiagent networks. / Endo, Kento; Takahashi, Norikazu.

2016 IEEE Asia Pacific Conference on Circuits and Systems, APCCAS 2016. Institute of Electrical and Electronics Engineers Inc., 2017. p. 232-235 7803941.

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

Endo, K & Takahashi, N 2017, A new decentralized discrete-time algorithm for estimating algebraic connectivity of multiagent networks. in 2016 IEEE Asia Pacific Conference on Circuits and Systems, APCCAS 2016., 7803941, Institute of Electrical and Electronics Engineers Inc., pp. 232-235, 2016 IEEE Asia Pacific Conference on Circuits and Systems, APCCAS 2016, Jeju, Korea, Republic of, 10/25/16. https://doi.org/10.1109/APCCAS.2016.7803941

@inproceedings{5bf3653b95e349179bf6ae846060685d,

title = "A new decentralized discrete-time algorithm for estimating algebraic connectivity of multiagent networks",

abstract = "Algebraic connectivity of a network, which is defined as the second smallest eigenvalue of the Laplacian matrix, represents how strongly the network is connected. This paper proposes a new decentralized discrete-time algorithm for the estimation of the algebraic connectivity of multiagent networks. The validity of the proposed algorithm is verified by theoretical analysis and numerical experiments.",

author = "Kento Endo and Norikazu Takahashi",

year = "2017",

month = jan,

day = "3",

doi = "10.1109/APCCAS.2016.7803941",

language = "English",

pages = "232--235",

booktitle = "2016 IEEE Asia Pacific Conference on Circuits and Systems, APCCAS 2016",

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

note = "2016 IEEE Asia Pacific Conference on Circuits and Systems, APCCAS 2016 ; Conference date: 25-10-2016 Through 28-10-2016",

}

TY - GEN

T1 - A new decentralized discrete-time algorithm for estimating algebraic connectivity of multiagent networks

AU - Endo, Kento

AU - Takahashi, Norikazu

PY - 2017/1/3

Y1 - 2017/1/3

N2 - Algebraic connectivity of a network, which is defined as the second smallest eigenvalue of the Laplacian matrix, represents how strongly the network is connected. This paper proposes a new decentralized discrete-time algorithm for the estimation of the algebraic connectivity of multiagent networks. The validity of the proposed algorithm is verified by theoretical analysis and numerical experiments.

AB - Algebraic connectivity of a network, which is defined as the second smallest eigenvalue of the Laplacian matrix, represents how strongly the network is connected. This paper proposes a new decentralized discrete-time algorithm for the estimation of the algebraic connectivity of multiagent networks. The validity of the proposed algorithm is verified by theoretical analysis and numerical experiments.

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

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

U2 - 10.1109/APCCAS.2016.7803941

DO - 10.1109/APCCAS.2016.7803941

M3 - Conference contribution

AN - SCOPUS:85011022809

SP - 232

EP - 235

BT - 2016 IEEE Asia Pacific Conference on Circuits and Systems, APCCAS 2016

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2016 IEEE Asia Pacific Conference on Circuits and Systems, APCCAS 2016

Y2 - 25 October 2016 through 28 October 2016

ER -

A new decentralized discrete-time algorithm for estimating algebraic connectivity of multiagent networks

Abstract

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this