Percolation Percolation is a purely geometric problem which exhibits a phase transition consider a 2...
-
Upload
allison-scott -
Category
Documents
-
view
214 -
download
0
Transcript of Percolation Percolation is a purely geometric problem which exhibits a phase transition consider a 2...
![Page 1: Percolation Percolation is a purely geometric problem which exhibits a phase transition consider a 2 dimensional lattice where the sites are occupied with.](https://reader035.fdocuments.us/reader035/viewer/2022081519/56649f315503460f94c4ce22/html5/thumbnails/1.jpg)
Percolation• Percolation is a purely geometric problem
which exhibits a phase transition
• consider a 2 dimensional lattice where the sites are occupied with probability p and unoccupied with probability (1-p)
• clusters are defined in terms of nearest neighbour sites that are both occupied
• For p < pc all clusters are finite
• for p > pc there exists an infinite cluster
• when p=pc, infinite cluster first appears
![Page 2: Percolation Percolation is a purely geometric problem which exhibits a phase transition consider a 2 dimensional lattice where the sites are occupied with.](https://reader035.fdocuments.us/reader035/viewer/2022081519/56649f315503460f94c4ce22/html5/thumbnails/2.jpg)
1/cp p L
Distance from the critical point at whichfinite size effects occur
/
/
( ) ( )
( )
c c
c c
p p p p L
S p p p p L
Measure these quantities at pc and estimate critical exponentsusing the size dependence
![Page 3: Percolation Percolation is a purely geometric problem which exhibits a phase transition consider a 2 dimensional lattice where the sites are occupied with.](https://reader035.fdocuments.us/reader035/viewer/2022081519/56649f315503460f94c4ce22/html5/thumbnails/3.jpg)
Finite size scaling
• At pc there are clusters of all sizes present
• the geometry of the infinite spanning cluster is self-similar under magnification
• the cluster is very tenuous and stringy
• fractals can be used to describe such objects
• the fractal dimension D can be used as a measure of the structure
![Page 4: Percolation Percolation is a purely geometric problem which exhibits a phase transition consider a 2 dimensional lattice where the sites are occupied with.](https://reader035.fdocuments.us/reader035/viewer/2022081519/56649f315503460f94c4ce22/html5/thumbnails/4.jpg)
Spanning cluster
Tenuous and not compact
![Page 5: Percolation Percolation is a purely geometric problem which exhibits a phase transition consider a 2 dimensional lattice where the sites are occupied with.](https://reader035.fdocuments.us/reader035/viewer/2022081519/56649f315503460f94c4ce22/html5/thumbnails/5.jpg)
Fractal Dimension
• Recall for a uniform circle or sphere
• M(R) ~ RD
• if D=d (Euclidean dimension) then the object is compact
• density (R)=M(R)/Rd ~ RD-d
• if D=d then the density is uniform
• if D < d then the density of the object is scale dependent and decreases at large length scales
![Page 6: Percolation Percolation is a purely geometric problem which exhibits a phase transition consider a 2 dimensional lattice where the sites are occupied with.](https://reader035.fdocuments.us/reader035/viewer/2022081519/56649f315503460f94c4ce22/html5/thumbnails/6.jpg)
Fractal Objects
• The percolation cluster is an example of a random or statistical fractal because the relation M(R) ~ RD must be averaged over many different origins in a given cluster and over many clusters
![Page 7: Percolation Percolation is a purely geometric problem which exhibits a phase transition consider a 2 dimensional lattice where the sites are occupied with.](https://reader035.fdocuments.us/reader035/viewer/2022081519/56649f315503460f94c4ce22/html5/thumbnails/7.jpg)
Regular Fractals
• Consider a line segment and divide it in half
• the scaling factor is b=2
• the number of units is now N=2
• N=b
![Page 8: Percolation Percolation is a purely geometric problem which exhibits a phase transition consider a 2 dimensional lattice where the sites are occupied with.](https://reader035.fdocuments.us/reader035/viewer/2022081519/56649f315503460f94c4ce22/html5/thumbnails/8.jpg)
Regular Fractals
• Again b=2 but now the number of new units is N=4
• N=b2
• in general dimension we have N=bd
• hence d = ln(N)/ln(b)
![Page 9: Percolation Percolation is a purely geometric problem which exhibits a phase transition consider a 2 dimensional lattice where the sites are occupied with.](https://reader035.fdocuments.us/reader035/viewer/2022081519/56649f315503460f94c4ce22/html5/thumbnails/9.jpg)
Regular Fractals
• Each line segment is divided into 3 parts and replaced by 4 parts
• hence N=4 and b=3
• D = ln(N)/ln(b) = ln(4)/ln(3) = 1.26
• the curve is self-similar (looks the same under magnification) and the dimension is non-integral
Koch CurveKoch
![Page 10: Percolation Percolation is a purely geometric problem which exhibits a phase transition consider a 2 dimensional lattice where the sites are occupied with.](https://reader035.fdocuments.us/reader035/viewer/2022081519/56649f315503460f94c4ce22/html5/thumbnails/10.jpg)
Spanning Cluster
• The spanning cluster at pc has a fractal structure
• we can measure the number of sites M within a distance r of the centre of mass of the cluster
• plot ln(M) versus ln(r) to determine D
![Page 11: Percolation Percolation is a purely geometric problem which exhibits a phase transition consider a 2 dimensional lattice where the sites are occupied with.](https://reader035.fdocuments.us/reader035/viewer/2022081519/56649f315503460f94c4ce22/html5/thumbnails/11.jpg)
Algorithm for generating the spanning cluster
• Occupy a single site at the center of the lattice
• the 4 nearest neighbours are perimeter sites
• for each perimeter site generate a random number r on the unit interval
• if r p the site is occupied and added to the cluster
• otherwise the site is not occupied and not tested again
• for each occupied site determine if there are new perimeter sites to be tested
• continue until there are no untested perimeter sites
Percolationclusters
![Page 12: Percolation Percolation is a purely geometric problem which exhibits a phase transition consider a 2 dimensional lattice where the sites are occupied with.](https://reader035.fdocuments.us/reader035/viewer/2022081519/56649f315503460f94c4ce22/html5/thumbnails/12.jpg)
Fractal Dimension• The fractal dimension of percolation clusters
satisfies a scaling law
• D=d -/• for two dimensions, =5/36 and =4/3
• D=91/48 ~ 1.896
• the mass of the spanning cluster is the probability of a site belonging to it multiplied by the total number of sites Ld
( ) ( ) dM L L L
![Page 13: Percolation Percolation is a purely geometric problem which exhibits a phase transition consider a 2 dimensional lattice where the sites are occupied with.](https://reader035.fdocuments.us/reader035/viewer/2022081519/56649f315503460f94c4ce22/html5/thumbnails/13.jpg)
Fractal Dimension1/
cp p L /
/
( ) ( )
( )
c c
c c
p p p p L
S p p p p L
/( ) d DM L L L L
![Page 14: Percolation Percolation is a purely geometric problem which exhibits a phase transition consider a 2 dimensional lattice where the sites are occupied with.](https://reader035.fdocuments.us/reader035/viewer/2022081519/56649f315503460f94c4ce22/html5/thumbnails/14.jpg)
Renormalization Group
• The critical exponents characterizing the geometrical phase transition can be obtained by simulating percolation clusters near pc and examining the various properties on different length scales L
• another method of examining the system on different length scales is the renormalization group
![Page 15: Percolation Percolation is a purely geometric problem which exhibits a phase transition consider a 2 dimensional lattice where the sites are occupied with.](https://reader035.fdocuments.us/reader035/viewer/2022081519/56649f315503460f94c4ce22/html5/thumbnails/15.jpg)
Scaling
• Consider a photograph of a percolation configuration generated at p=p0 <pc
• now consider viewing it from further distances
![Page 16: Percolation Percolation is a purely geometric problem which exhibits a phase transition consider a 2 dimensional lattice where the sites are occupied with.](https://reader035.fdocuments.us/reader035/viewer/2022081519/56649f315503460f94c4ce22/html5/thumbnails/16.jpg)
![Page 17: Percolation Percolation is a purely geometric problem which exhibits a phase transition consider a 2 dimensional lattice where the sites are occupied with.](https://reader035.fdocuments.us/reader035/viewer/2022081519/56649f315503460f94c4ce22/html5/thumbnails/17.jpg)
2'p p
For p < 1 , p’ => 0 at large length scales
For p=1 , p’ =1 at all length scales
pc = 1
1-d chain
![Page 19: Percolation Percolation is a purely geometric problem which exhibits a phase transition consider a 2 dimensional lattice where the sites are occupied with.](https://reader035.fdocuments.us/reader035/viewer/2022081519/56649f315503460f94c4ce22/html5/thumbnails/19.jpg)
Percolation and RandomWalks
• diffusion and transport in disordered media• a walker can only move ‘up’,’down’,’left’ or ‘right’ if the
neighbouring site is an occupied site• how does <r2> depend on the number of steps N ?
• For p < pc all walkers are confined to finite clusters
• for p > pc most walkers have <r2> N
• “normal” diffusion
• at p=pc we have anomalous diffusion
![Page 20: Percolation Percolation is a purely geometric problem which exhibits a phase transition consider a 2 dimensional lattice where the sites are occupied with.](https://reader035.fdocuments.us/reader035/viewer/2022081519/56649f315503460f94c4ce22/html5/thumbnails/20.jpg)
Anomalous Diffusion• when p=pc, only a few walkers are not localized
• let a walker start on a cluster and walk
• the mean square displacement <R2>~ Na
• for p < pc all clusters are finite and thus a=0
• for p>pc we have normal diffusion and a=1
• at pc we have anomalous diffusion a=2/3
![Page 21: Percolation Percolation is a purely geometric problem which exhibits a phase transition consider a 2 dimensional lattice where the sites are occupied with.](https://reader035.fdocuments.us/reader035/viewer/2022081519/56649f315503460f94c4ce22/html5/thumbnails/21.jpg)
Disordered Magnets