No article text was recorded for this version.
scalable centrality approximation
Version 1 of 122 papers27 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Data Science for Social Good - 2014 KDD Highlights
- Blog: Current Flow Group Closeness Centrality for Complex Networks?
- Blog: Non-conservative diffusion and its application to social network analysis
- Blog: KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation
- Blog: Improving Information Centrality of a Node in Complex Networks by Adding Edges
- Blog: Multi-Scale Link Prediction
- Blog: Kirchhoff Index As a Measure of Edge Centrality in Weighted Networks: Nearly Linear Time Algorithms
- Blog: Identifying high betweenness centrality nodes in large social networks
- Blog: Algorithms, Reductions and Equivalences for Small Weight Variants of All-Pairs Shortest Paths
- Blog: Lower Ricci Curvature for Efficient Community Detection
- Blog: Group Centrality Maximization for Large-scale Graphs
- Blog: On the Similarity between von Neumann Graph Entropy and Structural Information: Interpretation, Computation, and Applications
- Blog: Identifying and quantifying potential super-spreaders in social networks
- Blog: Efficient Approximation Algorithms for Spanning Centrality
- Blog: Limited Attention and Centrality in Social Networks
- Blog: Fast Evaluation for Relevant Quantities of Opinion Dynamics
- Blog: Big Data Clustering via Community Detection and Hyperbolic Network Embedding in IoT Applications
- Blog: Computing Classic Closeness Centrality, at Scale
- Blog: Targeted Pandemic Containment Through Identifying Local Contact Network Bottlenecks
- Blog: Biharmonic Distance Related Centrality for Edges in Weighted Networks
- Blog: Fast Computation of Kemeny's Constant for Directed Graphs
- Blog: Approximating Network Centrality Measures Using Node Embedding and Machine Learning
History & citation
Current · Permanent link
- This direction split from all-pairs shortest path bottleneck (55% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_scalable_centrality_approximation_c4cf443f,
title = {scalable centrality approximation},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/scalable-centrality-approximation/rdr_c4cf443f395e4d43b074ef392ecbd85b},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_scalable_centrality_approximation_c4cf443f_v1,
title = {scalable centrality approximation},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/scalable-centrality-approximation/rdr_c4cf443f395e4d43b074ef392ecbd85b/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}