Department Seminars & Colloquia
2024-02 | ||||||
---|---|---|---|---|---|---|
Sun | Mon | Tue | Wed | Thu | Fri | Sat |
1 | 2 | 3 | ||||
4 | 5 | 6 | 7 | 8 | 9 | 10 |
11 | 12 | 13 | 14 | 15 1 | 16 | 17 |
18 | 19 | 20 | 21 | 22 | 23 | 24 |
25 | 26 | 27 | 28 | 29 |
When you're logged in, you can subscribe seminars via e-mail
Geometric and topological structures can aid statistics in several ways. In high dimensional statistics, geometric structures can be used to reduce dimensionality. High dimensional data entails the curse of dimensionality, which can be avoided if there are low dimensional geometric structures. On the other hand, geometric and topological structures also provide useful information. Structures may carry scientific meaning about the data and can be used as features to enhance supervised or unsupervised learning.
In this talk, I will explore how statistical inference can be done on geometric and topological structures. First, given a manifold assumption, I will explore the minimax rate for estimating the dimension of the manifold. Second, also under the manifold assumption, I will explore the minimax rate for estimating the reach, which is a regularity quantity depicting how a manifold is smooth and far from self-intersecting. Third, I will investigate inference on cluster trees, which is a hierarchy tree of high-density clusters of a density function. Fourth, I will investigate inference on persistent homology, which quantifies salient topological features that appear at different resolutions of the data.
The Kudla-Rapoport conjecture predicts a relation between the arithmetic intersection numbers of special cycles on a unitary Shimura variety and the derivative of representation densities for hermitian forms at a place of good reduction. In this talk, I will present a variant of the Kudla-Rapoport conjecture at a place of bad reduction. Additionally, I will discuss a proof of the conjecture in several new cases in any dimension. This is joint work with Qiao He and Zhiyu Zhang.
Scientific knowledge, written in the form of differential equations, plays a vital role in various deep learning fields. In this talk, I will present a graph neural network (GNN) design based on reaction-diffusion equations, which addresses the notorious oversmoothing problem of GNNs. Since the self-attention of Transformers can also be viewed as a special case of graph processing, I will present how we can enhance Transformers in a similar way. I will also introduce a spatiotemporal forecasting model based on neural controlled differential equations (NCDEs). NCDEs were designed to process irregular time series in a continuous manner and for spatiotemporal processing, it needs to be combined with a spatial processing module, i.e., GNN. I will show how this can be done.
This is part of an informal seminar series to be given by Mr. Jaehong Kim, who has been studying the book "Hodge theory and Complex Algebraic Geometry Vol 1 by Claire Voisin" for a few months. There will be 6-8 seminars during Spring 2024, and it will summarize about 70-80% of the book.
In dimension 4, the works of Freedman and Donaldson led us to the striking discovery that the smooth category is drastically different from the topological category, compared to other dimensions. Since then, it has been extraordinarily successful in investigating the difference in various contexts. In contrast, our understanding of when smooth and topological categories would exhibit similarity in dimension 4 remained, at best, minimal. In this talk, we will introduce some recent progress on new “topological = smooth” results in dimension 4, focusing on embedded disks.
Motivated by the Cohen-Lenstra heuristics, Friedman and Washington studied the distribution of the cokernels of random matrices over the ring of p-adic integers. This has been generalized in many directions, as well as some applications to the distribution of random algebraic objects. In this talk, first we give an overview of random matrix theory over the ring of p-adic integers, together with their connections to conjectures in number theory. After that, we investigate the distribution of the cokernels of random p-adic matrices with given zero entries. The second part of this talk is based on work in progress with Gilyoung Cheong, Dong Yeap Kang and Myungjun Yu.
The Julia set of a (hyperbolic) rational map
naturally comes embedded in the Riemann sphere, and thus has a
Hausdorff dimension. But the Hausdorff dimension varies if we tweak
the parameters slightly. Is there a "best" representative or more
invariant dimension? One answer comes from looking at
quasi-symmetries; the \emph{conformal dimension} of the Julia set is
the minimum Hausdorff dimension of any metri quasi-symmetric to the
original. We characterize the Ahlfors-regular conformal dimension of
Julia sets of rational maps using graphical energies arising from a
natural combinatorial description. (Ahlfors-regular is a dynamically
natural extra condition on the metric.)
This is joint work with Kevin Pilgrim.
This talk presents mathematical modeling, numerical analysis and simulation using finite element method in the field of electromagnetics at various scales, from analyzing quantum mechanical effects to calculating the scattering of electromagnetic wave in free space. First, we discuss and analyze the Schrodinger-Poisson system of quantum transport model to calculate electron states in three-dimensional heterostructures. Second, the electromagnetic vector wave scattering problem is solved to analyze the field characteristics in the presence of stealth platform. This talk also introduces several challenging issues in these applications and proposes their solutions through mathematical analysis.
A rational map, like f(z) = (1+z^2)/(1-z^2),
gives a map from the (extended) complex plane to itself. Studying the
dynamics under iteration yields beautiful Julia set fractals with
intricate nested structure. How can that structure be best understood?
One approach is combinatorial or topological, giving concrete models
for the Julia set and tools for cataloguing the possibilities.
Optimal Transport (OT) problem investigates a transport map that bridges two distributions while minimizing a specified cost function. OT theory has been widely utilized in generative modeling. Initially, the OT-based Wasserstein metric served as a measure for assessing the distance between data and generated distributions. More recently, the OT transport map, connecting data and prior distributions, has emerged as a new approach for generative models. In this talk, we will introduce generative models based on Optimal Transport. Specifically, we will present our work on a generative model utilizing Unbalanced Optimal Transport. We will also discuss our subsequent efforts to address the challenges associated with this approach.
This is part of an informal seminar series to be given by Mr. Jaehong Kim, who has been studying the book "Hodge theory and Complex Algebraic Geometry Vol 1 by Claire Voisin" for a few months.
There will be 6-8 seminars during Spring 2024, and it will summarize about 70-80% of the book.
List flow is a geometric flow for a pair $(g,u)$, where $g$ is a Riemannian metric and $u$ a smooth function. This extended Ricci flow system has applications to static vacuum solutions of the Einstein equations and to Ricci flow on warped products. The coupling induces additional difficulties compared to Ricci flow, which we overcome by proving an improved bound on the Hessian of the function u. This allows us to prove a convergence result, a singularity classification result and a surgery result in three dimensions.
정보 이론의 주요 관심사 중 하나는 통신 과정에서 오류가 발생할 확률을 최소화하는 것이다. 예를 들어 PCR 검사 결과 음성일 경우 0으로 코드화하고 양성일 경우 1로 코드화한다고 하였을 때, 이 중요한 정보가 통신 상황에서 오류가 발생하여 0이 1로 잘못 전달되거나 1이 0으로 잘못 전달되는 경우가 발생할 수 있다. 만약 오류 발생 확률이 10%라면 적절한 방법을 동원하여 오류 발생 확률을 3% 혹은 1% 등으로 줄이기 위해 노력하는 것이 자연스럽다. 강연 전반부의 목표는 주어진 자원의 어느 정도를 오류 정정에 사용하는 것이 가장 효율적일지를 다루는 샤논 채널 코딩 정리의 의미를 이해하는 것이다. 그리고 강연 후반부의 목표는 최근 큰 주목을 받고 있는 양자 정보 이론 분야에서 2000년대 초반 확립된 코딩 정리의 의미를 파악하고, 이와 관련한 수학적 난제를 소개하는 것이다.