Graph Theory Blink 3.1 (Connected components in a graph and minimum spanning tree)

A roadmap to navigate Graph Theory Blinks.
This course comes at the intersection of mathematics, learning, and algorithms.
The PDF notes of this video can be downloaded at: https://drive.google.com/file/d/10giwdSRrJArVswYZR7M4VAE0GXmjaFrM/view?usp=sharing

*** 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),
https://snap.stanford.edu/snappy/index.html

=========================================================================================
Lecture 3 will cover connected components, graph robustness, and fragmentation.
=========================================================================================

3. Graph interconnectedness
3.1 Connected components in directed and undirected graphs
3.2 Percolation and robustness of a graph
3.3 Paper group study: Albert et al. Error and attack tolerance of complex networks (2000). Letters to Nature. http://barabasi.com/f/77.pdf

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

1. Adversarial attacks of neural networks (graphs), a talk by Dr Alhussein Fawzi, Google Deep Mind Researcher at NASSMA 2019: https://www.youtube.com/watch?v=ZMdUhHipUWA
Slides: http://alhusseinfawzi.info/slides/Cambridge_23052019.pdf
2. Albert et al. Error and attack tolerance of complex networks. Letters to Nature. http://barabasi.com/f/77.pdf

**** Source code ****
SNAP: https://snap.stanford.edu/snappy/index.html (connected components)

Видео Graph Theory Blink 3.1 (Connected components in a graph and minimum spanning tree) канала BASIRA Lab