Jeong Han Kim is a professor of Computational Science at KIAS who studies combinatorics and mathematics related to the theoretical foundations of computer science. In 1995, he solved a problem regarding Ramsey Number that had remained unsolved for over 60 years and was awarded as the sole recipient of the 1997 Fulkerson Prize for his findings. The Fulkerson Prize is one of the top awards in the field of discrete mathematics and is one of the few major awards presented by the American Mathematical Society (AMS). Jeong Han Kim is the only Korean recipient of AMS prizes. He was also selected as an Alfred Sloan Fellow in 1997. The fellowship is well known for having funded 45 fellows who later won Nobel Prizes.
Professor Kim has been recognized as a world-renowned scholar for his outstanding achievements. As a doctoral student, he created the best algorithm for sorting under partial information to date with his doctoral advisor, Jeff N. Kahn. Following his studies, Kim and his postdoc Van H. Vu (a current math professor at Yale University), discovered an inequality that is introduced as a subsection of a commonly used graduate textbook (Probabilistic Method by Alon & Spencer) under the title of "Kim-Vu Polynomial Concentration." In addition, Professor Kim has developed a new random graph model that is useful to analyze the problems of giant components and k-cores, etc.. After moving to KIAS, Kim has presented a partial solution to Sidorenko's conjecture, which is another unsolved problem in the field of combinatorics. He has also been working on developing techniques to compare two or more random models.
In 2006, Kim was one of first three Korean mathematicians to be a invited speaker at the International Congress of Mathematicians (ICM). In 2007 he won the Role Model Scientist Award and was appointed as an Underwood Chair professor at Yonsei University. He was also the first person in the field of mathematics to be selected as a primary researcher of the Creative Research Promotion Project and is currently working as an editor for a leading international journal, Random Structures and Algorithms.
- · Professor, School of Computational Sciences, Korea Institute for Advanced Study, Korea, since 2013
- · Chair Professor, Yonsei University, Korea, 2006-2013
- · Senior Researcher, Microsoft Research, USA, 1997-2007
- · Samil Prize: Natural Sciences, 2020
- · Kyung-Am Award in Natural Sciences, 2008
- · Role Model Award for Scientists and Engineers, 2007
- · Underwood Chair Professor (Yonsei University) 2007
- · Invited Speaker at International Congress of Mathematicians (ICM), 2006
- · Fulkerson Prize, August, 1997
- · Sloan Research Fellowship, February, 1997
- · Sloan Dissertation Fellowship, September, 1992 - June, 1993
- · Yon-Am Fellowship, March, 1985 - February, 1986
Publications at KIAS
-
Gravitational wave probes on self-interacting dark matter surrounding an intermediate mass black hole
PHYSICAL REVIEW D, 2024 -
Majority dynamics on sparse random graphs
RANDOM STRUCTURES & ALGORITHMS, 2023 -
Amortized Efficient zk-SNARK from Linear-Only RLWE Encodings
JOURNAL OF COMMUNICATIONS AND NETWORKS, 2023 -
Threshold functions for incidence properties in finite vector spaces
FINITE FIELDS AND THEIR APPLICATIONS, 2023 -
Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions
DESIGNS CODES AND CRYPTOGRAPHY, 2022 -
Linear Operators That Preserve the Genus of a Graph
MATHEMATICS, 2019 -
Some advances on Sidorenko's conjecture
JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 2018 -
On the total variation distance between the binomial random graph and the random intersection graph
RANDOM STRUCTURES & ALGORITHMS, 2018 -
TWO APPROACHES TO SIDORENKO'S CONJECTURE
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 2016 -
On coupon colorings of graphs
DISCRETE APPLIED MATHEMATICS, 2015 -
UNIVERSALITY OF RANDOM GRAPHS FOR GRAPHS OF MAXIMUM DEGREE TWO
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2014
Selected Publications
-
Two approaches to Sidorenko's conjecture
Trans. Amer. Math. Soc. 368 (2016), no. 7, 5057–5074. -
On coupon colorings of graphs
DISCRETE APPLIED MATHEMATICS, v.193 (2015) 94-101 -
UNIVERSALITY OF RANDOM GRAPHS FOR GRAPHS OF MAXIMUM DEGREE TWO
SIAM JOURNAL ON DISCRETE MATHEMATICS, v.28 no3 (2014) 1467-1478
- Office: 1232 / TEL) 82-2-958-2551 / FAX) 82-2-958-3870
- School of Computational Sciences, Korea Institute for Advanced Study
- 85 Hoegiro Dongdaemun-gu, Seoul 02455, Republic of Korea.