p = 0.50 Site percolation Square lattice 400 x 400

Slides:



Advertisements
Similar presentations
Spreading random connection functions Massimo Franceschetti Newton Institute for Mathematical Sciences April, 7, 2010 joint work with Mathew Penrose and.
Advertisements

Transport and Percolation in Complex Networks Guanliang Li Advisor: H. Eugene Stanley Collaborators: Shlomo Havlin, Lidia A. Braunstein, Sergey V. Buldyrev.
Mobile Communication Networks Vahid Mirjalili Department of Mechanical Engineering Department of Biochemistry & Molecular Biology.
Anomalous Transport and Diffusion in Disordered Materials Armin Bunde Justus-Liebig-Universität Giessen in cooperation with Markus Ulrich (Giessen, Stuttgart)
It’s a Small World by Jamie Luo. Introduction Small World Networks and their place in Network Theory An application of a 1D small world network to model.
VL Netzwerke, WS 2007/08 Edda Klipp 1 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Networks in Metabolism.
Daniel ben -AvrahamClarkson University Boston Universtiy Reuven Cohen Tomer Kalisky Alex Rozenfeld Bar-Ilan University Eugene Stanley Lidia Braunstein.
MESF593 Finite Element Methods HW #4 11:00pm, 10 May, 2010.
Physical Mechanism Underlying Opinion Spreading Jia Shao Advisor: H. Eugene Stanley J. Shao, S. Havlin, and H. E. Stanley, Phys. Rev. Lett. 103,
Dynamical Systems and Chaos Coarse-Graining in Time Low Dimensional Dynamical Systems Bifurcation Theory Saddle-Node, Intermittency, Pitchfork, Hopf Normal.
Physical Mechanism Underlying Opinion Spreading
Lin Chen∗, Kaigui Bian∗, Lin Chen† Wei Yan∗, and Xiaoming Li∗
Galaxies What is a galaxy? How many stars are there in an average galaxy? About how many galaxies are there in the universe? What is the name of our galaxy?
STOCHASTIC GEOMETRY AND RANDOM GRAPHS FOR THE ANALYSIS AND DESIGN OF WIRELESS NETWORKS Haenggi et al EE 360 : 19 th February 2014.
Contour maps show the following: The elevation of the land above sea level. “A bird’s eye view!
Space-Filling DOEs Design of experiments (DOE) for noisy data tend to place points on the boundary of the domain. When the error in the surrogate is due.
Homework for next week P.176 green P.176 red 2nd lesson
Information Networks Power Laws and Network Models Lecture 3.
Scale Feature that relates distances on a map to distances on Earth
People Fractions. Problem 1 of 20 Answer 1 = 10 Problem 2 of 20 Answer 2 = 5.
Using Dijkstra’s Algorithm to Find a Shortest Path from a to z 1.
MEDUSA – New Model of Internet Topology Using k-shell Decomposition Shai Carmi Shlomo Havlin Bloomington 05/24/2005.
Random deposition = simplest possible growth model
Random-Graph Theory The Erdos-Renyi model. G={P,E}, PNP 1,P 2,...,P N E In mathematical terms a network is represented by a graph. A graph is a pair of.
School of Information Sciences University of Pittsburgh TELCOM2125: Network Science and Analysis Konstantinos Pelechrinis Spring 2013 Figures are taken.
Informed search algorithms Chapter 4. Outline Best-first search Greedy best-first search A * search Heuristics.
Self-Similarity of Complex Networks Maksim Kitsak Advisor: H. Eugene Stanley Collaborators: Shlomo Havlin Gerald Paul Zhenhua Wu Yiping Chen Guanliang.
Chap 16-1 Light Fundamentals.
Chap 16-1 Light Fundamentals. What is Light? A transverse electromagnetic wave.
3. SMALL WORLDS The Watts-Strogatz model. Watts-Strogatz, Nature 1998 Small world: the average shortest path length in a real network is small Six degrees.
Percolation Percolation is a purely geometric problem which exhibits a phase transition consider a 2 dimensional lattice where the sites are occupied with.
Hmmmmm..Pie!. WALT understand and interpret pie charts.
Marina Maksimova Session 7 Comments for “Classical Tests”
Drawing Abilities Teacher
2-D & 3-D Random Walk Simulations of Stochastic Diffusion Bob Brazzle (Jefferson College)
Percolation and diffusion in network models Shai Carmi, Department of Physics, Bar-Ilan University Networks Percolation Diffusion Background picture: The.
Can you get to the treasure? You must find a path across the maze by stepping on adjacent squares. The square you move onto must be an equivalent fraction.
1. Background A generic ‘chirp’ can be closely approximated by a connected set of multiscale chirplets with quadratically-evolving phase. The problem of.
José S. Andrade Jr. Universidade Federal do Ceará Departamento de Física Flow and heat transport in irregular channels Collaborators: Ascânio Dias Araújo.
The Percolation Threshold for a Honeycomb Lattice.
Decimals, Fractions and Percentages 17/07/06 Aim : revise place value and equivalence between fractions, decimals and percentage.
Transport in weighted networks: optimal path and superhighways Collaborators: Z. Wu, Y. Chen, E. Lopez, S. Carmi, L.A. Braunstein, S. Buldyrev, H. E. Stanley.
Fick’s Law The exact interpretation of neutron transport in heterogeneous domains is so complex. Assumptions and approximations. Simplified approaches.
Nuclear Reactors, BAU, 1st Semester, (Saed Dababneh).
Percolation Percolation is a purely geometric problem which exhibits a phase transition consider a 2 dimensional lattice where the sites are occupied with.
CLIMATE GRAPHS. Temp In °C Precipitation In mm OTTAWA LABELS! CITY AT TOP TEMPERATURE ON LEFT IN °C PRECIPITATION ON RIGHT MONTHS ACROSS THE BOTTOM.
Fractal Networks: Structures, Modeling, and Dynamics 章 忠 志 复旦大学计算机科学技术学院 Homepage:
STRETCHES AND SHEARS.
Daniel ben - Avraham Clarkson University Boston Universtiy Reuven Cohen Tomer Kalisky Alex Rozenfeld Bar-Ilan University Eugene Stanley Lidia Braunstein.
Pore water fluxes and mass balance
Quantifying Scale and Pattern Lecture 7 February 15, 2005
Side Ratio Perimeter Ratio Area Ratio 1:5 1:5 1:25 4:3 4:3 16:9 3:1
Correlations and Scale in Circumstellar Dust Shells
Geometrical Properties of Gel and Fluid Clusters in DMPC/DSPC Bilayers: Monte Carlo Simulation Approach Using a Two-State Model  István P. Sugár, Ekaterina.
Climate Graphs What do they tell us?.
Climate Graphs What do they tell us?.
Coherence 1 1.
Name: _______________________________
Fractal atomic-level percolation in metallic glasses
Department of Computer Science University of York
r4=2 c4=1 r2=1 d4=6 c2=2 d2=5 r5=2 c5=1 d5=8 r1=0 c1=2
Calculating the Area of a Feature
Taeyoon Kim, Margaret L. Gardel, Ed Munro  Biophysical Journal 
Volume 104, Issue 5, Pages (March 2013)
Percolation.
Volume 85, Issue 2, Pages (August 2003)
Shapes.
Chapter 30 Examples 4,8.
What fraction should go here
Antenna Theory By CONSTANTINE A.BALANIS Ch1.4, 2.1~2.2.4 O Yeon Jeong.
Presentation transcript:

p = 0.50 Site percolation Square lattice 400 x 400 Three largest clusters are coloured green/blue/yellow p = 0.50

p = 0.55

p = 0.58

p = 0.59

p = 0.60

p = 0.65

Fraction of sites on the largest cluster

S = mean size of finite clusters Estimate in Bunde and Havlin: pc = 0.5927

Cluster generation via Leath method (epidemic spreading)

M ~ rdf r space dimension d = 2 fractal dimension df r At pc the infinite cluster has a fractal dimension df < 2 r

Estimate of fractal dimension of percolation clusters generated by Leath method at p = 0.59 Exact answer : df = 91/48 = 1.896

p = 0.55  For p < pc correlation length  = mean distance between points on the same finite cluster p = 0.55 

 For p > pc can still define correlation length = mean distance between points on the same finite cluster. This is typical size of holes in infinite cluster. The infinite cluster is uniform above this length scale 

p = 0.65 Minimum path length from centre. red = short green = long almost circular contours  uniform medium p = 0.65

p = 0.59 Minimum path length from centre. red = short green = long irregular contours  poorly connected medium fractal p = 0.59

p = 0.72 Diffusion through the infinite cluster Concentration red = 1.0, green = 0.0 Flux red = high, blue = low

Diffusion through the infinite cluster close to percolation Concentration red = 1.0, green = 0.0 Flux red = high, blue = low

lmin ~ rdmin L = 100 Shortest path across a cluster close to pc

lmin ~ Ldmin Shortest path across lattice of size L Estimate in Bunde and Havlin book = 1.13

Testing the scaling hypothesis for cluster size distribution.