| Presentation | 2017-05-11 A Pseudo-Decentralized Discrete-Time Algorithm for Estimating Algebraic Connectivity of Multiagent Networks Tomohisa Urakami, Norikazu Takahashi, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | The algebraic connectivity of a network, which is defined as the second smallest eigenvalue of the Laplacian matrix, is a measure that represents how well the network is connected. Yang et al. proposed a pseudo-decentralized algorithm for agents in a network to estimate the algebraic connectivity, and proved the validity under a certain condition on the parameters. Their method is a continuous-time algorithm described by a system of differential equations. However, if we want to implement an algebraic connectivity estimation method by digital circuits, a discrete-time algorithm is needed. In this report, we focus our attention on a discrete-time version of the method proposed by Yang et al. and examine the validity through theoretical analysis and numerical experiments. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | multiagent network / algebraic connectivity / pseudo-decentralized algorithm / discrete-time algorithm |
| Paper # | NLP2017-12 |
| Date of Issue | 2017-05-04 (NLP) |
| Conference Information | |
| Committee | NLP |
|---|---|
| Conference Date | 2017/5/11(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Okayama University of Science |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | etc. |
| Chair | Hisato Fujisaka(Hiroshima City Univ.) |
| Vice Chair | Masaharu Adachi(Tokyo Denki Univ.) |
| Secretary | Masaharu Adachi(Konan Univ.) |
| Assistant | Hiroyuki Asahara(Okayama Univ. of Science) / Toshihiro Tachibana(Shonan Inst. of Tech.) |
| Paper Information | |
| Registration To | Technical Committee on Nonlinear Problems |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | A Pseudo-Decentralized Discrete-Time Algorithm for Estimating Algebraic Connectivity of Multiagent Networks |
| Sub Title (in English) | |
| Keyword(1) | multiagent network |
| Keyword(2) | algebraic connectivity |
| Keyword(3) | pseudo-decentralized algorithm |
| Keyword(4) | discrete-time algorithm |
| 1st Author's Name | Tomohisa Urakami |
| 1st Author's Affiliation | Okayama University(Okayama Univ.) |
| 2nd Author's Name | Norikazu Takahashi |
| 2nd Author's Affiliation | Okayama University(Okayama Univ.) |
| Date | 2017-05-11 |
| Paper # | NLP2017-12 |
| Volume (vol) | vol.117 |
| Number (no) | NLP-18 |
| Page | pp.pp.57-62(NLP), |
| #Pages | 6 |
| Date of Issue | 2017-05-04 (NLP) |