• Journal of the Korea Society of Computer and Information
• /
• v.29 no.11
• /
• pp.97-105
• /
• 2024

Lots of tasks including physical systems modeling, chemical reaction prediction, and relation extraction require dealing with higher-order relations. Graph neural networks (GNNs) are favorite models for relational data but they have inherent limits due to their focus on pairwise relationships. Topological data analysis (TDA) provides insight into the "shape" of data (or underlying data topology). TDA aims to infer information about data manifold such as connectivity and offers higher-dimensional analog of graphs. Topological deep learning (TDL) combines various deep learning techniques with TDA. TDL enables us to formulate simplicial complex and cell complex through techniques such as low-dimensional embedding and attention. In this paper, we summarize recent achievements especially on simplicial complex and cell complex. We also provide succinct descriptions of related concepts.

• Honam Mathematical Journal
• /
• v.27 no.1
• /
• pp.115-129
• /
• 2005

In this paper, we give a digital graph-theoretical approach of the study of digital images with relation to a simplicial complex. Thus, a digital graph $G_k$ with some k-adjacency in ${\mathbb{Z}}^n$ can be recognized by the simplicial complex spanned by $G_k$. Moreover, we demonstrate that a graphically $(k_0,\;k_1)$-continuous map $f:G_{k_0}{\subset}{\mathbb{Z}}^{n_0}{\rightarrow}G_{k_1}{\subset}{\mathbb{Z}}^{n_1}$ can be converted into the simplicial map $S(f):S(G_{k_0}){\rightarrow}S(G_{k_1})$ with relation to combinatorial topology. Finally, if $G_{k_0}$ is not $(k_0,\;3^{n_0}-1)$-homotopy equivalent to $SC^{n_0,4}_{3^{n_0}-1}$, a graphically $(k_0,\;k_1)$-continuous map (respectively a graphically $(k_0,\;k_1)$-isomorphisim) $f:G_{k_0}{\subset}{\mathbb{Z}}^{n_0}{\rightarrow}G_{k_1}{\subset}{\mathbb{Z}^{n_1}$ induces the group homomorphism (respectively the group isomorphisim) $S(f)_*:{\pi}_1(S(G_{k_0}),\;v_0){\rightarrow}{\pi}_1(S(G_{k_1}),\;f(v_0))$ in algebraic topology.

• Journal of the Korean Mathematical Society
• /
• v.57 no.6
• /
• pp.1323-1333
• /
• 2020

In 2009, Borg [2] suggested a conjecture concerning the size of a t-intersecting k-uniform family of faces of an arbitrary simplicial complex. In this paper, we give a strengthening of Borg's conjecture for shifted simplicial complexes using algebraic shifting.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.4
• /
• pp.1051-1063
• /
• 2018

The real moment-angle complex (or, more generally, real polyhedral product) and its real toric space have recently attracted much attention in toric topology. The aim of this paper is to give two interesting remarks regarding real polyhedral products and real toric spaces. That is, we first show that Moore's conjecture holds to be true for certain real polyhedral products. In general, real polyhedral products show some drastic difference between the rational and torsion homotopy groups. Our result shows that at least in terms of the homotopy exponent at a prime this is not the case for real polyhedral products associated to a simplicial complex whose minimal missing faces are all k-simplices with $k{\geq}2$. Moreover, we also show a structural theorem for a finite group G acting simplicially on the real toric space. In other words, we show that G always contains an element of order 2, and so the order of G should be even.

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.1
• /
• pp.265-276
• /
• 2017

Let K be a fan-like simplicial sphere of dimension n-1 such that its associated complete fan is strongly polytopal, and let v be a vertex of K. Let K(v) be the simplicial wedge complex obtained by applying the simplicial wedge operation to K at v, and let $v_0$ and $v_1$ denote two newly created vertices of K(v). In this paper, we show that there are infinitely many strongly polytopal fans ${\Sigma}$ over such K(v)'s, different from the canonical extensions, whose projected fans ${Proj_v}_i{\Sigma}$ (i = 0, 1) are also strongly polytopal. As a consequence, it can be also shown that there are infinitely many projective toric varieties over such K(v)'s such that toric varieties over the underlying projected complexes $K_{{Proj_v}_i{\Sigma}}$ (i = 0, 1) are also projective.

• Journal of the Korean Mathematical Society
• /
• v.56 no.6
• /
• pp.1613-1639
• /
• 2019

Imposing a strong condition on the linear order of shellable complexes, we introduce strong shellability. Basic properties, including the existence of dimension-decreasing strong shelling orders, are developed with respect to nonpure strongly shellable complexes. Meanwhile, pure strongly shellable complexes can be characterized by the corresponding codimension one graphs. In addition, we show that the facet ideals of pure strongly shellable complexes have linear quotients.

• Honam Mathematical Journal
• /
• v.18 no.1
• /
• pp.25-31
• /
• 1996

• Journal of Communications and Networks
• /
• v.16 no.6
• /
• pp.667-676
• /
• 2014

Connectivity is a crucial quality of service measure in wireless sensor networks. However, the network is always at risk of being split into several disconnected components owing to the sensor failures caused by various factors. To handle the connectivity problem, this paper introduces an in-advance mechanism to prevent network partitioning in the initial deployment phase. The approach is implemented in a distributed manner, and every node only needs to know local information of its 1-hop neighbors, which makes the approach scalable to large networks. The goal of the proposed mechanism is twofold. First, critical nodes are locally detected by the critical node detection (CND) algorithm based on the concept of maximal simplicial complex, and backups are arranged to tolerate their failures. Second, under a greedy rule, topological holes within the maximal simplicial complex as another potential risk to the network connectivity are patched step by step. Finally, we demonstrate the effectiveness of the proposed algorithm through simulation experiments.

• Communications of the Korean Mathematical Society
• /
• v.13 no.4
• /
• pp.839-845
• /
• 1998

For an oriented compact, connected Seifert fibred 3-manifold M with nonempty boundary, we construct a simplicial complex using the equivalence classes of marked annulus systems and show that it is contractible.

• The Korean Journal of Applied Statistics
• /
• v.20 no.2
• /
• pp.313-322
• /
• 2007

Several robust censored depth regression methods are compared under contamination. Park and Hwang(2003) suggested a way to circumvent the censoring issue by incorporating Kaplan-Meier type weight in halfspace regression depth and Park(2003) used a similar technique to simplicial regression depth. Hubert et al. (2001) suggested a high breakdown point regression depth based on projection called rcent. A new method to implement censoring in rcent is suggested and compared with two precedents under various contamination and censoring schemes.