CentiServer
comprehensive centrality resource and server for centralities calculation version: 1.0.0

Login




The Centiserver on OMICTools

OMICtools



Laplacian Centrality


Definition

If G is a graph of n vertices, then the Laplacian centrality with respect to v is:
Laplacian Centrality
where N(v) is the set of neighbors of v in G and dG(vi) is the degree of vi in G.

Laplacian centrality is a simple centrality measure that can be calculated in linear time. It is defined as the drop in the Laplacian energy (i.e. sum of squares of the eigenvalues in the Laplacian matrix) of the graph when the vertex is removed.

Software

References

  • QI, X., DUVAL, R. D., CHRISTENSEN, K., FULLER, E., SPAHIU, A., WU, Q., WU, Y., TANG, W. & ZHANG, C. 2013. Terrorist networks, network energy and node removal: a new measure of centrality based on Laplacian energy. Social Networking, 2, 19.
  • QI, X., FULLER, E., WU, Q., WU, Y. & ZHANG, C.-Q. 2012. Laplacian centrality: A new centrality measure for weighted networks. Information Sciences, 194, 240-253.


Comments

There are no comment yet.

Add your comment

Name:
Email:
Sum of    and  
persianstat(10215502, 0);