Directed Networks & HypergraphsExplores directed networks with asymmetric relationships and hypergraphs that generalize graphs by allowing edges to connect any subset of nodes.
Linear Algebra: DiagonalizationExplores the diagonalization of matrices and the conditions for exact diagonalization, with examples demonstrating the process.
Counting labeled treesExplores counting labeled trees using Prüfer codes and algorithms, providing maps between trees and sequences.
Networks, FlowsCovers the definition of flow in a network and flow calculation.
Max Sum DiversificationExplores maximizing diversity in document selection, graph clique determination, theorems on negative type, and convex optimization.