Department Seminars & Colloquia




2024-03
Sun Mon Tue Wed Thu Fri Sat
          1 2
3 4 5 1 6 7 8 3 9
10 11 12 3 13 14 2 15 3 16
17 18 19 1 20 21 1 22 3 23
24 25 26 3 27 28 2 29 3 30
31            
2024-04
Sun Mon Tue Wed Thu Fri Sat
  1 1 2 1 3 2 4 2 5 5 6
7 8 1 9 4 10 11 12 3 13
14 15 16 1 17 18 19 1 20 1
21 22 1 23 2 24 25 2 26 4 27
28 29 30 1        

When you're logged in, you can subscribe seminars via e-mail

A family $\mathcal F$ of (di)graphs is said to have the half- or quarter-integral Erdős-Pósa property if, for any integer $k$ and any (di)graph $G$, there either exist $k$ copies of graphs in $\mathcal F$ within $G$ such that any vertex of $G$ is contained in at most 2, respectively at most 4, of these copies, or there exists a vertex set $A$ of size at most $f(k)$ such that $G - A$ contains no copies of graphs in $\mathcal F$. Very recently we showed that even dicycles have the quarter-integral Erdős-Pósa property [STOC'24] via the proof of a structure theorem for digraphs without large packings of even dicycles. In this talk we discuss our current effort to improve this approach towards the half-integral Erdős-Pósa property, which would be best possible, as even dicycles do not have the integral Erdős-Pósa property. Complementing the talk given by Sebastian Wiederrecht in this seminar regarding our initial result, we also shine a light on some of the particulars of the embedding we use in lieu of flatness and how this helps us to move even dicycles through the digraph. In the process of this, we highlight the parts of the proof that initially caused the result to be quarter-integral. (This is joint work with Ken-ichi Kawarabayashi, Stephan Kreutzer, and Sebastian Wiederrecht.)
Host: Sang-il Oum     English     2024-03-27 21:01:18
In nonstationary bandit learning problems, the decision-maker must continually gather information and adapt their action selection as the latent state of the environment evolves. In each time period, some latent optimal action maximizes expected reward under the environment state. We view the optimal action sequence as a stochastic process, and take an information-theoretic approach to analyze attainable performance. We bound per-period regret in terms of the entropy rate of the optimal action process. The bound applies to a wide array of problems studied in the literature and reflects the problem’s information structure through its information-ratio.
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.
Host: 박진현     Contact: 박진현 (2734)     Korean     2024-04-05 00:01:19
Hamiltonian time-series data are observations derived from a Hamiltonian dynamical system. Our goal is to analyze the time-series data using the topological information of Hamiltonian dynamical systems. Exact Multi-parameter Persistent Homology is one aspect of this analysis, in this case, the Hamiltonian system is composed of uncoupled one-dimensional harmonic oscillators. This is a very simple model. However, we can induce the exact persistence barcode formula from it. From this formula, we can obtain a calculable and interpretable analysis. Filtration is necessary to extract the topological information of data and to define persistent homology. However, in many cases, we use static filtrations, such as the Vietoris-Rips filtration. My ongoing research is on topological optimization, which involves finding a filtration in Exact Multi-parameter Persistent Homology that minimizes the cross-entropy loss function for the classification of time-series data.
Host: 김우진     To be announced     2024-04-18 19:18:50
"An improved rhythmicity analysis method using Gaussian Processes detects cell-density dependent circadian oscillations in stem cells", ArXiv. (2023) will be discussed in this Journal Club. Detecting oscillations in time series remains a challenging problem even after decades of research. In chronobiology, rhythms in time series (for instance gene expression, eclosion, egg-laying and feeding) datasets tend to be low amplitude, display large variations amongst replicates, and often exhibit varying peak-to-peak distances (non-stationarity). Most currently available rhythm detection methods are not specifically designed to handle such datasets. Here we introduce a new method, ODeGP (Oscillation Detection using Gaussian Processes), which combines Gaussian Process (GP) regression with Bayesian inference to provide a flexible approach to the problem. Besides naturally incorporating measurement errors and non-uniformly sampled data, ODeGP uses a recently developed kernel to improve detection of non-stationary waveforms. An additional advantage is that by using Bayes factors instead of p-values, ODeGP models both the null (non-rhythmic) and the alternative (rhythmic) hypotheses. Using a variety of synthetic datasets we first demonstrate that ODeGP almost always outperforms eight commonly used methods in detecting stationary as well as non-stationary oscillations. Next, on analyzing existing qPCR datasets that exhibit low amplitude and noisy oscillations, we demonstrate that our method is more sensitive compared to the existing methods at detecting weak oscillations. Finally, we generate new qPCR time-series datasets on pluripotent mouse embryonic stem cells, which are expected to exhibit no oscillations of the core circadian clock genes. Surprisingly, we discover using ODeGP that increasing cell density can result in the rapid generation of oscillations in the Bmal1 gene, thus highlighting our method’s ability to discover unexpected patterns. In its current implementation, ODeGP (available as an R package) is meant only for analyzing single or a few time-trajectories, not genome-wide datasets. If you want to participate in the seminar, you need to enter IBS builiding (https://www.ibs.re.kr/bimag/visiting/). Please contact if you first come IBS to get permission to enter IBS building.
Host: Jae Kyoung Kim     English     2024-03-26 23:55:21
In recent years, ``stealthy'' particle systems have gained considerable attention in condensed matter physics. These are particle systems for which the diffraction spectrum or structure function (i.e. the Fourier transform of the truncated pair correlation function) vanishes in a neighbourhood of the origin in the wave space. These systems are believed to exhibit the phenomenon of ``cloaking'', i.e. being invisible to probes of certain frequencies. They also exhibit the phenomenon of hyperuniformity, namely suppressed fluctuations of particle counts, a property that has been shown to arise in a wide array of settings in chemistry, physics and biology. We will demonstrate that stealthy particle systems (and their natural extensions to stealthy stochastic processes) exhibit a highly rigid structure; in particular, their entropy per unit volume is degenerate, and any spatial void in such a system cannot exceed a certain size. Time permitting, we will also discuss the intriguing correlation geometry of such systems and its interplay with the analytical properties of their diffraction spectrum. Based on joint works with Joel Lebowitz and Kartick Adhikari.
Host: 남경식     English     2024-04-22 10:15:17
We say that two functors Λ and Γ between thin categories of relational structures are adjoint if for all structures A and B, we have that Λ(A) maps homomorphically to B if and only if A maps homomorphically to Γ(B). If this is the case Λ is called the left adjoint to Γ and Γ the right adjoint to Λ. In 2015, Foniok and Tardif described some functors on the category of digraphs that allow both left and right adjoints. The main contribution of Foniok and Tardif is a construction of right adjoints to some of the functors identified as right adjoints by Pultr in 1970. We shall present several recent advances in this direction including a new approach based on the notion of Datalog Program borrowed from logic.
Host: Sang-il Oum     English     2024-03-27 20:59:36
In this presentation, we discuss comprehensive frequency domain methods for estimating and inferring the second-order structure of spatial point processes. The main element here is on utilizing the discrete Fourier transform (DFT) of the point pattern and its tapered counterpart. Under second-order stationarity, we show that both the DFTs and the tapered DFTs are asymptotically jointly independent Gaussian even when the DFTs share the same limiting frequencies. Based on these results, we establish an α-mixing central limit theorem for a statistic formulated as a quadratic form of the tapered DFT. As applications, we derive the asymptotic distribution of the kernel spectral density estimator and establish a frequency domain inferential method for parametric stationary point processes. For the latter, the resulting model parameter estimator is computationally tractable and yields meaningful interpretations even in the case of model misspecification. We investigate the finite sample performance of our estimator through simulations, considering scenarios of both correctly specified and misspecified models. Joint work with Yongtao Guan @CUHK-Shenzhen.
Host: 남경식     English     2024-04-01 19:37:40
The r-th cactus variety of a subvariety X in a projective space generalises secant variety of X and it is defined using linear spans of finite schemes of degree r. It's original purpose was to study the vanishing sets of catalecticant minors. We propose adding a scheme structure to the cactus variety and we define it via relative linear spans of families of finite schemes over a potentially non-reduced base. In this way we are able to study the vanishing scheme of the catalecticant minors. For X which is a sufficiently large Veronese reembedding of projective variety, we show that r-th cactus scheme and the zero scheme of appropriate catalecticant minors agree on an open and dense subset which is the complement of the (r-1)-st cactus variety/scheme. As an application, we can describe the singular locus of (in particular) secant varieties to high degree Veronese varieties. Based on a joint work with Hanieh Keneshlou.
Host: 곽시종     Contact: 김윤옥 (5745)     To be announced     2024-04-17 23:05:51
"Phenotypic switching in gene regulatory networks", PNAS. (2014) will be discussed in this Journal Club. Noise in gene expression can lead to reversible phenotypic switching. Several experimental studies have shown that the abundance distributions of proteins in a population of isogenic cells may display multiple distinct maxima. Each of these maxima may be associated with a subpopulation of a particular phenotype, the quantification of which is important for understanding cellular decision-making. Here, we devise a methodology which allows us to quantify multimodal gene expression distributions and single-cell power spectra in gene regulatory networks. Extending the commonly used linear noise approximation, we rigorously show that, in the limit of slow promoter dynamics, these distributions can be systematically approximated as a mixture of Gaussian components in a wide class of networks. The resulting closed-form approximation provides a practical tool for studying complex nonlinear gene regulatory networks that have thus far been amenable only to stochastic simulation. We demonstrate the applicability of our approach in a number of genetic networks, uncovering previously unidentified dynamical characteristics associated with phenotypic switching. Specifically, we elucidate how the interplay of transcriptional and translational regulation can be exploited to control the multimodality of gene expression distributions in two-promoter networks. We demonstrate how phenotypic switching leads to birhythmical expression in a genetic oscillator, and to hysteresis in phenotypic induction, thus highlighting the ability of regulatory networks to retain memory. If you want to participate in the seminar, you need to enter IBS builiding (https://www.ibs.re.kr/bimag/visiting/). Please contact if you first come IBS to get permission to enter IBS building.
Host: Jae Kyoung Kim     English     2024-03-26 23:51:17
Delta-matroids are a generalization of matroids with connections to many parts of graph theory and combinatorics (such as matching theory and the structure of topological graph embeddings). Formally, a delta-matroid is a pair $D=(V,\mathcal F)$ where $\mathcal F$ is a collection of subsets of V known as "feasible sets." (They can be thought of as generalizing the set of bases of a matroid, while relaxing the condition that all bases must have the same cardinality.) Like with matroids, an important class of delta-matroids are linear delta-matroids, where the feasible sets are represented via a skew-symmetric matrix. Prominent examples of linear delta-matroids include linear matroids and matching delta-matroids (where the latter are represented via the famous Tutte matrix). However, the study of algorithms over delta-matroids seems to have been much less developed than over matroids. In this talk, we review recent results on representations of and algorithms over linear delta-matroids. We first focus on classical polynomial-time aspects. We present a new (equivalent) representation of linear delta-matroids that is more suitable for algorithmic purposes, and we show that so-called delta-sums and unions of linear delta-matroids are linear. As a result, we get faster (randomized) algorithms for Linear Delta-matroid Parity and Linear Delta-matroid Intersection, improving results from Geelen et al. (2004). We then move on to parameterized complexity aspects of linear delta-matroids. We find that many results regarding linear matroids which have had applications in FPT algorithms and kernelization directly generalize to linear delta-matroids of bounded rank. On the other hand, unlike with matroids, there is a significant difference between the "rank" and "cardinality" parameters - the structure of bounded-cardinality feasible sets in a delta-matroid of unbounded rank is significantly harder to deal with than feasible sets in a bounded-rank delta-matroid.
Host: Sang-il Oum     English     2024-04-01 21:52:21

ZOOM ID: 997 8258 4700(pw: 1234)
Host: 김재경 교수     Contact: 채송지 (042-878-8244)     English     2024-02-29 11:18:50
In the past decade, machine learning methods (MLMs) for solving partial differential equations (PDEs) have gained significant attention as a novel numerical approach. Indeed, a tremendous number of research projects have surged that apply MLMs to various applications, ranging from geophysics to biophysics. This surge in interest stems from the ability of MLMs to rapidly predict solutions for complex physical systems, even those involving multi-physics phenomena, uncertainty, and real-world data assimilation. This trend has led many to hopeful thinking MLMs as a potential game-changer in PDE solving. However, despite the hopeful thinking on MLMs, there are still significant challenges to overcome. These include limits compared to conventional numerical approaches, a lack of thorough analytical understanding of its accuracy, and the potentially long training times involved. In this talk, I will first assess the current state of MLMs for solving PDEs. Following this, we will explore what roles MLMs should play to become a conventional numerical scheme.
This is an introductory reading seminar presented by a senior undergraduate student, Jaehak Lee, who is studying the subject.
Host: 박진현     Contact: 박진현 (2734)     To be announced     2024-03-28 14:04:24
I will discuss some recent progress on the freeness problem for groups of 2x2 rational matrices generated by two parabolic matrices. In particular, I will discuss recent progress on determining the structural properties of such groups (beyond freeness) and when they have finite index in the finitely presented group SL(2,Z[1/m]), for appropriately chosen m.
Host: 백형렬     Contact: 김규식 ()     English     2024-04-02 11:34:15
Atoms and molecules aim to minimize surface energy, while crystals exhibit directional preferences. Starting from the classical isoperimetric problem, we investigate the evolution of volume-preserving crystalline mean curvature flow. Defining a notion of viscosity solutions, we demonstrate the preservation of geometric properties associated with the Wulff shape. We establish global-in-time existence and regularity for a class of initial data. Furthermore, we discuss recent findings on the long-time behavior of the flow towards the critical point of the anisotropic perimeter functional in a planar setting.
Host: 이지운 교수     Contact: saarc (042-350-8117)     To be announced     2024-03-04 14:09:16
The positive discrepancy of a graph $G$ of edge density $p$ is defined as the maximum of $e(U) - p|U|(|U|-1)/2$, where the maximum is taken over subsets of vertices in G. In 1993 Alon proved that if G is a $d$-regular graph on $n$ vertices and $d = O(n^{1/9})$, then the positive discrepancy of $G$ is at least $c d^{1/2}n$ for some constant $c$. We extend this result by proving lower bounds for the positive discrepancy with average degree d when $d < (1/2 - \epsilon)n$. We prove that the same lower bound remains true when $d < n^(2/3)$, while in the ranges $n^{2/3} < d < n^{4/5}$ and $n^{4/5} < d < (1/2 - \epsilon)n$ we prove that the positive discrepancy is at least $n^2/d$ and $d^{1/4}n/log(n)$ respectively. Our proofs are based on semidefinite programming and linear algebraic techniques. Our results are tight when $d < n^{3/4}$, thus demonstrating a change in the behaviour around $d = n^{2/3}$ when a random graph no longer minimises the positive discrepancy. As a by-product, we also present lower bounds for the second largest eigenvalue of a $d$-regular graph when $d < (1/2 - \epsilon)n$, thus extending the celebrated Alon-Boppana theorem. This is joint work with Benjamin Sudakov and István Tomon.
Host: Hong Liu / Sang-il Oum     English     2024-03-27 20:58:19
In this talk, we focus on the global existence of volume-preserving mean curvature flows. In the isotropic case, leveraging the gradient flow framework, we demonstrate the convergence of solutions to a ball for star-shaped initial data. On the other hand, for anisotropic and crystalline flows, we establish the global-in-time existence for a class of initial data with the reflection property, utilizing explicit discrete-in-time approximation methods.
Contact: 강문진 (0423502743)     To be announced     2024-03-25 10:08:59
Using the invariant splitting principle, we construct an infinite family of exotic pairs of contractible 4-manifolds which survive one stabilization. We argue that some of them are potential candidates for surviving two stabilizations.
Host: 박정환     Contact: 이재원 (01026991658)     English     2024-03-27 12:55:19

ZOOM ID: 997 8258 4700(pw: 1234)
Host: 김재경 교수     Contact: 채송지 (042-878-8244)     English     2024-02-29 11:15:36
The size and complexity of recent deep learning models continue to increase exponentially, causing a serious amount of hardware overheads for training those models. Contrary to inference-only hardware, neural network training is very sensitive to computation errors; hence, training processors must support high-precision computation to avoid a large performance drop, severely limiting their processing efficiency. This talk will introduce a comprehensive design approach to arrive at an optimal training processor design. More specifically, the talk will discuss how we should make important design decisions for training processors in more depth, including i) hardware-friendly training algorithms, ii) optimal data formats, and iii) processor architecture for high precision and utilization.
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.
Host: 2734 박진현     Contact: 2734 박진현 (2734 박진현)     To be announced     2024-01-26 13:32:33
We begin the first talk by introducing the concept of an h-principle that is mostly accessible through the two important methods. One of the methods is the convex integration that was successfully used by Mueller and Sverak and has been applied to many important PDEs. The other is the so-called Baire category method that was mainly studied by Dacorogna and Marcellini. We compare these methods in applying to a toy example.
Contact: 강문진 (0423502743)     To be announced     2024-03-25 10:03:36
In the second talk of the series, we exhibit several examples of application of convex integration to important PDE problems. In particular, we shall sketch some ideas of proof such as in the p-Laplace equation and its parabolic analogue, Euler-Lagrange equation of a polyconvex energy, gradient flow of a polyconvex energy and polyconvex elastodynamics.
Contact: 강문진 (0423502743)     To be announced     2024-03-27 09:40:37
After a brief review of the history, some applications of these models will be reviewed. This will include descriptions of rogue waves, tsunami propagation, internal waves and blood flow. Some of the theory emanaging from these applications will then be sketched.
Host: 홍영준     English     2024-02-22 11:17:49
One of the classical and most fascinating problems at the intersection between combinatorics and number theory is the study of the parity of the partition function. Even though p(n) in widely believed to be equidistributed modulo 2, progress in the area has proven exceptionally hard. The best results available today, obtained incrementally over several decades by Serre, Soundarajan, Ono and many otehrs, do not even guarantee that, asymptotically, p(n) is odd for /sqrt{x} values of n/neq x, In this talk, we present a new, general conjectural framework that naturally places the parity of p(n) into the much broader, number-theoretic context of eta-eqotients. We discuss the history of this problem as well as recent progress on our "master conjecture," which includes novel results on multi-and regular partitions. We then show how seemingly unrelated classes of eta-equotients carry surprising (and surprisingly deep) connections modulo 2 to the partition function. One instance is the following striking result: If any t-multiparition function, with t/neq 0(mod 3), is odd with positive density, then so is p(n). (Note that proving either fact unconditionally seems entirely out of reach with current methods.) Throughout this talk, we will give a sense of the many interesting mathematical techniques that come into play in this area. They will include a variety of algebraic and combinatorial ideas, as well as tools from modular forms and number theory.
Host: 곽시종     Contact: 김윤옥 (5745)     To be announced     2024-03-28 23:33:39
In this talk, we consider some polynomials which define Gaussian Graphical models in algebraic statistics. First, we briefly introduce background materials and some preliminary on this topic. Next, we regard a conjecture due to Sturmfels and Uhler concerning generation of the prime ideal of the variety associated to the Gaussian graphical model of any cycle graph and explain how to prove it. We also report a result on linear syzygies of any model coming from block graphs. The former work was done jointly with A. Conner and M. Michalek and the latter with J. Choe.
Host: 곽시종     Contact: 김윤옥 (5745)     To be announced     2024-03-28 23:37:00
Bollobás proved that for every $k$ and $\ell$ such that $k\mathbb{Z}+\ell$ contains an even number, an $n$-vertex graph containing no cycle of length $\ell \bmod k$ can contain at most a linear number of edges. The precise (or asymptotic) value of the maximum number of edges in such a graph is known for very few pairs $\ell$ and $k$. We precisely determine the maximum number of edges in a graph containing no cycle of length $0 \bmod 4$. This is joint work with Ervin Győri, Binlong Li, Nika Salia, Kitti Varga and Manran Zhu.
Host: Sang-il Oum     English     2024-01-08 14:52:31
We introduce bordered Floer theory and its involutive version, as well as their applications to knot complements. We will sketch the proof that invariant splittings of CFK and those of CFD correspond to each other under the Lipshitz-Ozsvath-Thurston correspondence, via invariant splitting principle, which is an ongoing work with Gary Guth.
Host: 박정환     Contact: 이재원 (01026991658)     English     2024-03-27 12:55:09
This is an introductory reading seminar presented by a senior undergraduate student, Jaehak Lee, who is studying the subject.
Host: 박진현     Contact: 박진현 (2734)     Korean     2024-02-28 14:24:00
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.
Host: 김우진     To be announced     2024-03-19 18:50:56
"Anti-Windup Protection Circuits for Biomolecular Integral Controllers", bioRxaiv. (2023) will be discussed in this Journal Club. In this study, we obtain an exact time-dependent solution of the chemical master equation (CME) of an extension of the two-state telegraph model describing bursty or non-bursty protein expression in the presence of positive or negative autoregulation. Using the method of spectral decomposition, we show that the eigenfunctions of the generating function solution of the CME are Heun functions, while the eigenvalues can be determined by solving a continued fraction equation. Our solution generalizes and corrects a previous time-dependent solution for the CME of a gene circuit describing non-bursty protein expression in the presence of negative autoregulation [Ramos et al., Phys. Rev. E 83, 062902 (2011)]. In particular, we clarify that the eigenvalues are generally not real as previously claimed. We also investigate the relationship between different types of dynamic behavior and the type of feedback, the protein burst size, and the gene switching rate. If you want to participate in the seminar, you need to enter IBS builiding (https://www.ibs.re.kr/bimag/visiting/). Please contact if you first come IBS to get permission to enter IBS building.
Host: Jae Kyoung Kim     English     2024-03-04 13:48:08
For hyperbolic manifolds, many interesting results support a deep relationship between hyperbolic volume and the Chern-Simons invariant. In this talk, we consider noncompact hyperbolic 3-manifolds having infinite volume. For these manifolds, there is a well-defined invariant called the renormalized volume which replaces classical volume. The talk will start from a gentle introduction to hyperbolic geometry and reach the renormalization of the Chern-Simons invariant, which has a close relationship with the renormalized hyperbolic volume.
In this talk, I will discuss recent results on the free energy of logarithmically interacting charges in the plane in an external field. Specifically, at a particular inverse temperature $\beta=2$, this system exhibits the distribution of eigenvalues of certain random matrices, forming a determinantal point process. I will explain how the large N expansion of the free energy depends on the geometric and topological properties of the region where particles condensate, considering the disk, annulus, and sphere cases. I will further discuss the conditional Ginibre ensemble as a non-radial example confirming the Zabrodin-Wiegmann conjecture regarding the spectral determinant emerging at the O(1) term in the free energy expansion. This talk is based on joint works with Sung-Soo Byun, Meng Yang, and  Nam-Gyu Kang.
Host: 이지운 교수     Contact: saarc (042-350-8117)     To be announced     2024-03-04 14:07:42
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.
Host: Bo-Hae Im     To be announced     2024-02-18 15:51:25
Let $\mathcal{G}$ and $\mathcal{H}$ be minor-closed graphs classes. The class $\mathcal{H}$ has the Erdős-Pósa property in $\mathcal{G}$ if there is a function $f : \mathbb{N} \to \mathbb{N}$ such that every graph $G$ in $\mathcal{G}$ either contains (a packing of) $k$ disjoint copies of some subgraph minimal graph $H \not\in \mathcal{H}$ or contains (a covering of) $f(k)$ vertices, whose removal creates a graph in $\mathcal{H}$. A class $\mathcal{G}$ is a minimal EP-counterexample for $\mathcal{H}$ if $\mathcal{H}$ does not have the Erdős-Pósa property in $\mathcal{G}$, however it does have this property for every minor-closed graph class that is properly contained in $\mathcal{G}$. The set $\frak{C}_{\mathcal{H}}$ of the subset-minimal EP-counterexamples, for every $\mathcal{H}$, can be seen as a way to consider all possible Erdős-Pósa dualities that can be proven for minor-closed classes. We prove that, for every $\mathcal{H}$, $\frak{C}_{\mathcal{H}}$ is finite and we give a complete characterization of it. In particular, we prove that $|\frak{C}_{\mathcal{H}}| = 2^{\operatorname{poly}(\ell(h))}$, where $h$ is the maximum size of a minor-obstruction of $\mathcal{H}$ and $\ell(\cdot)$ is the unique linkage function. As a corollary of this, we obtain a constructive proof of Thomas' conjecture claiming that every minor-closed graph class has the half-integral Erdős-Pósa property in all graphs. This is joint work with Christophe Paul, Dimitrios Thilikos, and Sebastian Wiederrecht.
Host: Sang-il Oum     English     2024-03-05 22:57:39
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.
Host: 2734 박진현     Contact: 2734 박진현 (2734 박진현)     To be announced     2024-01-26 13:31:00
“Transcriptome-wide analysis of cell cycle-dependent bursty gene expression from single-cell RNA-seq data using mechanistic model-based inference”, bioRxiv (2024) will be discussed in this Journal Club. Bursty gene expression is quantified by two intuitive parameters: the burst frequency and the burst size. While these parameters are known to be cell-cycle dependent for some genes, a transcriptome-wide picture remains missing. Here we address this question by fitting a suite of mechanistic models of gene expression to mRNA count data for thousands of mouse genes, obtained by sequencing of single cells for which the cell-cycle position has been inferred using a deep-learning approach. This leads to the estimation of the burst frequency and size per allele in the G1 and G2/M cell-cycle phases, hence providing insight into the global patterns of transcriptional regulation. In particular, we identify an interesting balancing mechanism: on average, upon DNA replication, the burst frequency decreases by ≈ 50%, while the burst size increases by the same amount. We also show that for accurate estimation of the ratio of burst parameters in the G1 and G2/M phases, mechanistic models must explicitly account for gene copy number differences between cells but, surprisingly, additional corrections for extrinsic noise due to the coupling of transcription to cell age within the cell cycle or technical noise due to imperfect capture of RNA molecules in sequencing experiments are unnecessary. If you want to participate in the seminar, you need to enter IBS builiding (https://www.ibs.re.kr/bimag/visiting/). Please contact if you first come IBS to get permission to enter IBS building.
Host: Jae Kyoung Kim     English     2024-03-04 13:38:19
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.
Host: 백형렬     English     2024-02-22 11:15:46
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.
Host: Bo-Hae Im     Korean English if it is requested     2024-02-18 14:15:00
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.
Host: 백형렬     English     2024-03-07 10:32:02
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.
This is an introductory reading seminar presented by a senior undergraduate student, Jaehak Lee, who is studying the subject.
Host: 박진현     Contact: 박진현 (2734)     Korean     2024-02-28 14:22:55
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.
Host: 백형렬     English     2024-02-22 11:14:37
Momentum-based acceleration of first-order optimization methods, first introduced by Nesterov, has been foundational to the theory and practice of large-scale optimization and machine learning. However, finding a fundamental understanding of such acceleration remains a long-standing open problem. In the past few years, several new acceleration mechanisms, distinct from Nesterov’s, have been discovered, and the similarities and dissimilarities among these new acceleration phenomena hint at a promising avenue of attack for the open problem. In this talk, we discuss the envisioned goal of developing a mathematical theory unifying the collection of acceleration mechanisms and the challenges that are to be overcome.
To be announced     2024-02-23 10:49:37
"Reduced model for female endocrine dynamics: Validation and functional variations", Mathematical Biosciences (2023) will be discussed in this Journal Club. A normally functioning menstrual cycle requires significant crosstalk between hormones originating in ovarian and brain tissues. Reproductive hormone dysregulation may cause abnormal function and sometimes infertility. The inherent complexity in this endocrine system is a challenge to identifying mechanisms of cycle disruption, particularly given the large number of unknown parameters in existing mathematical models. We develop a new endocrine model to limit model complexity and use simulated distributions of unknown parameters for model analysis. By employing a comprehensive model evaluation, we identify a collection of mechanisms that differentiate normal and abnormal phenotypes. We also discover an intermediate phenotype—displaying relatively normal hormone levels and cycle dynamics—that is grouped statistically with the irregular phenotype. Results provide insight into how clinical symptoms associated with ovulatory disruption may not be detected through hormone measurements alone. If you want to participate in the seminar, you need to enter IBS builiding (https://www.ibs.re.kr/bimag/visiting/). Please contact if you first come IBS to get permission to enter IBS building.
Host: Jae Kyoung Kim     English     2024-03-04 13:15:43
We prove a conjecture of Bonamy, Bousquet, Pilipczuk, Rzążewski, Thomassé, and Walczak, that for every graph $H$, there is a polynomial $p$ such that for every positive integer $s$, every graph of average degree at least $p(s)$ contains either $K_{s,s}$ as a subgraph or contains an induced subdivision of $H$. This improves upon a result of Kühn and Osthus from 2004 who proved it for graphs whose average degree is at least triply exponential in $s$ and a recent result of Du, Girão, Hunter, McCarty and Scott for graphs with average degree at least singly exponential in $s$. As an application, we prove that the class of graphs that do not contain an induced subdivision of $K_{s,t}$ is polynomially $\chi$-bounded. In the case of $K_{2,3}$, this is the class of theta-free graphs, and answers a question of Davies. Along the way, we also answer a recent question of McCarty, by showing that if $\mathcal{G}$ is a hereditary class of graphs for which there is a polynomial $p$ such that every bipartite $K_{s,s}$-free graph in $\mathcal{G}$ has average degree at most $p(s)$, then more generally, there is a polynomial $p'$ such that every $K_{s,s}$-free graph in $\mathcal{G}$ has average degree at most $p'(s)$. Our main new tool is an induced variant of the Kővári-Sós-Turán theorem, which we find to be of independent interest. This is joint work with Romain Bourneuf (ENS de Lyon), Matija Bucić (Princeton), and James Davies (Cambridge),
Host: Sang-il Oum     English     2024-02-15 17:31:02
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.
Host: 2734 박진현     Contact: 2734 박진현 (2734 박진현)     To be announced     2024-01-26 13:26:53
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.
Host: 박지원     English     2024-02-21 21:29:46