What Is the Most Important Part of Your Graph? Understanding Centrality and GDS
summary
Concrete claims and tools: Neo4j Graph Data Science runs parallelized centrality algorithms and can write scores back as node properties for visualization and downstream use. Use degree centrality to find top-connected customers or most-stocked products, betweenness (bottlenecks/bridges) to find a single supply-chain step or SSO gateway whose failure splits the network, and PageRank/eigenvector influence to trace money flows or target marketing influencers; closeness and spread scores highlight fastest dissemination paths.
AI-written summary · about
chapters (6)
- 0:00Introduction to speaker
- 1:36What is centrality
- 6:29Centrality questions in business
- 13:13Common centrality types
- 25:46Why centrality matters
- 26:29Conclusion and Q&A
related talks
46mGraph Algorithms: Predict Real-World Behavior
30mHow Graph Data Science Can Turbocharge Your Knowledge Graph
31mGraph Analytics - From the Whiteboard to Your Toolbox
27mConnecting the Dots: Graph Analytics for Economic Sustainability
32mUnderstanding Complexly Connected Data using Graph Databases
56mGraph Analytic Systems
01h 41mGraph Intelligence: Enhance Reasoning and Retrieval Using Graph Analytics
49mModern Graph Databases
