Laplacian centrality: A new centrality measure for weighted networks

DOI10.1016/j.ins.2011.12.027zbMath1248.05194OpenAlexW2063282514MaRDI QIDQ712485

Eddie Fuller, Xingqin Qi, Qin Wu, Cun-Quan Zhang, Ye-Zhou Wu

Publication date: 17 October 2012

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2011.12.027

zbMATH Keywords

Laplacian energyweighted networkcloseness centralitybetweenness centralitydegree centrality

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Related Items (11)

Multi-attribute community detection in international trade network ⋮ Equitable partition and star set formulas for the subgraph centrality of graphs ⋮ Identification of influential spreaders in bipartite networks: a singular value decomposition approach ⋮ Quasi-Laplacian centrality: a new vertex centrality measurement based on quasi-Laplacian energy of networks ⋮ Structure properties of collaboration network with tunable clustering ⋮ A literature survey of matrix methods for data science ⋮ Realizable cycle structures in digraphs ⋮ Community detection in attributed networks for global transfer market ⋮ Modeling systemic risk with Markov switching graphical SUR models ⋮ Detecting a most closeness-central clique in complex networks ⋮ Learning centrality by learning to route

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• A history of graph entropy measures
• A faster algorithm for betweenness centrality*

This page was built for publication: Laplacian centrality: A new centrality measure for weighted networks