|Computer Science/Discrete Mathematics Seminar I|
|Topic:||The mathematics of natural algorithms|
|Date:||Monday, November 14|
|Time/Room:||11:15am - 12:15pm/S-101|
I will review some of the recent techniques we've used in our study of natural algorithms. These include Dirichlet series for matrix products, mean-field approximations in opinion dynamics, graph sequence grammars, and tools for renormalizing network-based dynamical systems. If time permits, I will also discuss anti-mixing techniques for self-sustaining iterated learning. The talk will be self-contained and non-technical.