Can we compute the graph Laplacian matrix for a directed graph?
21 ビュー (過去 30 日間)
古いコメントを表示
How to find graph laplacian matrix of a directed graph?
0 件のコメント
採用された回答
Christine Tobler
2022 年 3 月 16 日
It depends how you want to define it, there is no one consistent definition of what the graph laplacian of a directed graph is. This wikipedia page https://en.wikipedia.org/wiki/Laplacian_matrix#Definitions_for_simple_graphs lists some options.
その他の回答 (1 件)
Bruno Luong
2022 年 3 月 16 日
編集済み: Bruno Luong
2022 年 3 月 16 日
In this thread I give formula for graph, for digraph you just need to be careful about indegree or outdegree
% TMW example
s = [1 2 2 3 3 3 4 5 5 5 8 8 9];
t = [2 3 4 1 4 5 5 3 6 7 9 10 10];
G = digraph(s,t);
A = G.adjacency;
% Use Laplacian
Din = diag(sum(A,1)); % in degree matrix
Dout = diag(sum(A,2)); % in degree matrix
Lin = Din - A % laplacian matrix
Lout = Dout - A % laplacian matrix
参考
カテゴリ
Help Center および File Exchange で Graph and Network Algorithms についてさらに検索
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!