Jie Wu

Jie Wu


Research Focus & Metrics

Academic Career Length

27Years (2000-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 November 2015 in Transactions of the American Mathematical Society
Verified
Journal Article
Closed access
PDF file
JGJelena Grbic
Jelena Grbic
TPTaras Panov
Taras Panov
STStephen Theriault
Stephen Theriault
JWJie Wu
Jie Wu
We study the homotopy types of moment-angle complexes, or equivalently, of complements of coordinate subspace arrangements. The overall aim is to identify the simplicial complexes for which the corresponding moment-angle complex <!-- MATH $\mathcal Z_{K}$ --> has the homotopy type of a wedge of spheres or a connected sum of sphere products. When is flag, we identify in algebraic and combinatorial terms those for which <!-- MATH $\mathcal Z_{K}$ --> is homotopy equivalent to a wedge of spheres, and give a combinatorial formula for the number of spheres in the wedge. This extends results of Berglund and Jöllenbeck on Golod rings and homotopy theoretical results of the first and third authors. We also establish a connection between minimally non-Golod rings and moment-angle complexes <!-- MATH $\mathcal Z_{K}$ --> which are homotopy equivalent to a connected sum of sphere products. We go on to show that for any flag complex the loop spaces <!-- MATH $\Omega \mathcal Z_{K}$ --> and <!-- MATH $\Omega \mbox {$D{\mskip -1mu}J\/$}(K)$ --> are homotopy equivalent to a product of spheres and loops on spheres when localised rationally or at any prime .

6 April 2022 in PLOS Computational Biology
Verified
Journal Article
Open access
PDF file
XLXiang Liu
Xiang Liu
HFHuitao Feng
Huitao Feng
JWJie Wu
Jie Wu
KXKelin Xia
Kelin Xia
With the great advancements in experimental data, computational power and learning algorithms, artificial intelligence (AI) based drug design has begun to gain momentum recently. AI-based drug design has great promise to revolutionize pharmaceutical industries by significantly reducing the time and cost in drug discovery processes. However, a major issue remains for all AI-based learning model that is efficient molecular representations. Here we propose Dowker complex (DC) based molecular interaction representations and Riemann Zeta function based molecular featurization, for the first time. Molecular interactions between proteins and ligands (or others) are modeled as Dowker complexes. A multiscale representation is generated by using a filtration process, during which a series of DCs are generated at different scales. Combinatorial (Hodge) Laplacian matrices are constructed from these DCs, and the Riemann zeta functions from their spectral information can be used as molecular descriptors. To validate our models, we consider protein-ligand binding affinity prediction. Our DC-based machine learning (DCML) models, in particular, DC-based gradient boosting tree (DC-GBT), are tested on three most-commonly used datasets, i.e., including PDBbind-2007, PDBbind-2013 and PDBbind-2016, and extensively compared with other existing state-of-the-art models. It has been found that our DC-based descriptors can achieve the state-of-the-art results and have better performance than all machine learning models with traditional molecular descriptors. Our Dowker complex based machine learning models can be used in other tasks in AI-based drug design and molecular data analysis.

23 January 2023 in The Journal of Physical Chemistry Letters
Verified
Journal Article
Closed access
DCDong Chen
Dong Chen
JLJian Liu
Jian Liu
JWJie Wu
Jie Wu
Guowei WeiGuowei Wei
Guowei Wei
FPFeng Pan
Feng Pan
SYShing-Tung Yau
Shing-Tung Yau

1 January 2023 in Foundations of Data Science
Verified
Journal Article
Closed access
PDF file
DCDong Chen
Dong Chen
JLJian Liu
Jian Liu
JWJie Wu
Jie Wu
Guowei WeiGuowei Wei
Guowei Wei
Hypergraphs are useful mathematical models for describing complex relationships among members of a structured graph, while hyperdigraphs serve as a generalization that can encode asymmetric relationships in the data. However, obtaining topological information directly from hyperdigraphs remains a challenge. To address this issue, we introduce hyperdigraph homology in this work. We also propose topological hyperdigraph Laplacians, which can extract both harmonic spectra and non-harmonic spectra from directed and internally organized data. Moreover, we introduce persistent hyperdigraph homology and persistent hyperdigraph Laplacians through filtration, enabling the capture of topological persistence and homotopic shape evolution of directed and structured data across multiple scales. The proposed methods offer new multiscale algebraic topology tools for topological data analysis.

22 February 2008
Verified
Conference Paper
Closed access
FCF R Cohen
F R Cohen
JPJ Pakianathan
J Pakianathan
VVV V Vershinin
V V Vershinin
JWJie Wu
Jie Wu
Let F_n = denote the free group with generators {x_1,...,x_n}. Nielsen and Magnus described generators for the kernel of the canonical epimorphism from the automorphism group of F_n to the general linear group over the integers. In particular among them are the automorphisms chi_{k,i} which conjugate the generator x_k by the generator x_i leaving the x_j fixed for j not k. A computation of the cohomology ring as well as the Lie algebra obtained from the descending central series of the group generated by chi_{k,i} for i

21 December 2025 in Artificial Intelligence Review
Verified
Journal Article
Open access
PDF file
ZSZhe Su
Zhe Su
LXLiu Xiang
Liu Xiang
LHLayal Bou Hamdan
Layal Bou Hamdan
VMVasileios Maroulas
Vasileios Maroulas
JWJie Wu
Jie Wu
Guowei WeiGuowei Wei
Guowei Wei
Topological data analysis (TDA) is a rapidly evolving field in applied mathematics and data science that leverages tools from topology to uncover robust, shape-driven, and explainable insights in complex datasets. The main workhorse is persistent homology, a technique rooted in algebraic topology. Paired with topological deep learning (TDL) or topological machine learning, persistent homology has achieved tremendous success in a wide variety of applications in science, engineering, medicine, and industry. However, persistent homology has many limitations due to its high-level abstraction, insensitivity to non-topological changes, and restriction to point cloud data. This paper presents a comprehensive review of TDA and TDL beyond persistent homology. It analyzes how persistent topological Laplacians and Dirac operators provide spectral representations to capture both topological invariants and homotopic evolution. Other formulations are presented in terms of sheaf theory, Mayer topology, and interaction topology. For data on differentiable manifolds, techniques rooted in differential topology, such as persistent de Rham cohomology, persistent Hodge Laplacian, and Hodge decomposition, are reviewed. For one-dimensional (1D) curves embedded in 3-space, approaches from geometric topology are discussed, including multiscale Gauss-link integrals, persistent Jones polynomials, and persistent Khovanov homology. This paper further discusses the appropriate selection of topological tools for different input data, such as point clouds, sequential data, data on manifolds, curves embedded in 3-space, and data with additional non-geometric information. A review is also given of various topological representations, software packages, and machine learning vectorizations. Finally, this review ends with concluding remarks.