Lecture

Centrality and Hubs

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Description

This lecture covers the concepts of centrality and hubs in network neuroscience, focusing on the three cardinal axes of centrality: degree, betweenness, and closeness. It explores the importance of nodes in network function, the small-world network phenomenon, and the structural connectome of the brain. The instructor discusses network failures, clustering coefficients, and percolation theory in brain networks, emphasizing the emergence of the giant component. Various centrality measures such as eigenvector centrality and PageRank are explained, along with examples of disconnected nodes and phase transitions in random graphs.

Official source

Ontological neighbourhood

Mathematics

Discrete mathematics: Graph theory

Related concepts (32)

Centrality

In graph theory and network analysis, indicators of centrality assign numbers or rankings to nodes within a graph corresponding to their network position. Applications include identifying the most influential person(s) in a social network, key infrastructure nodes in the Internet or urban networks, super-spreaders of disease, and brain networks. Centrality concepts were first developed in social network analysis, and many of the terms used to measure centrality reflect their sociological origin.

Katz centrality

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.

Eigenvector centrality

In graph theory, eigenvector centrality (also called eigencentrality or prestige score) is a measure of the influence of a node in a network. Relative scores are assigned to all nodes in the network based on the concept that connections to high-scoring nodes contribute more to the score of the node in question than equal connections to low-scoring nodes. A high eigenvector score means that a node is connected to many nodes who themselves have high scores. Google's PageRank and the Katz centrality are variants of the eigenvector centrality.

Betweenness centrality

In graph theory, betweenness centrality is a measure of centrality in a graph based on shortest paths. For every pair of vertices in a connected graph, there exists at least one shortest path between the vertices such that either the number of edges that the path passes through (for unweighted graphs) or the sum of the weights of the edges (for weighted graphs) is minimized. The betweenness centrality for each vertex is the number of these shortest paths that pass through the vertex.

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.

Related lectures (35)

Cell type specific connectivity and shotgun connections

Explores cell type specific connectivity and shotgun connectomics in mapping neural connections at different scales.

Centrality and Hubs

Explores centrality, hubs, eigenvectors, clustering coefficients, small-world networks, network failures, and percolation theory in brain networks.

Facebook Social Graph: Structure and Small-World Phenomenon

Examines the Facebook social graph structure, small-world phenomenon, four degrees of separation, and user homophily.

Handling Networks: Graph Theory

Covers the fundamentals of handling networks and centrality measures in graph theory.

Network Analysis: Methods and Applications Log in to Mediaspace to watch this video