Graph Theory Blink 5.5 (Graph efficiency measures)

#GraphTheory #GraphAnalysis #SNAPLibrary #Dijkstra #ShortestPath #Diffusion #Navigation #Routing

A roadmap to navigate Graph Theory Blinks.
This course comes at the intersection of mathematics, learning, and algorithms.

*** Primarily textbooks:
1) Bullmore, Edward T. Fornito, Alex Zalesky, Andrew - Fundamentals of Brain Network Analysis-Academic Press, Elsevier (2016)
2) Arthur Benjamin, Gary Chartrand, Ping Zhang - The Fascinating World of Graph Theory-Princeton University Press (2015)
3) (Graduate Texts in Mathematics) Reinhard Diestel - Graph theory-Springer (2006)

*** Library: SNAP library (network analysis tool),

=======================================================================================================
Lecture 5 will cover shortest path routing and diffusion on graphs to derive graph efficiency measures
=======================================================================================================

5. Shortest path lengths and diffusion on graphs
5.1 Introduction to path routing, diffusion and navigation
5.2 Walks, trails, paths, and cycles
5.3 Shortest path length (Dijkstra’s algorithm)
5.4 Shortest path based efficiency measures
5.5 Diffusion on graphs

**** Resources and further readings ****

2. Check Chapter 7 of the textbook on the Fundamentals of Brain Network Analysis, Elsevier (2016)
3. Ek et al., Global efficiency of graphs, AKCE International Journal of Graphs and Combinatorics 87(1), 2015.

[mohammaddindoost]

I think there is a mistake in calculating L and Harmonic mean in the video ( at time 13:21).