There are many ways to analyze networks. As a brief teaser of each network model, we include results for a handful of network measures from two complementary perspectives. The first, standard graph theoretical measures such as average degree and global efficiency. The second is from topological data analysis, specifically persistent homology. Both can be computed along a graph filtration, or the sequence of growing graphs induced by the edge weights or node weights. Visit the corresponding pages for more information on computational details and definitions.