Formed in 2009, the Archive Team (not to be confused with the archive.org Archive-It Team) is a rogue archivist collective dedicated to saving copies of rapidly dying or deleted websites for the sake of history and digital heritage. The group is 100% composed of volunteers and interested parties, and has expanded into a large amount of related projects for saving online and digital history.
Graphs For Data Science
Repository to accompany the substack Graphs For Data Science
Graphs for Data Science is a reader-supported publication. To receive new posts and support my work, consider becoming a free or paid subscriber.
All the code is runnable in 
-
Graphs 101 - A deep look at the airline transportation network - Graphs 101 - Airline Network.ipynb
-
Understanding DBSCAN and K-NN with Random Geometric Graphs - Random Networks.ipynb
-
Searching Graphs: Or how to get turn by turn directions from Open Street Map - Search.ipynb
-
Graph Embeddings 101: From word2vec to node2vec, and beyond - node2vec.ipynb
-
Node Centrality: Degree, Closeness, and Betweenness Centrality - Node Centrality.ipynb
-
Graph Components: Strongly and Weakly Connected Components - Components.ipynb
-
Bitcoin Transaction Network: Networks on the blockchain - Blockchain.ipynb
-
Erdős-Rényi Model and Clustering Coefficient - ER and Clustering Coefficient.ipynb
-
The Watts-Strogatz Model and the Small World Effect - WS and the Small World Effect.ipynb
-
Barabasi-Albert Model and Preferential Attachment - BA Model and Preferential Attachment.ipynb
-
Network Assortativity and the Configurational Model - Degree Correlations and the Configurational Model.ipynb
-
Community Structure and Network Modularity - Community Detection.ipynb
-
Neighborhood Overlap and Edge Weights - Edge Weight and Network structure.ipynb
-
Prim's Minimum Spanning Tree Algorithm - Prim's MST Algorithm.ipynb
-
Kahn's Algorithm for Topological Sorting - Topological Sorting.ipynb
Subscribe to the Graphs For Data Science 