Laplacian centrality: A new centrality measure for weighted networks

DOI10.1016/J.INS.2011.12.027zbMATH Open1248.05194OpenAlexW2063282514MaRDI QIDQ712485FDOQ712485

Eddie Fuller, Xingqin Qi, Qin Wu, Yezhou Wu, Cun-Quan Zhang

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

Recommendations

• scientific article; zbMATH DE number 6402532
• Centrality measures for node-weighted networks via line graphs and the matrix exponential
• A centrality measure for communication ability in weighted network
• Kirchhoff index as a measure of edge centrality in weighted networks: nearly linear time algorithms
• Centrality measure in graphs

zbMATH Keywords

weighted networkLaplacian energycloseness centralitybetweenness centralitydegree centrality

Mathematics Subject Classification ID

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

Cites Work

• A note on two problems in connexion with graphs
• A faster algorithm for betweenness centrality*
• A history of graph entropy measures
• Title not available (Why is that?)

Cited In (15)

• A biplex approach to PageRank centrality: From classic to multiplex networks
• 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
• Modeling systemic risk with Markov switching graphical SUR models
• Multi-attribute community detection in international trade network
• Detection of hubs in complex networks by the Laplacian matrix
• Community detection in attributed networks for global transfer market
• Realizable cycle structures in digraphs
• A literature survey of matrix methods for data science
• Structure properties of collaboration network with tunable clustering
• New Centrality Measures in Networks
• Equitable partition and star set formulas for the subgraph centrality of graphs
• Detecting a most closeness-central clique in complex networks
• New families of Laplacian borderenergetic graphs
• Learning centrality by learning to route

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q712485)