Pith. sign in

REVIEW

Computation of the Mean First-Encounter Time Between the Ends of a Polymer Chain

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1312.6041 v1 pith:SSMGPRG6 submitted 2013-12-20 cond-mat.stat-mech

Computation of the Mean First-Encounter Time Between the Ends of a Polymer Chain

classification cond-mat.stat-mech
keywords timefirstmeanendsmfetpolymerbrownianencounter
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Using a novel theoretical approach, we study the mean first encounter time (MFET) between the two ends of a polymer. Previous approaches used various simplifications that reduced the complexity of the problem, leading, however to incompatible results. We construct here for the first time a general theory that allows us to compute the MFET. The method is based on estimating the mean time for a Brownian particle to reach a narrow domain in the polymer configuration space. In dimension two and three, we find that the MFET depends mainly on the first eigenvalue of the associated Fokker-Planck operator and provide precise estimates that are confirmed by Brownian simulations. Interestingly, although many time scales are involved in the encounter process, its distribution can be well approximated by a single exponential, which has several consequences for modeling chromosome dynamics in the nucleus. Another application of our result is computing the mean time for a DNA molecule to form a closed loop (when its two ends meet for the first time).

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.