Topology optimization of network systems based on graph theory and dynamical systems theory
Project/Area Number |
24560076
|
Research Category |
Grant-in-Aid for Scientific Research (C)
|
Allocation Type | Multi-year Fund |
Section | 一般 |
Research Field |
Engineering fundamentals
|
Research Institution | Okayama University (2013-2014) Kyushu University (2012) |
Principal Investigator |
|
Project Period (FY) |
2012-04-01 – 2015-03-31
|
Project Status |
Completed (Fiscal Year 2014)
|
Budget Amount *help |
¥5,070,000 (Direct Cost: ¥3,900,000、Indirect Cost: ¥1,170,000)
Fiscal Year 2014: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2013: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2012: ¥1,950,000 (Direct Cost: ¥1,500,000、Indirect Cost: ¥450,000)
|
Keywords | ネットワーク / クラスタ係数 / 代数的連結度 / 平均頂点間距離 / 分散アルゴリズム / ニューラルネットワーク / 収束性 / 非負値行列因子分解 / 複雑ネットワーク / マルチエージェントネットワーク / 収束条件判定 / 収束判定 / 非線形回路網 / 大域クラスタ係数 / Ω行列 / 大域収束性 / 乗法型更新 |
Outline of Final Research Achievements |
We studied the problem of optimizing the network topology based on indices such as clustering coefficient, algebraic connectivity and average shortest path length. Not only some properties of the networks having optimal or locally optimal topologies were revealed by theoretical analysis, but also some algorithms that can generate networks with nearly optimal topologies were developed. We also studied some dynamics related problems such as the decentralized estimation of the algebraic connectivity, the convergence analysis of discrete-time recurrent neural networks, the analysis of the number of DC operating points in a certain nonlinear circuits, and the global convergence of iterative solution methods for nonnegative matrix factorization, and obtained many important results through both theoretical analysis and numerical experiments.
|
Report
(4 results)
Research Products
(37 results)