• Aucun résultat trouvé

Irreversible Growth Algorithm for Branched Polymers (Lattice Animals), and Their Relation to Colloidal Cluster-Cluster Aggregates

N/A
N/A
Protected

Academic year: 2021

Partager "Irreversible Growth Algorithm for Branched Polymers (Lattice Animals), and Their Relation to Colloidal Cluster-Cluster Aggregates"

Copied!
16
0
0

Texte intégral

(1)

HAL Id: jpa-00247189

https://hal.archives-ouvertes.fr/jpa-00247189

Submitted on 1 Jan 1996

HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci- entific research documents, whether they are pub- lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers.

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

Irreversible Growth Algorithm for Branched Polymers (Lattice Animals), and Their Relation to Colloidal

Cluster-Cluster Aggregates

R. Ball, J. Lee

To cite this version:

R. Ball, J. Lee. Irreversible Growth Algorithm for Branched Polymers (Lattice Animals), and Their

Relation to Colloidal Cluster-Cluster Aggregates. Journal de Physique I, EDP Sciences, 1996, 6 (3),

pp.357-371. �10.1051/jp1:1996161�. �jpa-00247189�

(2)

Irreversible Growth Algorithm for Branched Polymers (Lattice Animais), and Their Relation to Colloidal Cluster-Cluster

Aggregates

R-C- Bali

(*)

and J-R- Lee

Theory

of Condensed Matter, Cavendish

Laboratory, Madingley

Road,

Cambridge,

CB3 OHE,

England

(Received

19 October 1995,

accepted

28

November1995)

PACS.61Al.+e

Polymers, elastomers,

and

plastics

PACS.61.43.Hv Fiactals;

macroscopic

aggregates

PACS.05.70.Ln

Nonequilibrium thermodynamics,

irreversible processes

Abstract. We prove that a new, irreversible growth

algorithm,

Non-Deletion Reaction- Lim- ited Cluster-cluster

Aggregation (NDRLCA), produces equifibmum

Branched

Polymers, expected

to exhibit Lattice Animal statistics

iii.

We

implement NDRLCA, off-lattice,

as a computer sim- ulation for

embedding

dimension d

= 2 and 3,

obtaining

values for critical exponents, fractal dimension D and cluster mass distribution exponent T: d

= 2, D m 1.53 + 0.05, T = 1.09 + 0.06;

d = 3, D = 1.96 + 0.04, T = 1.50 + 0.04 in

good

agreement with theoretical LA values. The simulation results do not support recent

suggestions

[2] that BPS may be m the

same

universahty

class as

percolation.

We also obtain values for a

model-dependent

critical

"fugacity",

zc and in-

vestigate

the finite-size effects of our simulation,

quantifying

notions of

"inbreeding"

that occur in this

algonthm. Finally

we use an extension of the NDRLCA

proof

to show that standard Reaction-Limited Cluster-cluster

Aggregation

is very

unhkely

to be in the same

universality

class

as Branched

Polymers/Lattice

Animals unless the backbone dimension for the latter is

considerably

less than the

published

value.

1. Introduction

In this paper we

investigate

the

relationship

between the ensemble of cluster

configurations

formed

by

irreuersible

pair-wise aggregation (such

as observed in dilute colloidal

dispersions),

and the

eq~tiiibri~tm

ensemble of branched

polymers.

Dilute-limit branched

poiymers

in a

good

solvent may be

thought

of as clusters in

equilibrium

with

respect

to

exchange

of monomers and

rearrangement

of structure,

subject

to exduded volume

constraints,

but so well

separated

from each other that inter-cluster interactions may be

neglected. Off-lattice,

the chance in this ensemble of

exactly closing

a

loop

is of measure zero. Two

important

universal

exponents

for this

problem

are the fractal dimension of the

dusters, D,

and the

exponent,

T, in terms of which the ci~tster size distrib~ttion is

expected

to be of form:

CN

+~

Y~N~~ (1)

(*)

Author for

correspondence (e-mail: rcbl©phy.cam.ac.uk)

Q

Les

Éditions

de

Physique

1996

(3)

358 JOURNAL DE

PHYSIQUE

I N°3

where N is the duster size and y

depends

on

system

details.

The ensemble of Lattice Animals

(LA'S)

is obtained

by disregarding

the

multiplicity

of

possible

connectivities with which on-iattice BP'S

(Lattice Trees)

may be identified as a tree.

It has

long

been

accepted

that dilute BP'S and LA'S are in the same

universality

Mass.

Lubensky

and Isaacson [1]

computed

values for LA critical exponents in an e

expansion

about d~ = 8.

Parisi and Sourlas [3] demonstrated a

relationship

between the

Lee-Yang edge singularity

of the

Ising

model in d 2 dimensions and dilute-limit branched

polymers

in d dimensions and

hence

derived,

from the exact solution of the

former,

T

= 1

(but

no value for

D)

in d

=

2,

and

T =

3/2,

D

= 2 in d

= 3. A renormalisation group

approach by

Derrida and De Seze [4]

gives

D m

1.56,

in d

=

2;

there is evidence [5] that lattice animals are not

conformally

invariant.

Reaction-Limited Cluster-duster

Aggregation

is a

growth

nlodel in which all

geometrically possible

bonded

configurations

between

pairs

of dusters are

equally likely

and

sampled

in

an irreversible sequence. It is

physically

motivated

by

colloidal

aggregation

under conditions where the

probability

of two clusters

joining

upon contact is very

low,

so there is no

significant favouring

of

configurations

most

likely

to occur first

during

a duster-duster encounter. It has

long

been

speculated

that RLCA and LA'S share sortie critical exponents. This is

partly

nlotivated

by

the convergence of

RLCA,

LA'S and BP'S for d < d~ = 8 to give

Flory-Stocknlayer

clusters with D

= 4 and T

=

5/2.

Ball et ai. [6] have looked at RLCA kinetics via the Smoluchowski rate

equation

for duster

mass

populations, CN(t):

~

CN(t)

=

~j K(P, Q)CpCQ CN ~j K(N, P)Cp (2)

~~ ~

P+Q=N P

where the rate kemel is

argued

to be of form:

K(P, Q)

m~

P~

for

Q

m P

(3)

K(P, Q)

+~

PQ~~~

for P >

Q (4)

and for > 1 the mass distribution is

expected

to be of form:

CN

~

N~~

(5)

They argued

for a value of =1 in d

=

3,

for which the Smoluchowski

equation gives

T =

3/2 (in

the absence of subdominant terms in the kernel to which the solution is now

thought

to be

sensitive

[7-9] ), nlatching

BP'S. In RLCA simulation for d

= 3 on

lattice,

Brown and Ball

[10]

find = 1.06 + 0.02 and D

= 2.1+

0.03,

whilst Meakin and

Fanlily [11]

report = 1.12 and

T m 1.69 for off-lattice RLCA simulation

Experiments

on the RLCA of real aqueous

gold

colloids [12] gave D

= 2.02 + o-1 and T

= 1.5 +

0.2,

but in other

systems

[13]

higher

values of

T and kinetics

equivalent

to

= 0 have been

reported.

In Section

2,

we present an

analytic argument,

based on the Smoluchowski rate

equation [14],

which proves that a

growth algorithm

which is

dosely

related to RLCA

produces equilibrium

BP'S. Dur

algorithnl

is one of irreversible

pair-wise, reaction-limited,

cluster-duster aggrega- tion in

which, however,

the

parents

of a new duster are not deleted from the

sample;

NDRLCA

(Non-Deletion RLCA).

In Sections 3 and

4,

a numerical simulation is

presented

and

good

agree-

ment with BP exponents is found. In Section

5,

we discuss the time-scale of the simulations

by studying

the

"fugacity"

as it

approaches

critical. Finite-size

effects,

characterised as "inbreed-

ing"

and

arising

from the

returning

of parent clusters to the

sample,

are

analysed

in Section 6.

Finally,

in Section

7,

we discuss whether the standard RLCA model and BP'S are in the same

universahty class,

and conclude that

they

almost

certainly

are not.

(4)

2. A New Proof that

Polydisperse

RLCA without

Deletion, NDRLCA,

Gives Branched

Polymers

The model under consideration

here, NDLRCA,

is

irreversible, polydisperse

reaction-hmited cluster-duster

aggregation

in which the

parent

clusters which go to

produce

a new child cluster continue to exist thereafter as

independent

clusters witliin the

sample.

Hence the amount of

matter present is not constant as in standard

RLCA,

but increases with time. Here we show

that such a model follows

directly

from a

simple

charactensation of branched

polymers.

Consider the number of

dusters, CM,

as a function not

just

of their size N but rather as

a function of their full

geometry tif,

for the

equilibrium problem

of branched

poiymers:

up to some normalisation

conventions, CM

must be either 1 or 0 as the

configuration tif

is either allowed or not. Consider now

counting

all of the ways in which a duster of N atoms can be broken into two

fragments:

since it will be held

together by precisely

N bonds or nearest

neighbour connections,

this

gives:

(N 1)Cw

=

~j K(P, Q)CpCQ (6)

P+Q=tif

where the

right-hand

side of the

equation

counts the same

quantity

in terms of the

possible

ways of

assembling

duster

tif

from two

fragments.

The

kernel, K(P, Q),

is the number of ways that dusters of

geometry

P and

Q

can

join

to form a duster of

geometry

P +

Q

=

tif.

Specified

here at the level of detailed duster

geometries,

this kernel is identicai to that

governing

the

corresponding description

of RLCA

(see below, equation (9)).

The condition P +

Q

"

tif requires, amongst

other

things,

that the masses are matched as P +

Q

= N. As a

result,

the

equation

above is invariant under the transformation

CM

-

(y'/y)~Cw, confirming

that the

duster mass distribution of branched

polymers

is

only

universal up to a factor of

g~

Consider now a different

generalisation

of the cluster numbers defined as:

Ww(z)

=

z~-~ Cv (7)

where z is in effect an extra

fugacity

factor associated with each of the

(N 1)

bonds in the duster.

Differentiating

and

substituting CM

from

(equation (6)) gives:

)Ww(z)

=

£ KIF, Q)Wp(z)WQ(z) 18)

This is akin to the Smoluchowski rate

equation

less the deletion term, if we think of z as

analogous

to a time. The

analogous

and exact

equation

of evolution for RLCA is:

(Cwlt)

=

~j Kli', Q)Cp (t)Colt) 2Cwlt) ~j K(tif, i')Cp lt) (9)

where the

differing

factor

of1/2

is an

insignificant

matter of convention here.

The

important point

is that

equation (8)

defines a stochastic process with "time" z which

we can

implement, by analogy

with

RLCA,

as an irreversible duster

aggregation

model. The absence of the deletion terms

(which

in RLCA

give

mass

conservation)

means that the model must be as RLCA

e~cept

that when two

(parent)

dusters succeed in

aggregating,

their child cluster is added to the

sample

without the

parents

themselves

being

removed. The value of z in the simulation can be

simply tracked,

as discussed in Section 5. Note that

given

the

expected

(5)

360 JOURNAL DE

PHYSIQUE

I X°3

form of the cluster size distribution for

equilibrium

branched

polymers (Eq. (1)),

the

analogous z-dependent quantity

behaves at

large

N as:

WN(z)

m N~~ ~

...(10) (10)

zc~~

where the critical value of z is given

by

zc =

~.

Strictly speaking,

the discussion above starts from the

(infinite)

ensemble of branched

poly-

mers and maps this onto a

growth

model for a

time(z)-dependent

ensemble. In

practice

we

can

implement

the

growth

model

numerically only

on a finite

sample,

the members of which must not become too correlated with each other if the results are to be a fair

sampling

of the ensemble. This is an

increasingly

severe constraint with

increasing

time due to

dusters,

as parents,

spawning dosely

related

children,

which we

quantify

below under

"inbreeding".

3.

Computer

Simulation of Irreversible

Polydisperse

NDRLCA

The

starting point

is a

sample

of M atoms each of which is a cluster of size 1. These

single-atom

clusters are

aggregated

to form further clusters of atoms of fixed

geometry.

The

original single-

atom clusters will be referred to as monomers. To

sample

with

equal probability

all

possible

ways of

joining

two

clusters,

we choose at random two atoms and

place

them in contact in a random direction.

0nly

if this results in no

overlap

between any of the atoms of the two associated dusters

(parents)

is the

attempted aggregation accepted.

In this case the new

(child)

cluster is created with new atoms which are

duplicates

of those of the two

parent

dusters. The

two

parent

dusters and their atoms remain in the

sample,

which is the

only

difference between this model and RLCA.

In a finite

sample

it is necessary to decide to what extent a duster can

aggregate

with itself

(or

indeed clusters related to it discussed under

"inbreeding",

Sec.

6);

we disallowed

only aggregation

of a duster with its identical self. Because our simulations were limited

by

available store rather than

time,

we stored dusters

implicitly

that

is,

in terms of which two

parent

dusters a

given

chiid cluster had been born from and how the two

parents

had been

joined.

This reduces the

storage requirement

to of order the number of

dusters,

rather than of order the total number of atoms. To test

possible aggregation

events we therefore had to

build the atom lists of the parent dusters

by going through

this data

recursively.

This costs

only

of order ni + n2 where ni and n2 are the masses of the

parent dusters,

but with

large

coefficient. To test for

overlap,

we searched for

pairs

of atoms, one from each

duster,

doser than

unity separation:

this costs of order nin2, but was somewhat

mitigated by checking

first for

overlaps

between atoms close in the duster atom lists to the pair of atoms

being joined.

Values for

calculating

radius of

gyration

statistics and mass distribution were stored. In addition values for the

following quantities

were recorded at

regular

intervals: total number of

attempts

made to

join clusters,

total number of clusters

formed,

and the

f~tgac~tg~

z

(see

Sec.

5).

A further

quantity

that was recorded was

inbreeding, Xcju~,

a measure of the extent

of common

parentage

in clusters

being

created.

Aggregation

was

stopped

when the a,~erage

inbreeding

of the last hundred dusters exceeded a given value. We report results from three data sets, shown in Table 1.

4. Simulation Results

Results for the radius of

gyration

vs. duster size show dear power law

scaling, RN

+~

A~~/~,

where D is a fractal dimension.

Figure

1 shows

In[RNÎ

vs.

ln[N] plots

for d = 2 and 3. A

(6)

Table I. Data sets

for

NDRLCA sim~tiations.

set

embedding

number initial number of average

inbreeding

dimension,

d monomers, m additional dusters of last 100 dusters

2 4.660 x

3 5 x 8.100 x

3 x

+

o

+

O 2 3 4 S 6 7 8

lniNi

Fig.

1.

Average

radius of gyration vs. cluster size for NDRLCA clusters:

(o)

two dimensions

(set 2d.1); (+)

three dimensions

(set 3d.1) (see

Tab. I for set

details).

The fines drawn have slopes:

1ID

= 0.65 for d

= 2 and

1ID

= 0.51 for d

= 3.

gradient equivalent

to D

= 1.96 + 0.04 is

dearly

seen between

In[N]

m 2 and

In[N]

m

7,

consistent with the

expected

value of D

= 2 obtained from field theoretic considerations

[3].

The

large

number of dusters available for each data

point helps

to

keep

random fluctuations down to

insignificant

levels. In two

dimensions,

from renormalisation

theory [4],

we expect the

fractal dimension to be D m 1.56. The

gradient

measured between

In[N]

m 2 and

In[~T]

m 6.5 is

equivalent

to D

= 1.53 +

0.05,

in

good agreement

with this.

The cluster size distribution is more dillicult to

analyse,

not least because we expect the power law to be

heavily weighted by

an

exponential

tail for

large

N or short time as

CN

"

N~~(z/zc)~. Figure

2 is the

log-log plot

of duster size distribution for d

= 3 using set 3d.1.

It exhibits the

expected scahng

of T

= 1.50 + 0.04

(theoretical

T

=

I.à, [3])

for the "dose

to

equilibrium"

state of the system, up to

In[N]

m 5. Note that a cut-off size of N

= 1000

was introduced for this set to save on computer time

ii-e-

all dusters

exceeding

N

= 1000

were

discarded).

This cut-off should not affect statistics of N <

1000,

as

clearly

no smaller cluster may be made from a

larger

one, but it does mean, in

principle,

that z can evolve

past

zc.

Figure

2 shows the time evolution of the distribution as z increases ~vith time.

Figure

3 addresses the two dimensional case

(set 2d.1)

where we obtain

scaling

close to that

predicted,

(7)

362 JOURNAL DE

PHYSIQUE

I N°3

+

O

Fig.

2. Cluster size distribution vs. cluster size for NDRLCA in three dimensions

(set 3d.1),

evolving

m "time" towards critical

fugacity,

zc. Initial monomers, m

= 5 x 10~

were used. Successive

plots

alternate

symbols

for

clarity.

From left to

right

each

graph

has m 10~

more clusters

represented

than the last. Left most 10~ extra clusters;

right

most 8.1 x 10~ extra clusters. Sohd line has

gradient

-T = -1.5.

o

+ +

+ +

+

+ +

+

+

+

+

f

+

)

~

2 3 4 5 6 7 8

lnfNJ

Fig.

3. Cluster size distribution

vs. cluster size for NDRLCA in two dimensions

(set 2d.1), evolving

m "time" towards critical

fugacity,

zc. Initial monomers, m = 10~

were used. Successive

plots

alternate

symbols

for

clanty.

From left to

right

each

graph

has m 10~

more clusters

represented

than the last.

Left most 10~ extra clusters;

nght

most 4.66 x 10~ extra clusters. Solid fine has

gradient

-T = -1.09.

(8)

T = 1.09 + 0.06

(theoretical

T =

1,

[3] for the hnear section of the

graph

closest to

equilibrium.

The power law

approximation

appears to be valid out to

In[N]

m 5

again,

which is well before the

point

where cluster

inbreeding, X~jus (N)

exceeds

15%.

5.

Measuring Fugacity-Theory

and Results

In this section we consider the

relationship

between the model

system

"time" scale as measured

by fugacity,

z, as it appears in

equation (8)

and the "real" simulation time scale as measured

by

the number of

attempts

made to

join

two dusters

together

to form a new one. An

understanding

of the role of

fugacity

in the

dynamical system

and some

knowledge

of

scaling

of

(z z~)

close to z~ is useful in

interpreting

the results.

First let us consider the evolution of the total cluster

numbers, WTOT(z), (from Eq. (8)):

dlwToTlz))

= dz

~j Kli', Q)Wplz)Wolz) (11)

Now

assuming

that the cluster numbers are normalised so that

Wi

=

1,

then

d(WTOT (z)

=

ds,

where ds is the number of successful

aggregations

pet

original

monomer

during

the interval.

On the other

hand,

we can

compute

the ratio of successful to

attempted

moves as:

~ K(l', Q)Wp(z)Wolz)

)

=

~'~~

~

(12)

where the numerator counts ail the ways in which two dusters can be

successfully aggregated

and the denominator counts the number of ways in which the simulation can

attempt

an

aggregation;

here natm, is the total number of atoms

(per original monomer).

Combining

these two results then

gives

the evolution of the

fugacity

as:

)

"

~&L (13)

where both the nunlber of

attempted

moves a and trie number of

atoms,

natm, are

expressed

per

original

monomer in the

sample.

In terms of unnormalised number of

attempted aggregations,

number of

atoms, Natm,

and the number of

original

monomers,

M,

this grues:

Zsim " M

~ N£ÎJ l14)

attempted aggregations

where we have assumed the initial condition of pure monomer

corresponding

to z = 0.

We now ask how

z

approaches

z~ as the number of

attempted mojej

becomes

large. tope

to z

= z~ the number of atoms varies as: natm m

~

N~~~

~ dN m 1- ~

,

Î zc

zc from

which, using equation (13),

we can

integrate

the number of

attempted

moves:

z 2T-4

a m

/ dz'

~

(15)

0

C~

The

resulting

behaviour

depends

upon how

T compares with

3/2.

For

T <

3/2,

z - z~ as

a - oc and we obtain: z~ z m

(a

+

const.)~~/(3~~~)

for T <

3/2

and z~ z m

exp(-const. a)

for T

=

3/2.

For T >

3/2

the model would reach z~ at finite a

= a*:

z~ z m

(a* a)~/~~~~~~ (16)

(9)

364 JOURNAL DE

PHYSIQUE

I N°3

whereupon

our

expressions

break down and what

happens

in a finite simulation is an open

question.

It would be

interesting

to

explore this,

for

example by considering

the infinite

dimensional case,

equivalent

to

neglect

of

overlap,

where T

= 5

/2

is known for

Flory-Stockmayer

dusters.

There are various ways to arrive at an estimate for z~, if we are able to measure a value of

T. From

equation (10),

note that the

gradient

of the

plot

of

In[Civ(z) N~]

vs. N is given

by:

~~~~~~Î~

~~~~ ~

~~

ÎÎÎ

~~~~

For T <

1.5,

z~ may also be obtained as the

intercept

of a

plot

of z vs. a~P where -p is:

~

(3

2T) ~~~°~ ~~'

~~~~~ ~~~~

From

this,

and a

knowledge

of the value of

z reached in the simulation so

far,

we may obtain

a value for zc.

z~ is

expected

to be invariant with respect to the number of initial monomers, but

depend

on the

embedding dimension,

and this was born out

by

measurement. We obtained:

z~ m 0.371 for d

= 3

and

z~ m 0.497 for d

= 2

using

the methods

represented by equations (17)

and

(18),

as

appropriate.

6. Finite

Sample

Efiects

Inbreeding

and Fluctuation Measurement

Inbreeding

arises

naturally

in our

irrite

non-deletion mortel of RLCA. Whilst a more standard finite deletion mortel may suffer from fluctuations in the mass distribution due to effects such

as run-away

clusters,

our mortel can also suffer from at least two,

possibly serious,

forms of correlation that may affect the statistics.

They

are both based around

counting

the number of times

particular

monomers are used. Recall that the monomers are the

original single-atom

dusters that seed the

simulation,

and

they effectively duplicate

themselves as

they aggregate

with

others,

so that one cluster will

typically

contain many atoms derived from the same

monomer.

The first form of correlation considered is duster

inbreeding, Xcius.

This is the ratio of the number of

distinct, original

monomers

represented

in a

cluster,

mcjus, to the total number of atoms, natcius, in that cluster. Hence

inbreeding, X~jus,

is defined:

Xcius

= 1- '~~crus

~~~~~~~

(i~~

which

gives X~ius

" 0 for a duster size natcius made up of

atoms,

all of which

originate

from

distinct initial monomers, and

Xcju~

- as fewer and fewer distinct monomers are

represented

within the cluster. From this definition we could monitor the average

inbreeding

of the last 100 dusters

produced,

<

X~jus

>ioo, and

stop

the run when this became

greater

than some cut-off

(1%

for d

= 3 and

15%

for d

= 2 simulations used to obtain critical

exponents). Figure

4 shows

X~ju~

vs. duster size, N for t,vo three dimensional sets and a two dimensional set.

~~~ju~ is

important

as it measures the extent to which our

system

is a fair

sample

of the ensemble of branched

polymers. X~ju~

is

typically high

for a cluster that is

produced

from two

(10)

o

o o

*

+ +

o °

~ + ~

o +

~ o + ~

, o

o ~

~ o ù ~

o "

+

~

*

~

w o ~

-~ *

O +

$ f *

~

o

~z *

$ ~

o

o o *

o

+ * ~

+ +

o +

~

*

*

~ o + *

+ *

o

~

Î

O 2 3 4 S 6 7 8

infNJ

Fig.

4. Cluster

inbreeding

vs. cluster size. Cluster

mbreeding,

Xcius

= 1 ~°~~~~ is a measure of

,

natcius

the fairness of

sampling

from the ensemble of BP s

by

our simulation.

(o)

two dimensions

(set 2d.1),

initial monomers m

=10~,

extra clusters grown = 4.66 x 10~;

(*)

three dimensions

(set 3d.1),

initial

monomers m = 5 x 10~, extra clusters grown = 8.10 x 10~j

(+)

three dimensions

(set 3d.2),

initial

monomers m

=10~,

extra clusters gro,vn = 1.759 x10~.

clusters that are

closely

related and of similar size. The chances of

picking

t~vo

similar,

related clusters is much

higher

in our

system,

than if the choice was over the whole ensemble. For this

reason we must be careful that

X~ju~

is not too

high

or our

sample

will be

untrustworthy.

We have also

investigated

a measure of

inbreeding

bet,veen similar sized clusters. For pur- poses of

analysis

the dusters were counted in

bins, loganthmically spaced by

mass. Then to

quantify

the

inbreeding

between all dusters within a size bin we defined

Xbin

in a similar

manner to

X~ju~, except quantities

are now counted over all the dusters in the bin:

~in t i m~in

~

~~~~~n

j~~~

where mbin is the number of distinct monomers used in

constructing

all the dusters that are found in the

bin,

and natbin is the total number of atoms m the bin.

Xbin

measures correlation

across the set of dusters

produced. High Xbin implies

that the dusters within the bin are

similar. The

typical high Xbin creating

event is when a very small duster attaches itself to a

larger

one. Since there is no

deletion,

the bin will now contain one of the parents and the

offspring.

Similar events can continue to occur to these

dusters, heavy

contributions

being

made to

Xb~n,

until a duster

eventually

leaves its

parent's

bin

by being

too

large.

The

problem

is

compounded by large

duster-small duster

pairings being

the most favoured.

Clearly Xbin

and

X~ju~

are related because many

closely-related,

similar-sized

dusters,

as measured

by Xbin,

are

ideal conditions for

creating high

X~ju~ dusters. In

Figure

5 we see that

Xb~n quickly

becomes

large,

for the reasons described above.

By

around

In[N]

m

3.5, Xbin

m

90%

for the m

= 1 x

105

sample.

Xbin

does not, in

itself,

call in to

question

the

fairness

of the

sample

from the ensemble of branched

polymers

that our simulation

represents.

Rather it tells us how many

independent

(11)

366 JOURNAL DE

PHYSIQUE

I N°3

o

O ° ° $ *

+ ~ ~

~ +

O °

+ + ( o

o O

° +

, o

O + o " *

. +

o + o

C

+ o

~

t ~

"

O

~ ~

Î

~ Î

~ S

à

~ O

~M +

,~ O

ÎÉ

$ .

~

o

~

u~~

2 3 4 5 6 7 8

lnfNJ

Fig.

5. Cluster bin

inbreeding

vs. cluster size. Cluster bin

inbreeding,

Xb~n

= 1- ~~~~ is a

natb~n

measure of

inter-dependence

of clusters m a bin.

(o)

two dimensions

(set 2d.1),

m

= 10~, extra clusters grown

= 4.66 X 10~.

(*)

three dimensions

(set 3d.1),

m

= 5

x10~,

extra clusters grown

=

8.10 x

10~, (+)

three dimensions

(set 3d.2),

m

=10~,

extra clusters grown

= 1.759 x 10~.

O

Fig.

6. Cluster size distribution CN vs. cluster size in three dimensions for set:

(+)

set 3d.2:

m =

10~,

extra clusters grown

=

1.759x10~;

error bars calculated from Xb~n

analysis

of

"independence"

of clusters m a bin and modified

by

an

empincal

factor of 4

(see

text for

details).

Sohd fine has

gradient

-T = -1.5.

(12)

Oo~

*..

~°~ag

.

Sao

~

*~~O

~ OO

-~

#

~O~

-

$

O

$

~~ O~

*+

°OOOOOO°°°°~~~

~

*+

Î

~4

~.~~

++

~~~ ~++++~~~

O

* ~

~

Î

~ o

o

" *

o * o o * * ~ * *

~

~O 2 4 6 8 la

in

fkJ

Fig.

7.

Probability

distribution function,

nm(k),

for an initial monomer to be used k times

by

virtue

of the atoms derived from

ii,

1-e-

nm(k)

monomers appear

precisely

k times as atoms in the final set of

clusters. Sets used:

(o)

"2d.1" m

=

10~,

extra clusters grown

= 4.66 x 10~.

(*) "3d.1",

m = 5 x 10~,

extra clusters grown = 8.10 x

10~, (+) ~'3d.2",

m

=

10~,

extra clusters grown

= 1.759 x 10~.

clusters are m the bin. In other

words,

the amount of

independent sampling

of the ensemble

is not as

large

as the number of clusters

produced

would

suggest.

An estimate of the number of

"independent"

clusters in a bin is: n]j~~~~~ m

il Xbin)

n~iusbin, where n~ju~bin is the

total number of dusters m the bin. This

suggests

an estimated error for the duster mass distribution:

~iÎ

~

~N il

~

(Rllusbin)

~

'(~l) (~l)

In

practice,

we found that the errors

predicted by equation (21)

were of the

right form,

but

we needed to introduce an

(arbitrary) "empirical"

factor of 4 to achieve sullicient

magnitude

of error for the

sample

3d.2 in

which,

due to

large Xbin

and sparse

dusters,

the errors were

significant,

see

Figure

6.

Finally,

we looked at the

probability

distribution

function, nm(k)

for a monomer to be used k times

by

virtue of the atoms that are derived from

it,

1.e. nm

(k)

monomers appear k times as

atoms in the final set of dusters. 0ne

might expect

an

exponential

distribution for

nm(k),

as

the much

simpler

distribution of the

number,

n, of times an

object

is

picked

and

replaced

from

a set of s items scales like

m~

el~"~~(~~l. However,

the creation of the distribution

nm(k)

is very much more

complicated

than this and the

semi-log plot

of

In[nm(k)]

vs. k did not

suggest

an

exponential.

The

log-log plot gives

some

suggestion

of a power

law,

or several regions of power law behaviour. When

nm(k)

is normalised

by

the number of monomers, the

log-log graphs

of different sized 3d sets

overlap dosely,

whilst the 2d set has a different

gradient, Figure

7.

Conjecturing

that a power law is present;

nm(k)

m~

k~~

we find:

d=3, ~fim1.5

d =

2,

~fi m I.1

(22)

between

In(k)

m 2 and

In(k)

m 6. We have not made progress in

interpreting

these results.

(13)

368 JOURNAL DE PHYSIQUE I N°3

~

(

w

Fig.

8.

Diagram

of a cluster as a "backbone'~ with side-branches

hanging

off ii. The backbone has curvilinear

length,

s, and an end-to-end

length (.

7. Is Standard RLCA in the Same

Universality

Class as Branched

Polymers?

with

Reference to the Backbone

Dimension, DB

In this

section, by

consideration of the duster backbone and the reaction

kernel,

we derive a

scaling exponent equation

that links several

important exponents

and hence show that standard RLCA is

unlikely

to be in the same

universality

Mass as branched

polymers

and NDRLCA.

We may think of a duster as a backbone of curvilinear

length,

s, and end-to-end

length, (,

with the rest of the duster

hanging

off this backbone as a collection of side-branches

(see Fig. 8).

Each link in the backbone is an atom of the duster. The smallest side-branches are of

size

1,

1e.

just

the atom on the

backbone,

and the

largest

is

expected

to be

of

order the size of the whole duster. The curvilinear

length

of the backbone is

expected

to be related to the

end to end

length, (, by

a power law:

s m~

(~b (23)

where

Db

is the backbone

dimension,

also called the

resistivity

exponent

[15].

We expect the total mass,

N,

of the duster to scale with the end-to-end

distance, (,

as:

(~

m~

N

(24)

where D is the fractal dimension. Hence the

scaling

of the average side-branch mass,

~,

is

given by:

s

~

m~

(~~~~

m~

N(~~~b/~l.. (25) (25)

s

The average side-branch mass is also the average interval bet,veen

possible fragment

masses into which the duster can be divided

along

the backbone. To see

this,

consider

starting

with one

possible

division

point along

the

backbone;

the nearest division to this will be one

step

further

along

the

backbone,

and of order one side-branch mass will have been transferred between the

two

fragments by

this step. It follows that the

probability

that the duster can be cut into two

(exactly) equal fragments

of mass ~ is given

by:

2

P~ut

=

))

=

)

+~

N(~~/~~~) (26)

Strictly speaking

the above

only applies

to

cutting along

a

particular backbone,

but it is

easily

shown that all cuts more

equal

than 2:1 must be

along

one unique backbone.

(14)

Now we consider the

scaling

of the

diagonal part

of the reaction

kernel, K(N, N)

and its

significance

for the

universality

Mass

question.

We start from

equation (8) (Section 2)

written with

respect

to ci~tster sizes as

opposed

to duster

geometries:

)LdN(z)

=

~ K(P, Q)LdP(z)Ldolz) (2?)

P+Q=N

where

~ON(z)

is the

fugacity-dependent

duster size distribution and

K(P, Q)

is the kernel in terms of cluster size rather than

geometrg, given by:

~j K(P, Q)OpCQ

K(P, Q)

=

~~'~~~~~~~~

~j CpCQ (28)

lPl=P>loi=Q

from which the

z-dependence completely

cancels. The

probability

that a cluster may be

split

in half is

given by P~ut

~

(Eq. (26) ),

from which it follows that:

2

CNP~Ut

=

l~)

= Ii

~~, ~) CN/2C~l12 (29)

2 2 2

and K

~,

~

,

scales as:

2 2

N N

N-TN(D~/D-1)

K

~-, -)

m~

N~

m~ m~

~i(~b

~~~+~)

(30)

2 2 N~~N~~

This means that branched

polymers

and NDRLCA

satisfy

the

exponent equation:

À=T-1+~~

(31)

If RLCA is in the same

universality

Mass it too must

satisfy equation (31).

In Section we

looked at the kinetics of RLCA as discussed

by

Ball et ai. [6].

They

observed that for < 1 the Smoluchowski

equation

does not

give

a power law for the cluster mass distribution and for

>

1,

T > 2 is

obtained,

m

disagreement

with the branched

polymer

value of T

= I.à. This

leaves

= 1 as the

only possibility

for

agreement, requiring:

Db(req.)

"

D(À

+1

T)

=

(32)

This is well below the value

Db

= 1.36

[15] reported

for branched

polymers

m d

=

3,

al-

though

it agrees well with numerical results obtained for

polydisperse

RLCA

simulation, Db

"

0.960 + 0.033

[16].

Both of these values relate to duster sizes of order

10~.

For RLCA and branched

polymers

to be in the same

universality Mass, Db

" 1 would have to be satisfied

by

both: m the

light

of the values cited we must condude that this is most

unlikely.

8. Conclusions

We have introduced a new

proof

that

polydisperse

RLCA without deletion of parents,

NDRLCA,

gives branched

polymers

which exhibit lattice animal statistics.

Computer

simulation has been

(15)

3m JOURNAL DE

PHYSIQUE

I N°3

shown to give values for critical

exponents highly

consistent with those

predicted by

field the- ory and renormalisation group method

approaches il, 3,4]

to trie

study

of lattice animals and

dilute-limit branched

polymers, namely:

d = 2 : D

= 1.53 + 0.05 T

= 1.09 + 0.06

d = 3 : D

= 1.96 + 0.04 T

= 1.50 + 0.04

where the theoretical values are:

d=2: Dm1.56 T=1

[4,3]

d=3: D=2

T=3/2

[3]

As an

algorithm

for

exploring

the statistics of Branched

Polymers,

the

key

asset of our method is that it

generates

a whole cluster size distribution.

This, however,

is also its

greatest

drawback where

only

the

spatial

statistics of individual clusters are of interest. We have also considered the concepts of

inbreeding

that arise in finite NDRLCA and used them to

explam

fluctuations in the duster size distribution. Further work would be useful in

understanding

some of the

functions introduced to this end.

Using

the

approach developed

for

proving

that NDRLCA

gives

dilute-hmit branched

poly-

mers, we were able to show that standard RLCA is very

unhkely

to be in the same

universahty

class as branched

polymers

as it

probably

cannot

satisfy

the

exponent equation

derived

above, namely:

= T -1+

j (33)

which

implies

that the backbone

dimension, Db

for RLCA clusters must be 1 where as the value for branched

polymers

has been

reported

as

Db

" 1.36

[15].

Acknowledgments

The authors

acknowledge pilot

studies of the NDRLCA

algorithm by

B-L- Parkes and M.T.

Wilson,

and research

funding by EPSRC, grant GR/K511948.

JRL

acknowledges

earher sup-

port

under an EPSRC

studentship.

References

[ii Lubensky

T. and Isaacson

J., Phgs.

Reu. A 20

(1979)

2130.

[2] Bunde

A.,

Havlin S. and Porto

M., Phgs.

Reu. Lett. 74

(1995)

2714.

[3] Parisi G. and Sourlas

N., Phys

Reu Lett 46

(1981)

871.

[4] Derrida B. and De Seze

L.,

J.

Phgs.

43

(1982)

475.

[5] Miller J-D- and De'Bell

K.,

J.

Phgs.

I France 3

(1993)

1717.

[6] Ball

R-C-,

Weitz

D.A-,

Witten A.T. and

Leyvraz F., Phgs.

Reu. Lett. 58

(1987)

274.

[7] van

Dongen

P-G-J- and Ernst

M.H., Phys.

Reu. Lett. 54

(1985)

1396.

[8] van

Dongen

P-G-J- and Ernst

M.H.,

J.

Phys.

A 18

(1985)

2779.

[9] van

Dongen

P-G-J- and Ernst

M.H., Phys.

Reu. A 32

(1985)

670.

[10] Brown W-D- and Ball

R-C-,

J.

Phys.

A 18

(1985)

L517.

[Il]

Meakin

P.,

in Phase Transitions and Critical

Phenomena,

Vol.

12,

C. Domb and J.L.

Lebowitz~

Eds.

(Academic Press, London, 1988).

(16)

[12]

Weitz

D.A.,

Lin

M.Y., Huang J-S-,

Witten

T.A.,

Sinha

S-K-,

Gethner J-S- and Ball

R-C-,

in

Scaling

Phenomena in Disordered

Systems,

R.

Pynn

and A.

Skeletorp,

Eds.

(Plenum,

New

York, 1985).

[13] Rarity J-G-,

Seabrook R-N- and Carr

R-J-G-,

in Fractals in the Natural

Sciences,

M.

Fleischmann,

D.J.

Tildesley

and R-C-

Ball,

Eds.

(PUP, Princeton, 1990).

[14]

von Smoluchowski

M.,

Z.

Phys.

Chem 92

(1917)

129.

[15]

Havlin S. et ai.~

Phys.

Reu. Lett. 53

(1984)

178.

[16]

Brown

W-D-,

PhD

thesis, University

of

Cambridge,

U-K.

(1985).

Références

Documents relatifs

In this paper, the partially overlapping samples test statistics that make use of all of the available data, account- ing for the fact that there is a combination of paired

Moreover, the paper describes a series of extensions and generalizations of this algorithm (for fuzzy clustering, maximum likelihood cluster- ing, convexity-based criteria,...)

Regarding the last syntactic restriction presented by Boskovic and Lasnik, it should be noted that in an extraposed context like (28), in which there is a linking verb like

Having noted the model law for registration of herbal medicines that outlines procedures for registration of such pharmaceutical preparations, developed by

Sport clusters are geographical concentrations of interconnected organisations that provide different products or services related to a sport, professional and amateur sport

Our main findings are as follows: (i) the fibrin(ogen) coat of the PS-positive platelets is not uniformly spread over the platelet surface but rather located in a single PS-rich

Si vous laissez la batterie dans le chargeur pour éviter toute décharge spontanée après une recharge complète, le chargeur passe en mode de “charge de compensation

The Report of the Committee to the General Assembly would be presented by the Chairperson of the twelfth session of the Intergovernmental Committee, H.E.