| Budget Amount *help |
¥4,550,000 (Direct Cost: ¥3,500,000、Indirect Cost: ¥1,050,000)
Fiscal Year 2017: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2016: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2015: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
|
|---|
| Outline of Final Research Achievements |
We studied the problem of optimizing the network topology based on various measures such as the algebraic connectivity, the clustering coefficient, the betweenness centrality, the average shortest path length, and so on. We not only derived the algebraic connectivity maximizing (or locally maximizing) graphs, the clustering coefficient locally maximizing graphs, and the global clustering coefficient maximizing graphs through theoretical analysis, but also developed various algorithms for optimizing the network topology based on the betweenness centrality and the average shortest path length. We also developed some decentralized algorithms for computing the algebraic connectivity, and some fast methods for nonnegative matrix factorization to solve the problem of community detection.
|
