# Length-dependent residence time of contacts in simple polymeric models

Source: [Length-dependent residence time of contacts in simple polymeric models](<https://www.sota2.com/research/paper/68fa48ce1e209131ce93253e>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T07:01:28.638Z

Authors: E. Marchi, G. Tiana

Published: 2024-12-18T07:29:57.000Z

## Abstract

Starting from the reported experimental evidence that the residence time of contacts between the ends of biopolymers is length dependent, we investigate the kinetics of contact breaking in simple polymer models from a theoretical point of view. We solved Kramers equation first for an ideal chain and then for a polymer with attracting ends, and compared the predictions with the results of molecular dynamics simulations. We found that the mean residence time always shows a power--law dependence on the length of the polymer with exponent $-1$, although is significantly smaller when obtained from the analysis of a single trajectory than when calculated from independent initial conformations. Only when the interaction is strong (\>\>kT) and the interaction range is small (of the order of the distance between consecutive monomers) does the residence time converge to that of the Arrhenius equation, independent of the length. We are able to provide expressions of the mean residence time for cases when the exact definition of contact is not available a priori, expressions that can be useful in typical cases of microscopy experiments.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2412.13563>)

[PDF](<https://arxiv.org/pdf/2412.13563.pdf>)
