A centrality measure for networks with community structure based on a generalization of the Owen value

MaRDI QIDQ5283048zbMATH OpenFDO

Authors Piotr L. Szczepański, M. J. Wooldridge, Tomasz P. Michalak

Publication date 18 July 2017

Full work available at URL http://ebooks.iospress.nl/volumearticle/37051

Mathematics Subject Classification ID

Cooperative games (91A12) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Games involving graphs (91A43)

Recommendations

• Centrality and power in social networks: A game theoretic approach.
• Game-theoretic centrality measures for weighted graphs
• Efficient computation of semivalues for game-theoretic network centrality
• Efficient algorithms for game-theoretic betweenness centrality
• Measuring centrality by a generalization of degree

Cited in

(13)

• Diffusion centrality: a paradigm to maximize spread in social networks
• Efficient algorithms for game-theoretic betweenness centrality
• Modified Myerson value for determining the centrality of graph vertices
• A modified Myerson value for determining the centrality of graph vertices
• Importance of Agents in Networks: Clique Based Game-Theoretic Approach
• Analyzing the Zerkani network with the Owen value
• Some properties of transportation network cooperative games
• Game-theoretic centrality measures for weighted graphs
• Efficient computation of semivalues for game-theoretic network centrality
• Attachment centrality: measure for connectivity in networks
• Centrality and power in social networks: A game theoretic approach.
• Social centrality using network hierarchy and community structure
• Axiomatic characterization of game-theoretic centrality

This page was built for publication: A centrality measure for networks with community structure based on a generalization of the Owen value

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