# Department Seminars & Colloquia

You can get notification if you subscribe the calendar in Google Calendar or iPhone calendar etc.

Thresholds for increasing properties of random structures are a central concern in probabilistic combinatorics and related areas. In 2006, Kahn and Kalai conjectured that for any nontrivial increasing property on a finite set, its threshold is never far from its “expectation-threshold,” which is a natural (and often easy to calculate) lower bound on the threshold.
In the first talk on Monday, I will introduce the Kahn-Kalai Conjecture with some motivating examples and then briefly talk about the recent resolution of the Kahn-Kalai Conjecture due to Huy Pham and myself.
In the second talk on Tuesday, I will discuss our proof of the conjecture in detail.

####
B378 Seminar room, IBS
Math Biology
Junil Kim (Soongsil University)
TENET+: a tool for reconstructing gene networks by integrating single cell expression and chromatin accessibility data

B378 Seminar room, IBS

Math Biology

Reconstruction of gene regulatory networks (GRNs) is a powerful approach to capture a prioritized gene set controlling cellular processes. In our previous study, we developed TENET a GRN reconstructor from single cell RNA sequencing (scRNAseq). TENET has a superior capability to identify key regulators compared with other algorithms. However, accurate inference of gene regulation is still challenging. Here, we suggest an integrative strategy called TENET+ by combining single cell transcriptome and chromatin accessibility data. By applying TENET+ to a paired scRNAseq and scATACseq dataset of human peripheral blood mononuclear cells, we found critical regulators and their epigenetic regulations for the differentiations of CD4 T cells, CD8 T cells, B cells and monocytes. Interestingly, TENET+ predicted LRRFIP1 and ZBTB16 as top regulators of CD4 and CD8 T cells which were not predicted in a motif-based tool SCENIC. In sum, TENET+ is a tool predicting epigenetic gene regulatory programs in unbiased way, suggesting that novel epigenetic regulations can be identified by TENET+.

####
B378 Seminar room, IBS
Math Biology
Junil Kim (Soongsil University)
TENET+: a tool for reconstructing gene networks by integrating single cell expression and chromatin accessibility data

B378 Seminar room, IBS

Math Biology

####
B378 Seminar room, IBS
Math Biology
Junil Kim (Soongsil University)
TENET+: a tool for reconstructing gene networks by integrating single cell expression and chromatin accessibility data

B378 Seminar room, IBS

Math Biology

####
Room B332, IBS (기초과학연구원)
Discrete Mathematics
Eric Vigoda (UC Santa Barbara)
Computational phase transition and MCMC algorithms

Room B332, IBS (기초과학연구원)

Discrete Mathematics

This talk will highlight recent results establishing a beautiful computational phase transition for approximate counting/sampling in (binary) undirected graphical models (such as the Ising model or on weighted independent sets). The computational problem is to sample from the equilibrium distribution of the model or equivalently approximate the corresponding normalizing factor known as the partition function. We show that when correlations die off on the infinite D-regular tree then the Gibbs sampler has optimal mixing time of O(n log n) on any graph of maximum degree D, whereas when the correlations persist (in the limit) then the sampling/counting problem are NP-hard to approximate. The Gibbs sampler is a simple Markov Chain Monte Carlo (MCMC) algorithm. Key to these mixing results are a new technique known as spectral independence which considers the pairwise influence of vertices. We show that spectral independence implies an optimal convergence rate for a variety of MCMC algorithms.

####
Room B332, IBS (기초과학연구원)
Discrete Mathematics
Ben Lund (IBS DIMAG)
Radial projections in finite space

Room B332, IBS (기초과학연구원)

Discrete Mathematics

Given a set $E$ and a point $y$ in a vector space over a finite field, the radial projection $\pi_y(E)$ of $E$ from $y$ is the set of lines that through $y$ and points of $E$. Clearly, $|pi_y(E)|$ is at most the minimum of the number of lines through $y$ and $|E|$. I will discuss several results on the general question: For how many points $y$ can $|\pi_y(E)|$ be much smaller than this maximum?
This is motivated by an analogous question in fractal geometry. The Hausdorff dimension of a radial projection of a set $E$ in $n$ dimensional real space will typically be the minimum of $n-1$ and the Hausdorff dimension of $E$. Several recent papers by authors including Matilla, Orponen, Liu, Shmerikin, and Wang consider the question: How large can the set of points with small radial projections be? This body of work has several important applications, including recent progress on the Falconer distance conjecture.
This is joint with Thang Pham and Vu Thi Huong Thu.

####
B378 Seminar room, IBS
IBS-KAIST Seminar
Won Chang (University of Cincinnati)
Deep Learning-based Uncertainty Quantification for Mathematical Models

B378 Seminar room, IBS

IBS-KAIST Seminar

Over the recent years, various methods based on deep neural networks have been developed and utilized in a wide range of scientific fields. Deep neural networks are highly suitable for analyzing time series or spatial data with complicated dependence structures, making them particularly useful for environmental sciences and biosciences where such type of simulation model output and observations are prevalent. In this talk, I will introduce my recent efforts in utilizing various deep learning methods for statistical analysis of mathematical simulations and observational data in those areas, including surrogate modeling, parameter estimation, and long-term trend reconstruction. Various scientific application examples will also be discussed, including ocean diffusivity estimation, WRF-hydro calibration, AMOC reconstruction, and SIR calibration.

####
B378 Seminar room, IBS
IBS-KAIST Seminar
Hyunjoong Kim (University of Pennsylvania)
Optimized persistent random walk in zebrafish airineme search process

B378 Seminar room, IBS

IBS-KAIST Seminar

In addition to diffusive signals, cells in tissue also communicate via long, thin cellular protrusions, such as airinemes in zebrafish. Before establishing communication, cellular protrusions must find their target cell. In this talk, we demonstrate that the shapes of airinemes in zebrafish are consistent with a persistent random walk model. The probability of contacting the target cell is maximized for a balance between ballistic search (straight) and diffusive search (highly curved, random). We find that the curvature of airinemes in zebrafish, extracted from live cell microscopy, is approximately the same value as the optimum in the simple persistent random walk model. We also explore the ability of the target cell to infer direction of the airineme’s source, finding that there is a theoretical trade-off between search optimality and directional information. This provides a framework to characterize the shape, and performance objectives, of non-canonical cellular protrusions in general.

####
B378 Seminar room, IBS
Math Biology
Ryeongkyung Yoon (The University of Utah)
Dynamical System Perspective for Machine Learning

B378 Seminar room, IBS

Math Biology

The connection between deep neural networks and ordinary differential equations (ODEs) is an active field of research in machine learning. In this talk, we view the hidden states of a neural network as a continuous object governed by a dynamical system. The underlying vector field is written using a dictionary representation motivated by the equation discovery method. Within this framework, we develop models for two particular machine learning tasks: time-series classification and dimension reduction. We train the parameters in the models by minimizing a loss, which is defined using the solution to the governing ODE. To attain a regular vector field, we introduce a regularization term measuring the mean total kinetic energy of the flow, which is motivated by optimal transportation theory. We solve the optimization problem using a gradient-based method where the gradients are computed via the adjoint method from optimal control theory. Through various experiments on synthetic and real-world datasets, we demonstrate the performance of the proposed models. We also interpret the learned models by visualizing the phase plots of the underlying vector field and solution trajectories.

####
Room B332, IBS (기초과학연구원)
Discrete Mathematics
Amadeus Reinald (ENS de Lyon / IBS DIMAG)
Twin-width and forbidden subdivisions

Room B332, IBS (기초과학연구원)

Discrete Mathematics

Twin-width is a recently introduced graph parameter based on vertex contraction sequences. On classes of bounded twin-width, problems expressible in FO logic can be solved in FPT time when provided with a sequence witnessing the bound. Classes of bounded twin-width are very diverse, notably including bounded rank-width, $\Omega ( \log (n) )$-subdivisions of graphs of size $n$, and proper minor closed classes. In this talk, we look at developing a structural understanding of twin-width in terms of induced subdivisions.
Structural characterizations of graph parameters have mostly looked at graph minors, for instance, bounded tree-width graphs are exactly those forbidding a large wall minor. An analogue in terms of induced subgraphs could be that, for sparse graphs, large treewidth implies the existence of an induced subdivision of a large wall. However, Sintiari and Trotignon have ruled out such a characterization by showing the existence of graphs with arbitrarily large girth avoiding any induced subdivision of a theta ($K_{2,3}$). Abrishami, Chudnovsky, Hajebi and Spirkl have recently shown that such (theta, triangle)-free classes have nevertheless logarithmic treewidth.
After an introduction to twin-width and its ties to vertex orderings, we show that theta-free graphs of girth at least 5 have bounded twin-width.
Joint work with Édouard Bonnet, Eun Jung Kim, Stéphan Thomassé and Rémi Watrigant.

####
B378 Seminar room, IBS
Math Biology
Minki Lee (University of Michigan)
Phase Estimation of Nonlinear State-space Model of the Circadian Pacemaker Using Level Set Kalman Filter and Raw Wearable Data

B378 Seminar room, IBS

Math Biology

Circadian rhythm is a robust internal 24 hours timekeeping mechanism maintained by the master circadian pacemaker Suprachiasmatic Nuclei (SCN). Numerous mathematical models have been proposed to capture SCN’s timekeeping mechanism and predict the circadian phase. There has been an increased demand for applying these models to the various unexplored data sets. One potential application is on data from commercially available wearable devices, which provide the noninvasive measurements of physiological proxies, such as activity and heart rate. Using these physiological proxies, we can estimate the circadian phase of the central and peripheral circadian pacemakers. Here, we propose a new framework for estimating the circadian phase using wearable data and the Level Set Kalman Filter on the nonlinear state-space model of the human circadian pacemaker. Analysis of over 200,000 days of wearable data from over 3,000 subjects using our framework successfully identified misalignment in central and peripheral pacemakers with a significantly smaller uncertainty than previous methods.

####
B378 Seminar room, IBS
IBS-KAIST Seminar
Byung Mook Weon (Sungkyunkwan University)
논문 글쓰기 워크샵 1/2 – 논문 작성 원리: ABC 논문 작성법

B378 Seminar room, IBS

IBS-KAIST Seminar

논문은 저자와 독자 사이의 학문적 소통을 위한 논리적인 글이다. 이번 강연을 통해 논문을 작성하기 위한 기본 원리를 배울 수 있다. 특히, 연구가 거의 마무리되는 시점에 (After completing your research), 연구 결과를 그림과 표로 잘 정리한 다음에 (Based on well-organized figures and tables), 본격적으로 논문 작성을 시작하는 (Compose your manuscript from a title to a conclusion) ‘ABC 논문 작성법’을 소개한다. 논문 작성의 준비 과정으로 (A와 B의 과정), 연구 노트 작성 방법, 저널 클럽 운영 방법, 한 페이지 활용 방법을 설명한다. 논문 작성 준비가 완료되면, 제목부터 결론까지 순서대 로 논문 원고를 작성할 수 있다 (C의 과정). 이렇게 하면, 단기간에 집중하여 효율적으 로 논문을 작성할 수 있다.
*참고: 원병묵 교수의 과학 논문 쓰는 법

2022년 6월 3일 오후 4시 – 5시, 성균관대 신소재공학부의 원병묵 교수님의 논문 글쓰기 워크샵 강의가 있습니다.

2022년 6월 3일 오후 4시 – 5시, 성균관대 신소재공학부의 원병묵 교수님의 논문 글쓰기 워크샵 강의가 있습니다.

####
B378 Seminar room, IBS
IBS-KAIST Seminar
Yeong Min Park (Busan Metropolitan City Office of Education)
논문 글쓰기 워크샵 2/2 – 영어 논문 쓰기: 두려움을 성취로 바꾸는 길

B378 Seminar room, IBS

IBS-KAIST Seminar

이 ‘영어 논문 쓰기’ 워크숍은 현재의 영어 수준이나 과거의 영어 학습 경험과 상관 없이 누구나 영어 논문 쓰기를 시작할 수 있는 방법에 관한 것입니다. 우선 영어에 대한 막연한 두려움, 과거 경험으로 인한 자신감 부족, 게다가 ‘쓰기’라는 쉽지 않은 인지 활동, 심지어 논문이라는 큰 벽, 혹은 섣부른 자신감 등 ‘영어 논문 쓰기’를 방해하는 요인을 생각해 봅니다. 이런 요인을 자세하게 들여다보면 각각의 걸림돌을 넘어갈 방법도 명쾌하게 발견할 수 있습니다. 이 세미나에서 다룰 구체적 내용은 다음과 같습니다.
- 한국인들이 ‘영어’와 ‘영어 쓰기’를 어렵게 느끼는 원인 이해하고 극복하기
- ‘읽기’와 ‘쓰기’의 서로 다른 두 가지 인지활동의 관련성 이해하고 적용하기
- 논문에 적합한 단어, 시제, 구두점 선택하고 사용하기
- 영문초록, 제목, 소제목 스타일 이해하고 작성하기
- 영어논문 쓰기를 돕는 디지털 도구 선택하고 활용하기
이 워크숍에서 안내될 몇 가지 방법은 영어 논문 쓰기가 더 이상 두려운 것이 아닌 연구자로서의 목표를 이루는 디딤돌이 되도록 할 것입니다.

2022년 6월 3일 오후 5시 – 6시, 부산교육정책연구소 박영민 연구원님의 논문 글쓰기 워크샵 강의가 있습니다.

2022년 6월 3일 오후 5시 – 6시, 부산교육정책연구소 박영민 연구원님의 논문 글쓰기 워크샵 강의가 있습니다.

####
ZOOM
Math Biology
Heinz Koeppl (TU Darmstadt)
Biomedical Mathematics Online Colloquium: From live cell imaging to moment-based variational inference

ZOOM

Math Biology

Quantitative characterization of biomolecular networks is important for the analysis and design of network functionality. Reliable models of such networks need to account for intrinsic and extrinsic noise present in the cellular environment. Stochastic kinetic models provide a principled framework for developing quantitatively predictive tools in this scenario. Calibration of such models requires an experimental setup capable of monitoring a large number of individual cells over time, automatic extraction of fluorescence levels for each cell and a scalable inference approach. In the first part of the talk we will cover our microfluidic setup and a deep-learning based approach to cell segmentation and data extraction. The second part will introduce moment-based variational inference as a scalable framework for approximate inference of kinetic models based on single cell data.

This talk will be presented online. ZOOM ID: 997 8258 4700 (Biomedical Mathematics Online Colloquium), (pw: 1234)

This talk will be presented online. ZOOM ID: 997 8258 4700 (Biomedical Mathematics Online Colloquium), (pw: 1234)