Past Events

We first review some known results about resistance matrix of an undirected graph. We then define resistance distance in a strongly connected, directed graph. When the graph is balanced, that is, the indegree and the outdegree of any vertex are the...

Kinetic equations describe the nonequilibrium dynamics of a complex system using a probability density function. Despite of their important role in multiscale modeling to bridge microscopic and macroscopic scales, numerically solving kinetic...

Clemens–Griffiths introduced the classical intermediate Jacobian obstruction to rationality for complex threefolds, and used it to show irrationality of the cubic threefold. Recently, over non-closed fields, Hassett–Tschinkel and Benoist–Wittenberg...

A spanning tree is a connected subgraph of a graph with no cycles. I will explain some well-known connection between such collection of trees and some Poissonian collection of loops, and a magical algorithm (known as Wilson's alorithm) to sample such...

It is believed that distinct primitive L-functions are “statistically independent”. The independence can be interpreted in many different ways. We are interested in the joint value distributions and their applications in moments and extreme values...

In this talk, I will introduce two ecological models with intraguild predation. I will first focus on developing a novel mathematical model that couples a competition model with an intraguild predation model via dispersal of intraguild prey driven by...

Triangulated categories were introduced to capture some of the extra structure present in the derived category of a ring and the stable homotopy category, and today they are present wherever homological algebra plays a central role. In the case of...

Numerical simulations of physical or chemical processes in heterogeneous media require a resolution of the heterogeneous structure. If, however, this heterogeneity is microscopically small while the object under consideration is large, a dimensional...

Given a subshift, there exist certain words that can always be replaced by other words (possibly of different size). In this talk I will show how the measure of maximal entropy of these two words are related by an inequality. Furthermore I will...