两全其美:使用Cayley坐标对距离约束构型空间进行笛卡尔采样与体积计算
Best of two worlds: Cartesian sampling and volume computation for distance-constrained configuration spaces using Cayley coordinates
AI总结:
提出基于距离Cayley坐标的采样体积计算方法,保证在低维空间遍历并双向映射,以线性时间和亚线性空间高效计算距离约束构型空间的离散体积。
摘要:
构型空间的体积计算是构型熵计算的重要组成部分,有助于计算分子系统的自由能景观。本文提出了一种基于采样的体积计算方法,该方法使用基于距离的Cayley坐标,并缓解了现有方法的缺点:该方法保证采样过程始终停留在低维坐标空间(而非高维笛卡尔空间)中;并且利用Cayley参数化的映射函数可以双向应用,且计算成本低。该方法均匀采样并计算满足距离不等式约束系统的点集的笛卡尔构型空间的离散体积测度。这些系统属于一个大的自然类,其可行构型空间是高维环境空间的有效低维子集。其拓扑复杂性使得离散体积计算具有挑战性,但在软物质组装建模中的自由能计算等多个应用场景中又是必要的。该算法在与构型空间相交的网格超立方体(用于定义离散体积测度)数量上呈线性时间复杂度,且在经验上呈亚线性空间复杂度。换言之,与通常基于梯度下降的主流方法相比,浪费的网格立方体访问次数微不足道。具体而言,通过将可行构型空间视为分支覆盖,使用Cayley或距离坐标的最新理论对基础空间进行凸化,并采用空间高效的前沿超立方体遍历数据结构,遍历过程始终保持在可行构型空间内。提供了软件实现并与现有方法进行了比较。
英文摘要:
Volume calculation of configurational spaces acts as a vital part in configurational entropy calculation, which contributes towards calculating free energy landscape for molecular systems. In this article, we present our sampling-based volume computation method using distance-based Cayley coordinate, mitigating drawbacks: our method guarantees that the sampling procedure stays in lower-dimensional coordinate space (instead of higher-dimensional Cartesian space) throughout the whole process; and our mapping function, utilizing Cayley parameterization, can be applied in both directions with low computational cost. Our method uniformly samples and computes a discrete volume measure of a Cartesian configuration space of point sets satisfying systems of distance inequality constraints. The systems belong to a large natural class whose feasible configuration spaces are effectively lower dimensional subsets of high dimensional ambient space. Their topological complexity makes discrete volume computation challenging, yet necessary in several application scenarios including free energy calculation in soft matter assembly modeling. The algorithm runs in linear time and empirically sub-linear space in the number of grid hypercubes (used to define the discrete volume measure) \textit{that intersect} the configuration space. In other words, the number of wasted grid cube visits is insignificant compared to prevailing methods typically based on gradient descent. Specifically, the traversal stays within the feasible configuration space by viewing it as a branched covering, using a recent theory of Cayley or distance coordinates to convexify the base space, and by employing a space-efficient, frontier hypercube traversal data structure. A software implementation and comparison with existing methods is provided.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。