Identifying transition states of chemical kinetic systems using network embedding techniques

Many chemical and biochemical systems can be intuitively modeled using networks. Due to the size and complexity of many biochemical networks, we require tools for efficient network analysis. Of particular interest are techniques that embed network vertices into vector spaces while preserving importa...

Full description

Bibliographic Details
Main Authors: Paula Mercurio, Di Liu
Format: Article
Language:English
Published: AIMS Press 2021-04-01
Series:Mathematical Biosciences and Engineering
Subjects:
Online Access:http://www.aimspress.com/article/doi/10.3934/mbe.2021046?viewType=HTML
id doaj-32b86fb01a494ef49fa86cc1ff6847c0
record_format Article
spelling doaj-32b86fb01a494ef49fa86cc1ff6847c02021-04-07T01:34:32ZengAIMS PressMathematical Biosciences and Engineering1551-00182021-04-0118186888710.3934/mbe.2021046Identifying transition states of chemical kinetic systems using network embedding techniquesPaula Mercurio0Di Liu1Department of Mathematics, Michigan State University, East Lansing, MI, USADepartment of Mathematics, Michigan State University, East Lansing, MI, USAMany chemical and biochemical systems can be intuitively modeled using networks. Due to the size and complexity of many biochemical networks, we require tools for efficient network analysis. Of particular interest are techniques that embed network vertices into vector spaces while preserving important properties of the original graph. In this article, we {introduce a new method for generating low-dimensional node embeddings for directed graphs, using random walk sampling methods for feature learning on networks. Additionally, we demonstrate the usefulness of this method for identifying transition states of stochastic chemical reacting systems.} Network representations of chemical systems are typically given by weighted directed graphs, and are often complex and high dimensional. In order to deal with networks representing these chemical systems, therefore, we modified objective functions adopted in existing random walk based network embedding methods to handle directed graphs and neighbors of different degrees. Through optimization via gradient ascent, we embed the weighted graph vertices into a low-dimensional vector space R<sup>d</sup> while preserving the neighborhood of each node. These embeddings may then be used to detect relationships between nodes and study the structure of the original network. We then demonstrate the effectiveness of our method on dimension reduction through several examples regarding identification of transition states of chemical reactions, especially for entropic systems.http://www.aimspress.com/article/doi/10.3934/mbe.2021046?viewType=HTMLnetworksnetwork embeddingfeature learningtransition statesrandom walks
collection DOAJ
language English
format Article
sources DOAJ
author Paula Mercurio
Di Liu
spellingShingle Paula Mercurio
Di Liu
Identifying transition states of chemical kinetic systems using network embedding techniques
Mathematical Biosciences and Engineering
networks
network embedding
feature learning
transition states
random walks
author_facet Paula Mercurio
Di Liu
author_sort Paula Mercurio
title Identifying transition states of chemical kinetic systems using network embedding techniques
title_short Identifying transition states of chemical kinetic systems using network embedding techniques
title_full Identifying transition states of chemical kinetic systems using network embedding techniques
title_fullStr Identifying transition states of chemical kinetic systems using network embedding techniques
title_full_unstemmed Identifying transition states of chemical kinetic systems using network embedding techniques
title_sort identifying transition states of chemical kinetic systems using network embedding techniques
publisher AIMS Press
series Mathematical Biosciences and Engineering
issn 1551-0018
publishDate 2021-04-01
description Many chemical and biochemical systems can be intuitively modeled using networks. Due to the size and complexity of many biochemical networks, we require tools for efficient network analysis. Of particular interest are techniques that embed network vertices into vector spaces while preserving important properties of the original graph. In this article, we {introduce a new method for generating low-dimensional node embeddings for directed graphs, using random walk sampling methods for feature learning on networks. Additionally, we demonstrate the usefulness of this method for identifying transition states of stochastic chemical reacting systems.} Network representations of chemical systems are typically given by weighted directed graphs, and are often complex and high dimensional. In order to deal with networks representing these chemical systems, therefore, we modified objective functions adopted in existing random walk based network embedding methods to handle directed graphs and neighbors of different degrees. Through optimization via gradient ascent, we embed the weighted graph vertices into a low-dimensional vector space R<sup>d</sup> while preserving the neighborhood of each node. These embeddings may then be used to detect relationships between nodes and study the structure of the original network. We then demonstrate the effectiveness of our method on dimension reduction through several examples regarding identification of transition states of chemical reactions, especially for entropic systems.
topic networks
network embedding
feature learning
transition states
random walks
url http://www.aimspress.com/article/doi/10.3934/mbe.2021046?viewType=HTML
work_keys_str_mv AT paulamercurio identifyingtransitionstatesofchemicalkineticsystemsusingnetworkembeddingtechniques
AT diliu identifyingtransitionstatesofchemicalkineticsystemsusingnetworkembeddingtechniques
_version_ 1721536976325181440