henhaobio
Sign in

Bulletin of Mathematical BiologySystems BiologyPeer-reviewed journal article

Laplacian Dynamics and Kron Reduction in Species-Reaction Graphs of Chemical Reaction Networks

M. D. GasparyaniD, Upinder S. BhallaiD, Ovidiu RadulescuiD, Shodhan RaoiD

PDFDOIPreprint

Abstract

We present a new method for deriving the dynamics of chemical reaction networks using the Laplacian matrix of the corresponding species-reaction graph, in contrast to previous works that use the Laplacian of the graph of complexes. Species-reaction graphs are bipartite graphs that contain two sets of vertices, one representing species and the other representing reactions, connected by directed edges that indicate relationships between them. Our approach starts by assigning appropriate edge weights to this bipartite graph, which are then used to compute the weighted graph Laplacian. This Laplacian reformulation of the system of differential equations governing the network dynamics emphasizes the flow of information throughout the chemical reaction network considered as causal network. As an application of this framework, we introduce a novel model reduction technique based on the Kron reduction of the weighted Laplacian matrix associated with the species-reaction graphs. Our systematic approach involves identifying nodes for deletion while preserving the bipartite structure, followed by constructing the Kron-reduced model. To demonstrate the effectiveness of our method, we apply it to a complex biochemical network, showing how model simplification facilitates analysis and interpretation of these systems.

Citations
0
FWCI
0.00
Field percentile
1th percentile

Reproducibility ledger

Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.

Sign in to file a reproducibility report.

Similarity Map
SelectedSame fieldCross-field
THISBuffard '21Prugger '23Himeoka '22Yordanov '20Cravo '22Tefagh '19
65% semantic matchSystems Biology
Marion Buffard, Aurélien Desoeuvres, Aurélien Naldi+3 more·Lecture notes in computer science·Jan 1, 2021