met.lpcentEvcent: Laplacian centrality

Description Usage Arguments Details Author(s) References

View source: R/met.lpcentEvcent.R

Description

Calculate the directed weighted or binary Laplacian centrality for each verteces.

Usage

1
met.lpcentEvcent(M, binary = FALSE)

Arguments

M

a square adjacency matrix.

binary

if if true then calculate the directed binary version of Laplacian centrality

Details

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

Author(s)

Sebastian Sosa, Ivan Puga-Gonzalez.

References

REF laplacian !!!!!!!!!!!!!!!!

Sosa, S. (2018). Social Network Analysis, in: Encyclopedia of Animal Cognition and Behavior. Springer.


SebastianSosa/ant documentation built on Dec. 5, 2018, 2:24 a.m.