Significance Analysis for Edges in a Graph by Means of Leveling Variables on Nodes
| Title | Significance Analysis for Edges in a Graph by Means of Leveling Variables on Nodes |
| Publication Type | Conference Paper |
| Year of Publication | 2016 |
| Authors | Hamda, Kento, Ishigaki, Genya, Sakai, Yoichi, Shinomiya, Norihiko |
| Conference Name | Proceedings of the 7th International Conference on Computing Communication and Networking Technologies |
| Publisher | ACM |
| Conference Location | New York, NY, USA |
| ISBN Number | 978-1-4503-4179-0 |
| Keywords | Centrality, graph theory, Human Behavior, malware analysis, Metrics, network analysis, privacy, pubcrawl, Resiliency |
| Abstract | This paper proposes a novel measure for edge significance considering quantity propagation in a graph. Our method utilizes a pseudo propagation process brought by solving a problem of a load balancing on nodes. Edge significance is defined as a difference of propagation in a graph with an edge to without it. The simulation compares our proposed method with the traditional betweenness centrality in order to obtain differences of our measure to a type of centrality, which considers propagation process in a graph. |
| URL | http://doi.acm.org/10.1145/2967878.2967909 |
| DOI | 10.1145/2967878.2967909 |
| Citation Key | hamda_significance_2016 |