Automatic partitioning for the low-rank integration of stochastic Boolean reaction networks
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866929664934543360 |
|---|---|
| author | Einkemmer, Lukas Mangott, Julian Prugger, Martina |
| author_facet | Einkemmer, Lukas Mangott, Julian Prugger, Martina |
| contents | Boolean reaction networks are an important tool in biochemistry for studying mechanisms in the biological cell. However, the stochastic formulation of such networks requires the solution of a master equation which inherently suffers from the curse of dimensionality. In the past, the dynamical low-rank (DLR) approximation has been repeatedly used to solve high-dimensional reaction networks by separating the network into smaller partitions. However, the partitioning of these networks was so far only done by hand. In this paper, we present a heuristic, automatic partitioning scheme based on two ingredients: the Kernighan-Lin algorithm and information entropy. Our approach is computationally inexpensive and can be easily incorporated as a preprocessing step into the existing simulation workflow. We test our scheme by partitioning Boolean reaction networks on a single level and also in a hierarchical fashion with tree tensor networks. The resulting accuracy of the scheme is superior to both partitionings chosen by human experts and those found by simply minimizing the number of reaction pathways between partitions. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_04157 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Automatic partitioning for the low-rank integration of stochastic Boolean reaction networks Einkemmer, Lukas Mangott, Julian Prugger, Martina Numerical Analysis Biological Physics Computational Physics Boolean reaction networks are an important tool in biochemistry for studying mechanisms in the biological cell. However, the stochastic formulation of such networks requires the solution of a master equation which inherently suffers from the curse of dimensionality. In the past, the dynamical low-rank (DLR) approximation has been repeatedly used to solve high-dimensional reaction networks by separating the network into smaller partitions. However, the partitioning of these networks was so far only done by hand. In this paper, we present a heuristic, automatic partitioning scheme based on two ingredients: the Kernighan-Lin algorithm and information entropy. Our approach is computationally inexpensive and can be easily incorporated as a preprocessing step into the existing simulation workflow. We test our scheme by partitioning Boolean reaction networks on a single level and also in a hierarchical fashion with tree tensor networks. The resulting accuracy of the scheme is superior to both partitionings chosen by human experts and those found by simply minimizing the number of reaction pathways between partitions. |
| title | Automatic partitioning for the low-rank integration of stochastic Boolean reaction networks |
| topic | Numerical Analysis Biological Physics Computational Physics |
| url | https://arxiv.org/abs/2501.04157 |