arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2205.09049cond-mat.stat-mechmath.PR
收藏

具有一般边势的随机图嵌入

Random graph embeddings with general edge potentials

Jason Cantarella, Tetsuo Deguchi, Clayton Shonkwiler, Erica Uehara

摘要:

在本文中,我们研究了聚合物网络的随机嵌入分布根据任何势能,可以表示为单体对之间的距离。这包括自由连接的链、空间效应、Lennard-Jones势、弯曲能和其他物理上真实的模型。在$\mathbb{R}^d$中的$n$单体的构型可以被写为$d$坐标矢量的集合,每个在$\mathbb{R}^n$中。我们的第一个主要结果是,来自不同坐标向量的条目是不相关的,即使它们是同一单体的不同坐标。我们预测,这一属性保持在现实的模拟和实际的聚合物配置(在没有外部场)。我们的第二个主要贡献是一个定理,解释了何时以及如何将复杂图嵌入的概率分布推到一个简单图嵌入的分布上,以帮助计算。这种构造是基于同调理论中链映射的思想。我们用它给出了幻影网络理论中边协方差的一个新公式,并计算了自由连接网络的一些期望值。

英文摘要:

In this paper, we study random embeddings of polymer networks distributed according to any potential energy which can be expressed in terms of distances between pairs of monomers. This includes freely jointed chains, steric effects, Lennard-Jones potentials, bending energies, and other physically realistic models. A configuration of $n$ monomers in $\mathbb{R}^d$ can be written as a collection of $d$ coordinate vectors, each in $\mathbb{R}^n$. Our first main result is that entries from different coordinate vectors are uncorrelated, even when they are different coordinates of the same monomer. We predict that this property holds in realistic simulations and in actual polymer configurations (in the absence of an external field). Our second main contribution is a theorem explaining when and how a probability distribution on embeddings of a complicated graph may be pushed forward to a distribution on embeddings of a simpler graph to aid in computations. This construction is based on the idea of chain maps in homology theory. We use it to give a new formula for edge covariances in phantom network theory and to compute some expectations for a freely-jointed network.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑