| Presentation | 2018-10-19 Convergence of a Pseudo-Decentralized Discrete-Time Algorithm for Computing Algebraic Connectivity 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. The authors recently considered a pseudo-decentralized discrete-time algorithm for computing the algebraic connectivity, and derived a sufficient condition for the estimated values of the algebraic connectivity to converge to the true value under the assumption that all eigenvalues of the Laplacian matrix are simple. In this study, we analyze the convergence property of the algorithm in the case where the algebraic connectivity is repeated, and show that the convergence is guaranteed under the same sufficient condition as before. We also confirm the validity of the derived condition through numerical experiments. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | algebraic connectivity / pseudo-decentralized algorithm / Laplacian matrix / repeated eigenvalue / convergence |
| Paper # | CAS2018-58,NLP2018-93 |
| Date of Issue | 2018-10-11 (CAS, NLP) |
| Conference Information | |
| Committee | CAS / NLP |
|---|---|
| Conference Date | 2018/10/18(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Tohoku Univ. |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | Mathematical modeling, numerical simulation etc. |
| Chair | Hideaki Okazaki(Shonan Inst. of Tech.) / Norikazu Takahashi(Okayama Univ.) |
| Vice Chair | Taizo Yamawaki(Hitachi) / Hiroaki Kurokawa(Tokyo Univ. of Tech.) |
| Secretary | Taizo Yamawaki(Shonan Inst. of Tech.) / Hiroaki Kurokawa(Hitachi) |
| Assistant | Motoi Yamaguchi(Renesas Electronics) / Masayuki Kimura(Kyoto Univ.) / Yutaka Shimada(Saitama Univ.) |
| Paper Information | |
| Registration To | Technical Committee on Circuits and Systems / Technical Committee on Nonlinear Problems |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Convergence of a Pseudo-Decentralized Discrete-Time Algorithm for Computing Algebraic Connectivity |
| Sub Title (in English) | Analysis of the Case Where Algebraic Connectivity is Repeated |
| Keyword(1) | algebraic connectivity |
| Keyword(2) | pseudo-decentralized algorithm |
| Keyword(3) | Laplacian matrix |
| Keyword(4) | repeated eigenvalue |
| Keyword(5) | convergence |
| 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 | 2018-10-19 |
| Paper # | CAS2018-58,NLP2018-93 |
| Volume (vol) | vol.118 |
| Number (no) | CAS-242,NLP-243 |
| Page | pp.pp.115-120(CAS), pp.115-120(NLP), |
| #Pages | 6 |
| Date of Issue | 2018-10-11 (CAS, NLP) |