Graph Laplacian
Graph Laplacian is a matrix representation of a graph defined as the difference between the degree matrix and the adjacency matrix, serving as a discrete analogue of the Laplace operator that encodes structural properties of the network such as connectivity and diffusion dynamics.
2.4K
Publications
159.9K
Citations
4.1K
Authors
1.4K
Institutions
Publications per year
2017–2026
848
Variants
Laplacian Matrix
Parents
2.4K
Fast linear iterations for distributed averaging
Lin Xiao, Stephen Boyd · Systems & Control Letters · 2004 · 2.8K citations
Spectral Networks and Locally Connected Networks on Graphs
Joan Bruna, Wojciech Zaremba, Arthur Szlam et al. · arXiv (Cornell University) · 2013 · 2.7K citations · Full text
1–5 of 2.4K
4.1K
21
h-index
21
h-index
20
h-index
20
h-index
17
h-index
1–5 of 4.1K
1.4K

Chinese Academy of Sciences
Beijing, China
23 h-index
64 publications
4.1K citations
South China Normal University
Guangzhou, China
22 h-index
48 publications
2.1K citations
Tsinghua University
Beijing, China
22 h-index
67 publications
6.9K citations

Centre National de la Recherche Scientifique
Paris, France
21 h-index
76 publications
2.6K citations

Northwestern Polytechnical University
Xi'an, China
21 h-index
79 publications
4.9K citations
Carnegie Mellon University
Pittsburgh, United States
21 h-index
55 publications
3.8K citations

University of Kragujevac
Kragujevac, Serbia
20 h-index
42 publications
2.3K citations
Yale University
New Haven, United States
19 h-index
36 publications
4.9K citations
1–8 of 1.4K
226 publications · 11.1K citations
54
h-index
Repository · 131 publications · 7.3K citations
34
h-index
72 publications · 3.1K citations
29
h-index
32 publications · 5.3K citations
26
h-index
28 publications · 4.1K citations
25
h-index
1–5