Live briefing
Everything about Betweenness centrality
Measure of a graph's centrality, based on shortest paths
In graph theory, betweenness centrality is a measure of centrality in a graph based on shortest paths. Betweenness centrality measures how frequently a node appears on the shortest path between other nodes in the graph. For every pair of vertices in a connected graph, there exists at least one shortest path between the vertices, that is, there exists at least one path such that either the number of edges that the path passes through or the sum of the weights of the edges is minimized. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Betweenness centralityA 5-minute orientation
- Skim a recent paper: Determining dependence, centrality, and dynamic networks between green bonds and financial marketsInfluential work since 2022
- Pick up a classic book: Anpo to genpatsuThe most-reprinted book on the subject
- Read the landmark paper: A Set of Measures of Centrality Based on BetweennessCited 8,510 times
- Go sideways: CentralityA closely related topic
- Go sideways: Brandes' algorithmA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
A Set of Measures of Centrality Based on Betweenness
A faster algorithm for betweenness centrality*
A measure of betweenness centrality based on random walks
Network embeddedness and the exploration of novel technologies: Technological distance, betweenness centrality and density
On variants of shortest-path betweenness centrality and their generic computation
Centrality in valued graphs: A measure of betweenness based on network flow
Betweenness centrality in large complex networks
Betweenness centrality as an indicator of the interdisciplinarity of scientific journals
🆕 Influential since 2022
Determining dependence, centrality, and dynamic networks between green bonds and financial markets
Structural analysis and the sum of nodes’ betweenness centrality in complex networks
A spatial interaction incorporated betweenness centrality measure
Association between superwoman schema, depression, and resilience: The mediating role of social isolation and gendered racial centrality.
📚 Books worth reading
- 📕Anpo to genpatsuIshida, Takeshi · 2012
- 📕Acuerdo de asociación (ADA) entre la Unión Europea y CentroaméricaRaúl Llarull · 2010
- 📕El acuerdo de asociación con la Unión Europea y el ALBAGloria Carrión Fonseca · 2012
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Centrality In graph theory and network analysis, indicators of centrality assign numbers or rankings to nodes within a graph corresponding to their network position…
- Brandes' algorithm In network theory, Brandes' algorithm is an algorithm for calculating the betweenness centrality of vertices in a graph. The algorithm was first published…
- Distance (graph theory) In the mathematical field of graph theory, the distance between two vertices in a graph is the number of edges in a shortest path (also called a graph…
- Shortest-path tree In mathematics and computer science, a shortest-path tree rooted at a vertex v of a connected, undirected graph G is a spanning tree T of G, such that…
- Shortest path problem In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights…
- Network science Network science is an academic field which studies complex networks such as telecommunication networks, computer networks, biological networks, cognitive…
- Wiener connector In network theory, the Wiener connector is a means of maximizing efficiency in connecting specified "query vertices" in a network. Given a connected, undirected…
- Bellman–Ford algorithm The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph…