Calculate the directed weighted or binary Laplacian centrality for each verteces.
a square adjacency matrix.
if if true then calculate the directed binary version of Laplacian centrality
Laplacian centrality is the drop in the Laplacian energy of the graph when the vertex is removed This version uses the eigenvalues to calculate laplacian centrality
Sebastian Sosa, Ivan Puga-Gonzalez.
REF laplacian !!!!!!!!!!!!!!!!
Sosa, S. (2018). Social Network Analysis, in: Encyclopedia of Animal Cognition and Behavior. Springer.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.