Seminars and Colloquia by Series

Thursday, September 14, 2017 - 15:05 , Location: Skiles 006 , Gerandy Brito , Georgia Institute of Technology , gerandy@uw.edu , Organizer: Michael Damron
Wednesday, September 13, 2017 - 14:05 , Location: Skiles 005 , Catherine Beneteau , University of South Florida , Organizer: Shahaf Nitzan
Series: PDE Seminar
Tuesday, September 12, 2017 - 15:05 , Location: Skiles 006 , Inwon Kim , UCLA , Organizer: Yao Yao
Monday, September 11, 2017 - 13:55 , Location: Skiles 006 , TBA , TBA , Organizer: Caitlin Leverson
Thursday, September 7, 2017 - 11:05 , Location: Skiles 006 , José Antonio Carrillo , Imperial College London , Organizer: Mayya Zhilova
I will present a survey of the main results about first and second order models of swarming where repulsion and attraction are modeled through pairwise potentials. We will mainly focus on the stability of the fascinating patterns that you get by random particle simulations, flocks and mills, and their qualitative behavior. Qualitative properties of local minimizers of the interaction energies are crucial in order to understand these complex behaviors. Compactly supported global minimizers determine the flock patterns whose existence is related to the classical H-stability in statistical mechanics and the classical obstacle problem for differential operators.
Monday, September 4, 2017 - 14:15 , Location: Skiles 006 , None , None , Organizer: Dan Margalit
Friday, September 1, 2017 - 13:55 , Location: Skiles 006 , None , None , Organizer: John Etnyre
Thursday, August 31, 2017 - 15:05 , Location: Skiles 006 , Po-Ling Loh , University of Wisconsin-Madison , Organizer: Mayya Zhilova
We discuss two recent results concerning disease modeling on networks. The infection is assumed to spread via contagion (e.g., transmission over the edges of an underlying network). In the first scenario, we observe the infection status of individuals at a particular time instance and the goal is to identify a confidence set of nodes that contain the source of the infection with high probability. We show that when the underlying graph is a tree with certain regularity properties and the structure of the graph is known, confidence sets may be constructed with cardinality independent of the size of the infection set. In the scenario, the goal is to infer the network structure of the underlying graph based on knowledge of the infected individuals. We develop a hypothesis test based on permutation testing, and describe a sufficient condition for the validity of the hypothesis test based on automorphism groups of the graphs involved in the hypothesis test. This is joint work with Justin Khim (UPenn).
Wednesday, August 30, 2017 - 13:55 , Location: Skiles 006 , None , None , Organizer: John Etnyre
Series: Other Talks
Tuesday, August 29, 2017 - 11:00 , Location: Skiles Atrium , Rachel Kuske , Georgia Tech , Organizer: Sharon McDowell
Introduction of the new Faculty, Postdocs, Academic Professionals and Staff.

Pages