Lecca Paola, Re Angela
Faculty of Engineering, Free University of Bozen-Bolzano, NOI Techpark - via A. Volta 13/A, 39100, Bolzano-Bozen, Italy.
Member of the National Group for Mathematical Analysis, Probability and their Applications, Francesco Severi National Institute of High Mathematics, Città Universitaria - P.le Aldo Moro 5, 00185, Rome, Italy.
BMC Pharmacol Toxicol. 2025 Jun 25;26(Suppl 1):123. doi: 10.1186/s40360-025-00948-6.
In mathematics, a physical network (e.g. biological network, social network, IT network, communication network) is usually represented by a graph. The determination of the metric space (also referred to as latent geometry) of the graph and the disposition of its nodes on it provide important information on the reaction propensity and consequently on the possible presence of bottlenecks in a system of interacting molecules, such as it happens in pharmacokinetics. To determine the latent geometry and the coordinates of nodes, it is necessary to have the dissimilarity or distance matrix of the network, an input that is not always easy to measure in experiments.
The main result of this study is the mathematical and computational procedure for determining the distance/dissimilarity matrix between nodes and for identifying the latent network geometry from experimental time series of node concentrations. Specifically, we show how this matrix can be calculated from the transfer entropy between nodes, which is a measure of the flow of information between nodes and thus indirectly of the reaction propensity between them. We implemented a procedure of spectral graph embedding to embed the distance/dissimilarity matrix in flat and curved metric spaces, and consequently to determine the optimal latent geometry of the network. The distances between nodes in the metric space describing the latent geometry can be analyzed to identify bottlenecks in the reaction system. As a case study for this procedure, we consider the pharmacokinetics of atorvastatin, as described by recent studies and experimental time data.
The method of determining distances between nodes from temporal measurements of node concentrations through the calculation of transfer entropy makes it possible to incorporate the information of kinetics (inherent in the time series) in the construction of the distance/dissimilarity matrix, and, consequently, in the determination of the network latent geometry, a characterisation of the network itself that is intimately connected to its dynamics, but which has so far been scarcely investigated and taken into account. The results on the case study of the pharmacokinetics of atorvastatin corroborate the usability and reliability of the method within certain limits of the experimental errors on the data.
在数学中,物理网络(如生物网络、社交网络、信息技术网络、通信网络)通常由图表示。图的度量空间(也称为潜在几何)的确定及其节点在其上的布局提供了有关反应倾向的重要信息,从而也提供了有关相互作用分子系统中可能存在瓶颈的重要信息,就像在药代动力学中那样。为了确定潜在几何和节点坐标,有必要拥有网络的差异或距离矩阵,而这一输入在实验中并不总是易于测量的。
本研究的主要成果是用于确定节点之间的距离/差异矩阵以及从节点浓度的实验时间序列识别潜在网络几何的数学和计算程序。具体而言,我们展示了如何从节点之间的转移熵计算该矩阵,转移熵是节点之间信息流的一种度量,因此间接反映了它们之间的反应倾向。我们实施了一种谱图嵌入程序,将距离/差异矩阵嵌入到平坦和弯曲的度量空间中,从而确定网络的最佳潜在几何。可以分析描述潜在几何的度量空间中节点之间的距离,以识别反应系统中的瓶颈。作为该程序的一个案例研究,我们考虑了近期研究和实验时间数据所描述的阿托伐他汀的药代动力学。
通过计算转移熵从节点浓度的时间测量确定节点之间距离的方法,使得在构建距离/差异矩阵时能够纳入动力学信息(时间序列中固有的),进而在确定网络潜在几何时纳入该信息,网络潜在几何是与网络动态密切相关的网络自身特征,但迄今为止很少被研究和考虑。阿托伐他汀药代动力学案例研究的结果证实了该方法在数据实验误差的一定范围内的可用性和可靠性。