Counting chemical reaction networks with NAUTY
نویسنده
چکیده
It is useful to have complete lists of nonisomorphic chemical reaction networks (CRNs) of a given size, with or without various restrictions. One may, for example, be interested in exploring how often certain dynamical behaviours occur in small CRNs, or wish to find examples to illustrate some aspect of the theory. In such cases, it is natural to examine one representative from each isomorphism class of CRNs. Inspired by the related project of Deckard et al [1], this document outlines the methodology involved in listing all CRNs in various classes of interest including, for example, general CRNs, dynamically nontrivial CRNs, weakly reversible CRNs, fully open CRNs, etc. The accompanying data (i.e., lists of nonisomorphic CRNs in the various classes) is at https://reaction-networks.net/networks/. Note that both document and data are work in progress.
منابع مشابه
NetMODE: Network Motif Detection without Nauty
A motif in a network is a connected graph that occurs significantly more frequently as an induced subgraph than would be expected in a similar randomized network. By virtue of being atypical, it is thought that motifs might play a more important role than arbitrary subgraphs. Recently, a flurry of advances in the study of network motifs has created demand for faster computational means for iden...
متن کاملOmega and PIv Polynomial in Dyck Graph-like Z(8)-Unit Networks
Design of crystal-like lattices can be achieved by using some net operations. Hypothetical networks, thus obtained, can be characterized in their topology by various counting polynomials and topological indices derived from them. The networks herein presented are related to the Dyck graph and described in terms of Omega polynomial and PIv polynomials.
متن کاملLogic Programming with Graph Automorphism: Integrating naut with Prolog (a Tool Paper)
This paper presents the pl-nauty library, a Prolog interface to the nauty graph-automorphism tool. Adding the capabilities of nauty to Prolog combines the strength of the “generate and prune” approach that is commonly used in logic programming and constraint solving, with the ability to reduce symmetries while reasoning over graph objects. Moreover, it enables the integration of nauty in existi...
متن کاملKinetic Mechanism Reduction Using Genetic Algorithms, Case Study on H2/O2 Reaction
For large and complex reacting systems, computational efficiency becomes a critical issue in process simulation, optimization and model-based control. Mechanism simplification is often a necessity to improve computational speed. We present a novel approach to simplification of reaction networks that formulates the model reduction problem as an optimization problem and solves it using geneti...
متن کاملIntegration Of A Graph Formatter With Symmetry And Bisection Analysis
Graphs representing interconnection networks are often drawn without considering inherent symmetry and bisection properties. By using the nauty package for analyzing a graph for automorphisms, vertices are then displayed in AT&T’s NEATO package to make topologically-equivalent vertices obvious. Edges are similarly colored based on the METIS package’s heuristic for bisecting a graph by removing ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017