Skip to main content

임선혁 교수

Sung-Hyuk Lim

성균관대학교 수학과 · 컴퓨터과학

연구실 소개

임선혁 교수의 연구실은 응용대수적 토폴로지와 거리 기반 측도 이론을 기반으로 한 데이터 분석 기법을 연구합니다. 주로 구형 공간 간의 거리 척도인 고모프-하우스도르프 거리와 고모프-워서스타인 거리의 정확한 계산 및 이론적 한계를 규명하며, 메트릭 측도 공간에서의 다차원 척도화 기법의 연속적 한계를 분석합니다. 특히, 구조적 데이터의 위상적 성질을 기반으로 한 지속homology 이론의 기하학적 확장도 핵심 연구 주제입니다.

지속homology고모프-하우스도르프 거리메트릭 측도 공간다차원 척도화위상적 데이터 분석

연구 현황

논문 수
16
총 인용 수
56
최근 5년 논문
13
주요 분야
컴퓨터과학

연구 성과 추이

표시된 성과는 수집된 데이터 기준으로 산출되며, 일부 차이가 있을 수 있습니다.

5개년 연도별 논문 게재 수
13총합
2022
2023
2024
2025
2026
5개년 연도별 피인용 수
47총합
20222023202420252026

주요 논문

15
1
논문|인용수 21·2024
Vietoris–Rips persistent homology, injectivemetric spaces, and the filling radius
Sunhyuk Lim, Facundo Mémoli, Osman Berat Okutan
SJR Q1Algebraic & Geometric TopologyOA

In the applied algebraic topology community, the persistent homology induced by the Vietoris-Rips simplicial filtration is a standard method for capturing topological information from metric spaces. In this paper, we consider a different, more geometric way of generating persistent homology of metric spaces which arises by first embedding a given metric space into a larger space and then considering thickenings of the original space inside this ambient metric space. In the course of doing this,

Computational Theory and MathematicsComputer Science
2
논문|인용수 14·2023
The Gromov–Hausdorff distance betweenspheres
Sunhyuk Lim, Facundo Mémoli, Zane Smith
SJR Q1Geometry & TopologyOA

We provide general upper and lower bounds for the Gromov-Hausdorff distance $d_{\mathrm{GH}}(\mathbb{S}^m,\mathbb{S}^n)$ between spheres $\mathbb{S}^m$ and $\mathbb{S}^n$ (endowed with the round metric) for $0\leq m< n\leq \infty$. Some of these lower bounds are based on certain topological ideas related to the Borsuk-Ulam theorem. Via explicit constructions of (optimal) correspondences we prove that our lower bounds are tight in the cases of $d_{\mathrm{GH}}(\mathbb{S}^0,\mathbb{S}^n)$, $d_{\ma

Computational Theory and MathematicsComputer Science
3
논문|인용수 6·2024
The Gromov–Wasserstein Distance Between Spheres
Shreya Arya, Arnab Auddy, Ranthony A. Clark, Sunhyuk Lim, Facundo Mémoli, Daniel Packer
SJR Q1Foundations of Computational MathematicsOA

Abstract The Gromov–Wasserstein distance—a generalization of the usual Wasserstein distance—permits comparing probability measures defined on possibly different metric spaces. Recently, this notion of distance has found several applications in Data Science and in Machine Learning. With the goal of aiding both the interpretability of dissimilarity measures computed through the Gromov–Wasserstein distance and the assessment of the approximation quality of computational techniques designed to estim

Computational Theory and MathematicsComputer Science
4
preprint|인용수 5·2020
Vietoris-Rips Persistent Homology, Injective Metric Spaces, and The Filling Radius
Sunhyuk Lim, Facundo Mémoli, Osman Berat Okutan
arXiv (Cornell University)OA

In the applied algebraic topology community, the persistent homology induced by the Vietoris-Rips simplicial filtration is a standard method for capturing topological information from metric spaces. In this paper, we consider a different, more geometric way of generating persistent homology of metric spaces which arises by first embedding a given metric space into a larger space and then considering thickenings of the original space inside this ambient metric space. In the course of doing this,

Computational Theory and MathematicsComputer Science
5
preprint|인용수 3·2021
The Gromov-Hausdorff distance between spheres
Sunhyuk Lim, Facundo Mémoli, Zane Smith
arXiv (Cornell University)OA

We provide general upper and lower bounds for the Gromov-Hausdorff distance $d_{\mathrm{GH}}(\mathbb{S}^m,\mathbb{S}^n)$ between spheres $\mathbb{S}^m$ and $\mathbb{S}^n$ (endowed with the round metric) for $0\leq m&lt; n\leq \infty$. Some of these lower bounds are based on certain topological ideas related to the Borsuk-Ulam theorem. Via explicit constructions of (optimal) correspondences we prove that our lower bounds are tight in the cases of $d_{\mathrm{GH}}(\mathbb{S}^0,\mathbb{S}^n)$, $d_{

Geometry and TopologyMathematics
6
논문|인용수 3·2024
Classical multidimensional scaling on metric measure spaces
Sunhyuk Lim, Facundo Mémoli
SJR Q1Information and Inference A Journal of the IMA

Abstract We study a generalization of the classical multidimensional scaling procedure (cMDS) which is applicable in the setting of metric measure spaces. Metric measure spaces can be seen as natural ‘continuous limits’ of finite data sets. Given a metric measure space ${\mathcal{X}} = (X,d_{X},\mu _{X})$, the generalized cMDS procedure involves studying an operator which may have infinite rank, a possibility which leads to studying its traceability. We establish that several continuous exemplar

Computational MechanicsEngineering
7
preprint|인용수 2·2022
Classical Multidimensional Scaling on Metric Measure Spaces
Sunhyuk Lim, Facundo Mémoli
arXiv (Cornell University)OA

We generalize the classical Multidimensional Scaling procedure to the setting of general metric measure spaces. We develop a related spectral theory for the generalized cMDS operator, which provides a more natural and rigorous mathematical background for cMDS. Also, we show that the sum of all negative eigenvalues of the cMDS operator is a new invariant measuring non-flatness of a metric measure space. Furthermore, the cMDS output of several non-finite exemplar metric measures spaces, in particu

Applied MathematicsMathematics
8
preprint|인용수 1·2022
Gromov-Hausdorff distances, Borsuk-Ulam theorems, and Vietoris-Rips complexes
Henry Adams, Johnathan Bush, Nate Clause, Florian Frick, Mario Gómez, Michael R. Harrison, R. Amzi Jeffs, Evgeniya Lagoda, Sunhyuk Lim, Facundo Mémoli, Michael Moy, Nikola Sadovek
arXiv (Cornell University)OA

We explore emerging relationships between the Gromov--Hausdorff distance, Borsuk--Ulam theorems, and Vietoris--Rips simplicial complexes. The Gromov--Hausdorff distance between two metric spaces $X$ and~$Y$ can be lower bounded by the distortion of (possibly discontinuous) functions between them. The more these functions must distort the metrics, the larger the Gromov--Hausdorff distance must be. Topology has few tools to obstruct the existence of discontinuous functions. However, an arbitrary f

Computational Theory and MathematicsComputer Science
9
preprint|인용수 1·2021
Some results about the Tight Span of spheres
Sunhyuk Lim, Facundo Mémoli, Zhengchao Wan, Qingsong Wang, Ling Zhou
arXiv (Cornell University)OA

The smallest hyperconvex metric space containing a given metric space X is called the tight span of X. It is known that tight spans have many nice geometric and topological properties, and they are gradually becoming a target of research of both the metric geometry community and the topological/geometric data analysis community. In this paper, we study the tight span of n-spheres (with either geodesic metric or l infinity-metric).

Computer Vision and Pattern RecognitionComputer Science
10
preprint|인용수 0·2025
The G-Gromov-Hausdorff Distance and Equivariant Topology
Sunhyuk Lim, Facundo Mémoli
ArXiv.orgOA

For each arbitrary finite group $G$, we consider a suitable notion of Gromov Hausdorff distance between compact $G$ metric spaces and derive lower bounds based on equivariant topology methods. As applications, we prove equivariant rigidity and finiteness theorems, and obtain sharp bounds on the Gromov Hausdorff distance between spheres.

Geometry and TopologyMathematics
11
논문|인용수 0·2026
Comparative study of poly(para-xylylene) derivatives as gate dielectrics for organic field-effect transistors
Seokjin Lee, Sunhyuk Lim, Gyuhyeon Choi, Sang Woo Bae, Koungyul Bae, Sangkyun Bae, Young‐Hoon Kim, Hyunjin Park
SJR Q2Organic ElectronicsOA

Poly( para -xylylene) (Parylene) has attracted considerable attention as a gate dielectric material for organic field-effect transistors (OFETs) owing to its conformal and facile deposition, excellent mechanical flexibility, and reliable dielectric properties. Despite these advantages, the dielectric properties of different Parylene derivatives have not yet been systematically compared, and the influence of their chemical structures on the device performance and long-term bias stability of OFETs

Electrical and Electronic EngineeringEngineering
12
preprint|인용수 0·2023
The Weisfeiler-Lehman Distance: Reinterpretation and Connection with GNNs
Samantha Chen, Sunhyuk Lim, Facundo Mémoli, Zhengchao Wan, Yusu Wang
arXiv (Cornell University)OA

In this paper, we present a novel interpretation of the so-called Weisfeiler-Lehman (WL) distance, introduced by Chen et al. (2022), using concepts from stochastic processes. The WL distance aims at comparing graphs with node features, has the same discriminative power as the classic Weisfeiler-Lehman graph isomorphism test and has deep connections to the Gromov-Wasserstein distance. This new interpretation connects the WL distance to the literature on distances for stochastic processes, which a

Experimental and Cognitive PsychologyPsychology
13
preprint|인용수 0·2023
The Gromov-Wasserstein distance between spheres
Shreya Arya, Arnab Auddy, Ranthony A. C. Edmonds, Sunhyuk Lim, Facundo Mémoli, Daniel Packer
arXiv (Cornell University)OA

In this paper we consider a two-parameter family {dGWp,q}p,q of Gromov- Wasserstein distances between metric measure spaces. By exploiting a suitable interaction between specific values of the parameters p and q and the metric of the underlying spaces, we determine the exact value of the distance dGW4,2 between all pairs of unit spheres of different dimension endowed with their Euclidean distance and their uniform measure.

Pathology and Forensic MedicineMedicine
14
preprint|인용수 0·2022
Weisfeiler-Lehman meets Gromov-Wasserstein
Samantha Chen, Sunhyuk Lim, Facundo Mémoli, Zhengchao Wan, Yusu Wang
arXiv (Cornell University)OA

The Weisfeiler-Lehman (WL) test is a classical procedure for graph isomorphism testing. The WL test has also been widely used both for designing graph kernels and for analyzing graph neural networks. In this paper, we propose the Weisfeiler-Lehman (WL) distance, a notion of distance between labeled measure Markov chains (LMMCs), of which labeled graphs are special cases. The WL distance is polynomial time computable and is also compatible with the WL test in the sense that the former is positive

Artificial IntelligenceComputer Science
15
preprint|인용수 0·2023
Reverse Bernstein Inequality on the Circle
Parvaneh Joharinad, Jürgen Jost, Sunhyuk Lim, Rostislav Matveev
arXiv (Cornell University)OA

The more then hundred years old Bernstein inequality states that the supremum norm of the derivative of a trigonometric polynomial of fixed degree can be bounded from above by supremum norm of the polynomial itself. The reversed Bernstein inequality, that we prove in this note, says that the reverse inequality holds for functions in the orthogonal complement of the space of polynomials of fixed degree. In fact, we derived a more general result for the lower bounds on higher derivatives. These bo

Computational MechanicsEngineering

대표 연구 분야

Computational Theory and MathematicsGeometry and TopologyComputational MechanicsElectrical and Electronic EngineeringApplied MathematicsComputer Vision and Pattern Recognition

임선혁 교수의 연구를 Nubint에서 더 깊이 살펴보세요

이 연구실의 논문을 앱에서 열어 AI와 함께 읽고, 핵심을 요약하고, 내 글에 인용하세요.