Skip to search formSkip to main contentSkip to account menu

Katz centrality

In graph theory, the Katz centrality of a node is a measure of centrality in a network. It was introduced by Leo Katz in 1953 and is used to measure… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
The groundbreaking experiment of Travers and Milgram demonstrated the so-called "six degrees of separation" phenomenon, by which… 
2017
2017
This chapter discusses the notion of aggregation over the temporal dimension of temporal digraphs. This issues is particularly… 
2015
2015
By analyzing evolving centrality roles using time dependent graphs, researchers may predict future centrality values. This may… 
2013
2013
The project tackled in this article is a shopping recommender system that aims at providing recommendations of new interesting… 
2013
2013
Department of Mathematics and Statistics University of Strathclyde, Glasgow, G1 1XH, UK(Dated: June 3, 2013)In many settings it… 
2013
2013
In order to extract information from a complex, multi-agent situation, where hard facts are not readily known, it is necessary to… 
2010
2010
Social relatedness measures such as the Katz score and the commute time between pairs of nodes have been subject of significant… 
2007
2007
In this short note we apply methods of Aspinwall-Katz to compute superpotentials of D-branes wrapped on more general obstructed…