Intrinsic graph structure estimation using graph Laplacian.
A graph is a mathematical representation of a set of variables where some pairs of the variables are connected by edges. Common examples of graphs are railroads, the Internet, and neural networks. It is both theoretically and practically important to estimate the intensity of direct connections between variables. In this study, a problem of estimating the intrinsic graph structure from observed data is considered. The observed data in this study are a matrix with elements representing dependency between nodes in the graph. The dependency represents more than direct connections because it includes influences of various paths. For example, each element of the observed matrix represents a co-occurrence of events at two nodes or a correlation of variables corresponding to two nodes. In this setting, spurious correlations make the estimation of direct connection difficult. To alleviate this difficulty, a digraph Laplacian is used for characterizing a graph. A generative model of this observed matrix is proposed, and a parameter estimation algorithm for the model is also introduced. The notable advantage of the proposed method is its ability to deal with directed graphs, while conventional graph structure estimation methods such as covariance selections are applicable only to undirected graphs. The algorithm is experimentally shown to be able to identify the intrinsic graph structure.
School of Science and Engineering, Waseda University, Shinjuku, Tokyo 169-8555, Japan a24.noda@fuji.waseda.jp.
Atsushi
A
Noda
Hideitsu
H
Hino
Masami
M
Tatsuno
Shotaro
S
Akaho
Noboru
N
Murata
D000465:Algorithms; D008962:Models, Theoretical; D011336:Probability