Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Concept
Katz centrality
Summary
In graph theory, the Katz centrality or alpha 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 the relative degree of influence of an actor (or node) within a social network. Unlike typical centrality measures which consider only the shortest path (the geodesic) between a pair of actors, Katz centrality measures influence by taking into account the total number of walks between a pair of actors.
It is similar to Google's PageRank and to the eigenvector centrality.
Katz centrality computes the relative influence of a node within a network by measuring the number of the immediate neighbors (first degree nodes) and also all other nodes in the network that connect to the node under consideration through these immediate neighbors. Connections made with distant neighbors are, however, penalized by an attenuation factor . Each path or connection between a pair of nodes is assigned a weight determined by and the distance between nodes as .
For example, in the figure on the right, assume that John's centrality is being measured and that . The weight assigned to each link that connects John with his immediate neighbors Jane and Bob will be . Since Jose connects to John indirectly through Bob, the weight assigned to this connection (composed of two links) will be . Similarly, the weight assigned to the connection between Agneta and John through Aziz and Jane will be and the weight assigned to the connection between Agneta and John through Diego, Jose and Bob will be .
Let A be the adjacency matrix of a network under consideration. Elements of A are variables that take a value 1 if a node i is connected to node j and 0 otherwise. The powers of A indicate the presence (or absence) of links between two nodes through intermediaries. For instance, in matrix , if element , it indicates that node 2 and node 12 are connected through some walk of length 3.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Related courses (2)
EE-619: Advanced topics in network neuroscience
The main goal of this course is to give the student a solid introduction into approaches, methods, and tools for brain network analysis. The student will learn about principles of network science and
CS-401: Applied data analysis
This course teaches the basic techniques, methodologies, and practical skills required to draw meaningful insights from a variety of data, with the help of the most acclaimed software tools in the dat
Related lectures (16)
Social and Information Networks: Ranking
Explores the significance of ranking in networks, emphasizing algorithms like PageRank and HITS for web page ranking.
Statistical analysis of network data
Covers stochastic properties, network structures, models, statistics, centrality measures, and sampling methods in network data analysis.
Graph Statistics: Random Graphs, Graph Homomorphisms, and Network Analysis
Explores graph statistics, random graph generation, network analysis, centrality measures, and clustering coefficients.
Related publications (29)
Diffusion of energy technologies: the role and dynamics of supply-side information networks
Claudia Rebeca Binder Signer, Romano Tobias Wyss, Gloria Serra Coch, Maria Anna Hecher
The diffusion of energy technologies is key for supporting the energy transition. While social influence and peer effects have been extensively studied on the demand side and found to impact adoption, less focus has been given to the role of information ne ...
2023Simplicity in complex networks: a path-based centrality
Nikolaos Geroliminis, Leonardo Bellocchi
Understanding travel behaviour in transportation system is key challenge to calibrate and simulate the usage of urban mobility networks. We define in this work a path-based centrality based on the simplicity of the path between two locations in road networ ...
2020Related people (8)
Related concepts (2)
Network theory
In mathematics, computer science and network science, network theory is a part of graph theory. It defines networks as graphs where the nodes or edges possess attributes. Network theory analyses these networks over the symmetric relations or asymmetric relations between their (discrete) components. Network theory has applications in many disciplines, including statistical physics, particle physics, computer science, electrical engineering, biology, archaeology, linguistics, economics, finance, operations research, climatology, ecology, public health, sociology, psychology, and neuroscience.
Social network analysis
Social network analysis (SNA) is the process of investigating social structures through the use of networks and graph theory. It characterizes networked structures in terms of nodes (individual actors, people, or things within the network) and the ties, edges, or links (relationships or interactions) that connect them. Examples of social structures commonly visualized through social network analysis include social media networks, meme spread, information circulation, friendship and acquaintance networks, peer learner networks, business networks, knowledge networks, difficult working relationships, collaboration graphs, kinship, disease transmission, and sexual relationships.