| Presentation | 2014-03-07 Graph Entropy as a Measure for Estimating Robustness of Centrality Measures against Imperfections of Graphs Masanori ISHINO, Sho TSUGAWA, Hiroyuki OHSAKI, Toru HASEGAWA, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Complex network analysis has been actively pursued to investigate the characteristics of large-scale complex networks. Graphs used for complex network analysis generally contain several types of noises. Hence, investigating the effects of noises on centrality measures and also validating the accuracy of centrality measures used in complex network analyses is one of the important research topics in the area of complex networks. To clarify the accuracy of the centrality measures, we address a research question: how can we estimate the robustness of centrality measures in a graph from topological structure of the graph? We focus on graph entropy as a possible measure for estimating the robustness of centrality measures. In this paper, we experimentally investigate the effectiveness of graph entropy for estimating the robustness of centrality measures. Consequently, we show that (1) the graph entropy is useful for estimating the robustness of four types of centrality measures against noises due to random addition and deletion of nodes and links, and (2) the graph entropy is useful for estimating the robustness of four types of popular centrality measures (i.e., closeness, betweenness, degree, and eigenvector centralities). |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Complex Network / Centrality Measures / Robustness / Graph Entropy / Social Network Analysis / Eigenvector Centrality |
| Paper # | CQ2013-101 |
| Date of Issue |
| Conference Information | |
| Committee | CQ |
|---|---|
| Conference Date | 2014/2/27(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Communication Quality (CQ) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Graph Entropy as a Measure for Estimating Robustness of Centrality Measures against Imperfections of Graphs |
| Sub Title (in English) | |
| Keyword(1) | Complex Network |
| Keyword(2) | Centrality Measures |
| Keyword(3) | Robustness |
| Keyword(4) | Graph Entropy |
| Keyword(5) | Social Network Analysis |
| Keyword(6) | Eigenvector Centrality |
| 1st Author's Name | Masanori ISHINO |
| 1st Author's Affiliation | Graduate School of Information Science and Technology, Osaka University() |
| 2nd Author's Name | Sho TSUGAWA |
| 2nd Author's Affiliation | Faculty of Engineering, Information and Systems, University of Tsukuba |
| 3rd Author's Name | Hiroyuki OHSAKI |
| 3rd Author's Affiliation | School of Science and Technology, Kwansei Gakuin University |
| 4th Author's Name | Toru HASEGAWA |
| 4th Author's Affiliation | Graduate School of Information Science and Technology, Osaka University |
| Date | 2014-03-07 |
| Paper # | CQ2013-101 |
| Volume (vol) | vol.113 |
| Number (no) | 471 |
| Page | pp.pp.- |
| #Pages | 6 |
| Date of Issue | |