Dear all,
Just a reminder today that this afternoon (November 6) there will be an
Analysis and Probability seminar talk by Kostantinos Tsougkas from Uppsala
University. Kostos will take on "Asymptotic complexity of fractal graphs."
Hope to see you this afternoon!
Seminar Time & Location: 3:15pm in MSB 109A
Title: Asymptotic complexity of fractal graphs
Abstract: The number of spanning trees of a graph can be evaluated by
Kirchhoff's well known matrix tree theorem by having knowledge of the
spectrum of the graph Laplacian. In fully symmetric self similar fractal
graphs, such knowledge of the spectrum is obtained by the process of
spectral decimation. We will apply this information to a sequence of
fractal graphs approximating a fully symmetric finitely ramified fractal
and establish existence and bounds of their asymptotic complexity constant.
*Current & Upcoming Seminar Talks*
*November 6 - Konstantinos Tsougkas (Uppsala)*
November 13 - Joe Chen (UConn)
December 4 - Brent Werness (Washington)
December 11 - Daniel Lacker (Brown)
