Efficient algorithms for game-theoretic betweenness centrality
Reads0
Chats0
TLDR
This article extends the standard definition of betweenness centrality using Semivalues-a family of solution concepts from cooperative game theory that includes, among others, the Shapley value and the Banzhaf power index, and proposes a betweennessCentrality based on the Shapleys value and Semivalue.About:
This article is published in Artificial Intelligence.The article was published on 2016-02-01 and is currently open access. It has received 38 citations till now. The article focuses on the topics: Betweenness centrality & Random walk closeness centrality.read more
Citations
More filters
Proceedings ArticleDOI
Random graphs
TL;DR: Some of the major results in random graphs and some of the more challenging open problems are reviewed, including those related to the WWW.
Proceedings Article
Closeness centrality for networks with overlapping community structure
Mateusz Krzysztof Tarkowski,Piotr L. Szczepański,Talal Rahwan,Tomasz Michalak,Michael Wooldridge +4 more
TL;DR: In this article, the authors propose a new game-theoretic solution concept, called the Configuration semivalue, in order to have greater flexibility in modelling the community structure compared to previous solution concepts from cooperative game theory.
Journal ArticleDOI
Axiomatic characterization of game-theoretic centrality
TL;DR: This article provides the first axiomatic characterization of game-theoretic centralities, and shows that every possible centrality measure can be obtained following the game- theoretic approach.
Proceedings Article
Efficient computation of semivalues for game-theoretic network centrality
Piotr L. Szczepański,Mateusz Krzysztof Tarkowski,Tomasz Michalak,Paul Harrenstein,Michael Wooldridge +4 more
TL;DR: In this article, the authors present a generic framework for constructing game-theoretic network centralities, and prove that all extensions that can be expressed in this framework are computable in polynomial time.
Closeness Centrality for Networks with Overlapping Community Structure
Mateusz Krzysztof Tarkowski,Piotr L. Szczepański,Talal Rahwan,Tomasz Michalak,Michael Wooldridge +4 more
TL;DR: This work develops a new game-theoretic solution concept, which is called the Configuration semivalue, and uses the new concept as a building block to construct the first extension of Closeness centrality to networks with community structure (overlapping or otherwise).
References
More filters
Journal ArticleDOI
Collective dynamics of small-world networks
TL;DR: Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
Journal ArticleDOI
Emergence of Scaling in Random Networks
TL;DR: A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
Book
Introduction to Algorithms
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
Journal ArticleDOI
Centrality in social networks conceptual clarification
TL;DR: In this article, three distinct intuitive notions of centrality are uncovered and existing measures are refined to embody these conceptions, and the implications of these measures for the experimental study of small groups are examined.