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.

(in English) This paper proposes a novel edge significance considering a propagation
property. The significance is quantified with a difference of propagation caused by removing
an edge in a graph. As a propagation, we utilize a pseudo propagating process represented
by an algorithm for load balancing. In order to analyze characteristics of the proposed edge
significance, we compare it with betweenness centrality in our simulations.