Factoring the Laplacian to understand topological polymers

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Cantarella, Jason, Deguchi, Tetsuo, Shonkwiler, Clayton, Uehara, Erica
Format: Preprint
Veröffentlicht: 2020
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866908598052847616
author Cantarella, Jason
Deguchi, Tetsuo
Shonkwiler, Clayton
Uehara, Erica
author_facet Cantarella, Jason
Deguchi, Tetsuo
Shonkwiler, Clayton
Uehara, Erica
contents A ring polymer is a random walk whose steps obey a single linear condition; their sum vanishes. Factoring the graph Laplacian into the product of the incidence matrix and its transpose allows us to show that for a more complicated network, the steps must lie in a linear subspace determined by the graph topology. This provides a useful new perspective on the James--Guth theory of phantom elastic networks. In particular, we formulate phantom networks which are free from the constraints of fixed crosslinks. For a given network the solution of the loop constraints makes the partition function finite-valued in the path integral formulation without applying any external forces or fixing any monomer positions. The resulting probability distribution on edge displacements is rotationally invariant, which is practically quite useful for generating unbiased random samples of edge displacements and monomer positions. Furthermore, one can exactly calculate many physical quantities such as correlation functions with respect to this distribution. Finally, this reformulation lends itself well to the case of non-Gaussian distributions. We illustrate this by computing the expected radius of gyration of a ring polymer in a wide variety of models.
format Preprint
id arxiv_https___arxiv_org_abs_2001_11709
institution arXiv
publishDate 2020
record_format arxiv
spellingShingle Factoring the Laplacian to understand topological polymers
Cantarella, Jason
Deguchi, Tetsuo
Shonkwiler, Clayton
Uehara, Erica
Statistical Mechanics
Probability
82D60 (primary), 60G50, 60D05 (secondary)
A ring polymer is a random walk whose steps obey a single linear condition; their sum vanishes. Factoring the graph Laplacian into the product of the incidence matrix and its transpose allows us to show that for a more complicated network, the steps must lie in a linear subspace determined by the graph topology. This provides a useful new perspective on the James--Guth theory of phantom elastic networks. In particular, we formulate phantom networks which are free from the constraints of fixed crosslinks. For a given network the solution of the loop constraints makes the partition function finite-valued in the path integral formulation without applying any external forces or fixing any monomer positions. The resulting probability distribution on edge displacements is rotationally invariant, which is practically quite useful for generating unbiased random samples of edge displacements and monomer positions. Furthermore, one can exactly calculate many physical quantities such as correlation functions with respect to this distribution. Finally, this reformulation lends itself well to the case of non-Gaussian distributions. We illustrate this by computing the expected radius of gyration of a ring polymer in a wide variety of models.
title Factoring the Laplacian to understand topological polymers
topic Statistical Mechanics
Probability
82D60 (primary), 60G50, 60D05 (secondary)
url https://arxiv.org/abs/2001.11709