Print Settings
 

MS&E 337: Large Networks and Graph Limits

Random graph theory, Erdos-Renyi, and other network models, the algebra of graph homomorphisms, limits for dense and sparse graphs, and applications in algorithm design, graph representation learning, and others.
Terms: Aut | Units: 3
© Stanford University | Terms of Use | Copyright Complaints