A recursive graph-merging algorithm produces networks with extreme topological properties that their degree sequences do not predict.
Assembly in Directed Hypergraphs
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Assembly theory has received considerable attention in the recent past. Here we analyze the formal framework of this model and show that assembly pathways coincide with certain minimal hyperpaths in B-hypergraphs. This makes it possible to generalize the notion of assembly to general chemical reaction systems and to make explicit the connection to rule based models of chemistry, in particular DPO graph rewriting. We observe, furthermore, that assembly theory is closely related to retrosynthetic analysis in chemistry. The assembly index fits seamlessly into a large family of cost measures for directed hyperpath problems that also encompasses cost functions used in computational synthesis planning. This allows to devise a generic approach to compute complexity measures derived from minimal hyperpaths in rule-derived directed hypergraphs using integer linear programming.
fields
physics.soc-ph 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Historical Contingencies Steer the Topology of Randomly Assembled Graphs
A recursive graph-merging algorithm produces networks with extreme topological properties that their degree sequences do not predict.