End-to-end length of a stiff polymer

Similar documents
There are self-avoiding walks of steps on Z 3

Scaling Theory. Roger Herrigel Advisor: Helmut Katzgraber

From Rosenbluth Sampling to PERM - rare event sampling with stochastic growth algorithms

Rare event sampling with stochastic growth algorithms

8.3.2 The finite size scaling method

Polymer Simulations with Pruned-Enriched Rosenbluth Method I

Jacob Klein Science 323, 47, p. 2

arxiv: v1 [cond-mat.stat-mech] 8 Feb 2013

Polymer solutions and melts

Structure Analysis of Bottle-Brush Polymers: Simulation and Experiment

3 Biopolymers Uncorrelated chains - Freely jointed chain model

A mathematical model for a copolymer in an emulsion

Phys 450 Spring 2011 Solution set 6. A bimolecular reaction in which A and B combine to form the product P may be written as:

Amorphous Polymers: Polymer Conformation Laboratory 1: Module 1

Monte Carlo Simulation of the 2D Ising model

arxiv:math/ v1 [math.pr] 21 Dec 2001

Statistical Thermodynamics Exercise 11 HS Exercise 11

Appendix C - Persistence length 183. Consider an ideal chain with N segments each of length a, such that the contour length L c is

Physica A. A semi-flexible attracting segment model of two-dimensional polymer collapse

Investigation of Possible Biases in Tau Neutrino Mass Limits

Small worlds, mazes and random walks

Swelling and Collapse of Single Polymer Molecules and Gels.

ICCP Project 2 - Advanced Monte Carlo Methods Choose one of the three options below

Multiple Markov chain Monte Carlo study of adsorbing self-avoiding walks in two and in three dimensions

Systems of Linear ODEs

S(l) bl + c log l + d, with c 1.8k B. (2.71)

General Construction of Irreversible Kernel in Markov Chain Monte Carlo

Coarse-Grained Models!

Part III: A Simplex pivot

Proteins polymer molecules, folded in complex structures. Konstantin Popov Department of Biochemistry and Biophysics

1. Introductory Examples

3 Polynomial and Rational Functions

On self-organised criticality in one dimension

Critical Phenomena and Percolation Theory: II

Ω = e E d {0, 1} θ(p) = P( C = ) So θ(p) is the probability that the origin belongs to an infinite cluster. It is trivial that.

SEMELPAROUS PERIODICAL INSECTS

Modeling diffusional transport in the interphase cell nucleus

CARBON NANOTUBE-POLYMER COMPOSITES: AN OVERVIEW Brian Grady University of Oklahoma

Advanced Monte Carlo Methods Problems

Random walks. Marc R. Roussel Department of Chemistry and Biochemistry University of Lethbridge. March 18, 2009

PHYSICS 653 HOMEWORK 1 P.1. Problems 1: Random walks (additional problems)

Microscopic Deterministic Dynamics and Persistence Exponent arxiv:cond-mat/ v1 [cond-mat.stat-mech] 22 Sep 1999

The Phase Transition of the 2D-Ising Model

Polymers in a slabs and slits with attracting walls

From Random Numbers to Monte Carlo. Random Numbers, Random Walks, Diffusion, Monte Carlo integration, and all that

V = 2ze 2 n. . a. i=1

Chapter 7. Entanglements

Diffusion constant for the repton model of gel electrophoresis

Convergence Rate of Markov Chains

Monte Carlo Simulations of the Hyaluronan-Aggrecan Complex in the Pericellular Matrix

V(φ) CH 3 CH 2 CH 2 CH 3. High energy states. Low energy states. Views along the C2-C3 bond

Cover times of random searches

2.4 DNA structure. S(l) bl + c log l + d, with c 1.8k B. (2.72)

A simple algorithm that will generate a sequence of integers between 0 and m is:

Olle Inganäs: Polymers structure and dynamics. Polymer physics

Transitions of tethered polymer chains: A simulation study with the bond fluctuation lattice model

Introduction. Model DENSITY PROFILES OF SEMI-DILUTE POLYMER SOLUTIONS NEAR A HARD WALL: MONTE CARLO SIMULATION

Physics 562: Statistical Mechanics Spring 2002, James P. Sethna Prelim, due Wednesday, March 13 Latest revision: March 22, 2002, 10:9

CRITICAL BEHAVIOUR OF SELF-AVOIDING WALK IN FIVE OR MORE DIMENSIONS

Chapter Five Notes N P U2C5

Mean end-to-end distance of branched polymers

18.01 Single Variable Calculus Fall 2006

Chapter 13 - Inverse Functions

Absolute Entropy of a 2D Lattice Model for a Denatured Protein

8.592J HST.452J: Statistical Physics in Biology

A Monte Carlo simulation study of branched polymers

arxiv:cond-mat/ v1 [cond-mat.stat-mech] 7 Aug 1997

Magnetic tweezers and its application to DNA mechanics

3D HP Protein Folding Problem using Ant Algorithm

Polymer Solution Thermodynamics:

hep-lat/ Dec 93

Lilypad Percolation. Enrique Treviño. April 25, 2010

Quasi-Stationary Simulation: the Subcritical Contact Process

Lecture V: Multicanonical Simulations.

Van der Waals Fluid Deriving the Fundamental Relation. How do we integrate the differential above to get the fundamental relation?

Announcements. Homework 3 (Klaus Schulten s Lecture): Due Wednesday at noon. Next homework assigned. Due Wednesday March 1.

3.320 Lecture 18 (4/12/05)

MSM120 1M1 First year mathematics for civil engineers Revision notes 4

LECTURE 10: Monte Carlo Methods II

PHYSICS 107. Lecture 5 Newton s Laws of Motion

PHASE TRANSITIONS IN SOFT MATTER SYSTEMS

MA 0090 Section 21 - Slope-Intercept Wednesday, October 31, Objectives: Review the slope of the graph of an equation in slope-intercept form.

A Monte Carlo study of non-trapped self-avoiding walks

Final Exam A Name. 20 i C) Solve the equation by factoring. 4) x2 = x + 30 A) {-5, 6} B) {5, 6} C) {1, 30} D) {-5, -6} -9 ± i 3 14

WEEK 7 NOTES AND EXERCISES

Phys 243 Lab 7: Radioactive Half-life

Lab 11. Spring-Mass Oscillations

Physics 509: Bootstrap and Robust Parameter Estimation

B. Linear equations can be written in the form y = mx+b or f(x) = mx+b. which is called: Or Ax + By = C which is called:

Universality class of triad dynamics on a triangular lattice

4.1 Inverse Variation Models

Chapter 1- Polynomial Functions

Numerical Analysis of 2-D Ising Model. Ishita Agarwal Masters in Physics (University of Bonn) 17 th March 2011

Chapter 10. Optimization Simulated annealing

Existence of four-dimensional polymer collapse I. Kinetic growth trails

Phase Transition in a Bond. Fluctuating Lattice Polymer

Markov Chain Monte Carlo The Metropolis-Hastings Algorithm

Week #1 The Exponential and Logarithm Functions Section 1.2

MATH 56A: STOCHASTIC PROCESSES CHAPTER 2

8 Error analysis: jackknife & bootstrap

Transcription:

End-to-end length of a stiff polymer Jellie de Vries April 21st, 2005 Bachelor Thesis Supervisor: dr. G.T. Barkema Faculteit Btawetenschappen/Departement Natuur- en Sterrenkunde Institute for Theoretical Physics

Contents 1 Introduction 2 2 Theory 3 2.1 Scaling of random and self avoiding walks............. 3 2.2 Thermalization............................ 3 3 Methods 6 4 Results 8 5 Conclusion 10 1

1 Introduction Polymers are long chains of repeating parts, called monomers. We encounter polymers every day. We eat polymers like proteins and we have them in our body for instance in the form of DNA. Those polymers are found in nature and are therefore called biopolymers. Another group of polymers is called synthetic polymers, often referred to as plastics. These polymers are made with controlled chemical reactions. This research is done on the behavior of polymers. Polymers can behave like self avoiding walks, twisting and turning in random directions, but never visiting the same spatial location more than once. This sounds trivial, since no two monomers can be at the same place in time, because they have dimensions. That is true, but under different circumstances a polymer can behave like a random walk, which in simulations means that two monomers are allowed on the same position in space. But what happens when a polymer is stiff, so it cannot bend so easy and find its own tail? It is self avoiding, but it might show random walk behavior if the polymer is stiff enough and not infinitely long, since the probability of two monomers visiting the same position is very small. This research is about what exactly happens for long and short polymers with varying stiffness. 2

2 Theory 2.1 Scaling of random and self avoiding walks The most important relation for this research, is the scaling of the mean squared end-to-end length r 2 e(n) of different types of polymers. We will consider stiff self avoiding walks, which we will compare to equally stiff random walks to find out what the behavior of stiff polymers looks like most. The dependence of the mean squared end-to-end length from the length of the polymer (N) looks like: - random walk: r 2 e(n) N; (1) - self avoiding walk: r 2 e (N) N2ν, (2) in which ν 0.588 [1]. Another important concept is the persistence length l p. The persistence length is a quantity that tells something about the correlation in the orientation of the polymer. It is usually defined as the distance along the polymer after which this correlation has decayed to 1/e. This definition is hard to use in the case of lattice polymers, due to discretization effects. We therefore use another approach to define the persistence length. The mean squared end-to-end length of an ordinary random walk, making N steps of size b, is equal to r 2 e (N) = N b2. (3) If the random walker does not make steps in uniformly random directions, but has a bias in favor of steps continuing in the same direction, its squared length r e 2 (N) will increase. To quantify this, we identify which ordinary random walker making Ñ steps of size b has the same expected end-to-end length: and the same contour length: r 2 e (N) = Ñ b 2. (4) Nb = Ñ b. (5) we will call the ratio of b and b the persistence length (expressed in units of b): l p = b/b = r e(n) / r 2 e(n). 2 (6) 2.2 Thermalization Before starting any real measurements, thermalization is required. This is necessary to make sure that the first configuration of measurement already satisfies the above equations. This means there should not be any correlation between the initial configuration and the configuration of the first measurement. Therefore, the thermalization time should exceed the correlation time. For good measurements it is important that the thermalization is long enough. In literature [3] we find that, for the pivot algorithm, which we used in our simulations, and which is described in the next section, the minimal thermalization time scales with N divided by the acceptance probability. The acceptance 3

probability in this case is defined by the acceptance due to self avoidance and stiffness. Since the acceptance probability wasn t measured in the simulation used, another way to reach a similar result is used. This uses the following relation: r t r t = ae t/τ r t = r t + ae t/τ, (7) in which r t = r i+2 r i t, a is a constant and τ is the correlation time. At t = 0, r t is 2, so r t at t = 0 is equal to r t + a is 2. This leads to r t = 2 a(1 e t/τ ). (8) 4

2 Waarden uit simulatie Fit 2-a*(1-exp(-t/tau)) 1.95 1.9 1.85 < r_(i+2)-r_i > 1.8 1.75 1.7 1.65 1.6 0 10000 20000 30000 40000 50000 60000 70000 80000 90000 100000 Figure 1: Result from fitting equation 8 for N = 10 4. The fit converges for a = 0.35 and τ = 2.6 10 4 t Plotting r t as a function of t and fitting equation (8) gives a correlation time τ. The result for N = 10 4 and l p = 2 is plotted in figure 1. The result for the thermalization time is 2.6 10 4. To make sure that the thermalization is long enough, we take at least five or six times τ. So in the case of figure 1 thermalization should be about 1.5 10 5 steps. 5

3 Methods To find out how polymers behave, computer simulations were performed of polymers on a cubic lattice, using the pivot algorithm [4]. The pivot algorithm does the following. Take an initial configuration, randomly select a monomer and rotate one side of the polymer around that monomer, over 90 or 180 degrees in a random direction. This gives a new polymer configuration. 4 5 9 3 6 7 8 1 2 8 9 Figure 2: An example of the pivot algorithm. Here, monomer 7 is the pivot, around which one of the tails is rotated. The numbers 8 and 9 stand for the positions of monomers 8 and 9 after the rotation. Self avoidance is built in by checking, for every step, if the places where the monomers will be after rotation are occupied by the ones that remain on their original position. If this is the case, the configuration is rejected and a new random monomer and a new direction of rotation is chosen. To simulate the stiffness of a polymer, a certain dislike to bend is built in. When the polymer configuration immediately around the pivot changes from straight to a ninety degree angle, the configuration is only accepted with a probability p < 1. The parameter p has a relation with the persistence length. If the polymer configuration changes in the other direction or changes from one angle to another, the only condition for acceptance of the configuration is self avoidance. The relation between the parameter p and the persistence length can be found in the following way. From equations (3) and (6) we know that for long random walks l p = re 2 (N) /N. (9) For a random walk in which 180 degree angles are not allowed the mean squared end-to-end length re 2 (N) can be calculated theoretically using r 2 e(n) = N 1 i=0 N 1 j=0 q i j = N(1 + q)(1 q) 2q(1 qn ) (1 q) 2, (10) where q = 1/(1 + 4p) is the probability that the polymer goes to a straight configuration immediatly around the pivot. For large N, this becomes r 2 e(n) = N(1 + q)(1 q) (1 q) 2 = N(1 + q). (11) 1 q 6

This, in combination with equation (9) leads to l p = 1 + q 1 q. (12) As initial configuration a straight polymer was chosen. After thermalization, measurements for the mean squared end-to-end length were started. Measurements are done for several persistence lengths in the range of 1.5 to 26 and polymer lengths from 10 to 5 10 4 monomers. 7

4 Results There are several ways to plot the results of the measurements. Here we chose to plot the ratio of the mean squared end-to-end length of the self avoiding walk with persistence length l p, and that of a random walk with the same persistence length (equation (10)) against the length of the polymer. This is done in a double-logarithmic plot, to be able to get useful information from the slopes of the lines (figure 3). In a plot like this a horizontal line comes from a polymer that behaves like a random walk. The line with persistence length 1.5 is a normal self avoiding walk. 5 4 persistence length 1.5 persistence length 1.67 persistence length 2 persistence length 3 persistence length 6 persistence length 11 persistence length 26 ratio of SAW and RW length 3 2 1 10 100 1000 10000 100000 polymer length (N) Figure 3: Ratio of the mean squared end-to-end length of a self avoiding walk with persistence length l p, and that of a random walk with the same persistence length, for several values of l p. The top curve is a normal self avoiding walk. All curves seem to approach a line with the same slope as the top curve for longer polymers. The larger the persistence length, the longer the polymer has to be, before it behaves like a self avoiding walk. Knowing this we can look for a way to collapse all the curves onto one curve. It turns out that this can be done by dividing the length of the polymer by its persistence length to the power three on the horizontal axis (figure 4). 8

5 4 persistence length 1.5 persistence length 1.67 persistence length 2 persistence length 3 persistence length 6 persistence length 11 persistence length 26 ratio of SAW and RW length 3 2 1 1e-04 0.001 0.01 0.1 1 10 100 1000 10000 rescaled polymer length Figure 4: Same as figure 3, except that the polymer length is divided by l 3 p. Note that all graphs are close to one general curve. 9

5 Conclusion From figure 3 we see that the behavior of stiff polymers depends on their length. Short, very stiff polymers behave almost like a random walk. But the longer they become, the more they behave like self-avoiding walks. From the collapse in figure 4 and equations (1) and (2) the following relation can be derived for r 2 e(n) SAW / r 2 e(n) RW : r 2 e (N) SAW/ r 2 e (N) RW = ([(N/l 3 p )2ν 1 ] α + 1 α ) 1/α, (13) in which the part between straight brackets on the right hand site of the equation describes self avoiding walk behavior and the other part the random walk behavior. The parameter α says something about the way the curve changes from random to self avoiding behavior; this parameter has not been studied here. For (N/l 3 p )2ν 1 1 the random walk behavior will dominate and for bigger values of (N/l 3 p )2ν 1 the behavior will be mainly self avoiding. 10

References [1] Monte Carlo Simulation of Lattice Polymer Models, G.T. Barkema, unpublished. [2] Scaling properties of stiff polymers in a good solvent, G.T. Barkema, unpublished. [3] Critical Exponents, Hyperscaling, and Universal Amplitude Ratios for Twoand Three-Dimensional Self-Avoiding Walks, Bin Li, Neal Madras and Alan D. Sokal, 1994 [4] N. Madras and A.D. Sokal, J. Stat. Phys. 50, 109 (1988). The pivot algorithm was invented in 1969 by Lal. [5] http://en.wikipedia.org/ 11