Hunter Math & Stat Colloquium

January 29 

(First week of classes)

February 5 

Lianghao Cao, Caltech (Department of Computational and Mathematical Sciences)

Title:  Operator Learning for Predictive Scientific Computing

   Abstract: Simulation-based predictions are increasingly driving high-stakes decisions that affect our welfare and security, yet building trust in these predictions remains a fundamental challenge. In this talk, I show how operator learning can be tailored to enable reliable, predictive scientific computing that would otherwise be intractable. I focus on the design of architectures and learning formulations for two problems central to this goal: inelastic homogenization in multiscale modeling and amortized Bayesian inversion in uncertainty quantification. I conclude by outlining opportunities for future research.

February 12

(College Closed)

February 19

Speaker, Institution (Department)

Title: 

   Abstract: 

February 26

Speaker, Institution (Department)

Title: 

   Abstract: 

March 5 (Meet the Faculty)

Olympia Hadjiliadis, Hunter College (Department of Mathematics and Statistics)

Title: To be announced

   Abstract: To be announced

March 12

Speaker, Institution (Department)

Title: 

   Abstract: 

March 19

Speaker, Institution (Department)

Title: 

   Abstract:

March 26 (Meet the Faculty)

Matthew Durham, Hunter College (Department of Mathematics and Statistics)

Title: To be announced

   Abstract: To be announced

April 2

(Spring Break)

April 9 

(Spring Break)

April 16

Speaker, Institution (Department)

Title: 

   Abstract: 

April 23

Abhijit Campanerkar, College of Staten Island (Department of Mathematics) and Graduate Center, CUNY

Title: Graphs, growth and geometry

   Abstract: We study the growth rate of the number of spanning trees of a sequence of planar graphs that diagrammatically converge to a planar lattice graph.  A surprising fact about the spanning tree entropy for many planar lattice graphs is that its value is closely related to hyperbolic geometry. We conjecture sharp upper and lower bounds for the spanning tree entropy of any planar lattice graph. We explain the context and recent progress for our conjecture, which lies at the intersection of hyperbolic geometry, knot theory, number theory, probability, and graph theory.

April 30

Lisa Carbone, Rutgers University (Department of Mathematics)

Title: To be announced

   Abstract: To be announced

May 7 (Student Research Presentations)

Speakers, Institution (Department)

Title: 

   Abstract: 

May 14 (Student Research Presentations)

Speakers, Institution (Department)

Title: 

   Abstract: