Percolation Simulating percolation models Guillermo Amaral Caesar Systems - Argentina.

Slides:



Advertisements
Similar presentations
Routing Complexity of Faulty Networks Omer Angel Itai Benjamini Eran Ofek Udi Wieder The Weizmann Institute of Science.
Advertisements

Spreading random connection functions Massimo Franceschetti Newton Institute for Mathematical Sciences April, 7, 2010 joint work with Mathew Penrose and.
Unsupervised Learning Clustering K-Means. Recall: Key Components of Intelligent Agents Representation Language: Graph, Bayes Nets, Linear functions Inference.
Modeling Malware Spreading Dynamics Michele Garetto (Politecnico di Torino – Italy) Weibo Gong (University of Massachusetts – Amherst – MA) Don Towsley.
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.
Northeastern University - MTHG131 – Final Project Exploration of a Complex System Using Differential Equations Bryan Licciardi12/6/2006 Model based on.
Percolation on a 2D Square Lattice and Cluster Distributions Kalin Arsov Second Year Undergraduate Student University of Sofia, Faculty of Physics Adviser:
Farnoush Banaei-Kashani and Cyrus Shahabi Criticality-based Analysis and Design of Unstructured P2P Networks as “ Complex Systems ” Mohammad Al-Rifai.
Introduction to Percolation
Dynamic percolation, exceptional times, and harmonic analysis of boolean functions Oded Schramm joint w/ Jeff Steif.
Models and Security Requirements for IDS. Overview The system and attack model Security requirements for IDS –Sensitivity –Detection Analysis methodology.
Examining the crossover between the hadronic and partonic phases in QCD and the structure of sQGP Xu Mingmei( 许明梅 ), Yu Meiling( 喻梅凌 ), Liu Lianshou( 刘连寿.
DAST, Spring © L. Joskowicz 1 Data Structures – LECTURE 1 Introduction Motivation: algorithms and abstract data types Easy problems, hard problems.
MASSIMO FRANCESCHETTI University of California at Berkeley Ad-hoc wireless networks with noisy links Lorna Booth, Matt Cook, Shuki Bruck, Ronald Meester.
Physical Mechanism Underlying Opinion Spreading
1 The Potts model Mike Sinclair. 2 Overview Potts model –Extension of Ising model –Uses interacting spins on a lattice –N-dimensional (spin states > 2)
MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective.
Class 03. Percolation etc. [Closely following the text by R. Zallen]
Lin Chen∗, Kaigui Bian∗, Lin Chen† Wei Yan∗, and Xiaoming Li∗
DAST, Spring © L. Joskowicz 1 Data Structures – LECTURE 1 Introduction Motivation: algorithms and abstract data types Easy problems, hard problems.
POSTER TEMPLATE BY: Cluster-Based Modeling: Exploring the Linear Regression Model Space Student: XiaYi(Sandy) Shen Advisor:
STOCHASTIC GEOMETRY AND RANDOM GRAPHS FOR THE ANALYSIS AND DESIGN OF WIRELESS NETWORKS Haenggi et al EE 360 : 19 th February 2014.
Quantitative Business Analysis Course Introduction By Aziza Munir.
Absorbing Phase Transitions
Investigation 3: Inverse Variation
Nanoscale Digital Computation Through Percolation Mustafa Altun Electrical and Computer Engineering DAC, “Wild and Crazy Ideas” Session ─ San Francisco,
Developing Analytical Framework to Measure Robustness of Peer-to-Peer Networks Niloy Ganguly.
 1  Outline  stages and topics in simulation  generation of random variates.
Your experiment tests whether your hypothesis is true or false.
The Shape of the Web So, the Web is a directed graph, but what does it look like?
SCIENTIFIC METHOD THE STEPS.
Percolation in self-similar networks Dmitri Krioukov CAIDA/UCSD M. Á. Serrano, M. Boguñá UNT, March 2011.
Probability and Statistics Required!. 2 Review Outline  Connection to simulation.  Concepts to review.  Assess your understanding.  Addressing knowledge.
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.
Networks Igor Segota Statistical physics presentation.
Computing with Defects
p = 0.50 Site percolation Square lattice 400 x 400
Percolation Percolation is a purely geometric problem which exhibits a phase transition consider a 2 dimensional lattice where the sites are occupied with.
Percolation Processes Rajmohan Rajaraman Northeastern University, Boston May 2012 Chennai Network Optimization WorkshopPercolation Processes1.
Outline Intro to Representation and Heuristic Search Machine Learning (Clustering) and My Research.
Approximate Inference: Decomposition Methods with Applications to Computer Vision Kyomin Jung ( KAIST ) Joint work with Pushmeet Kohli (Microsoft Research)
Austin Howard & Chris Wohlgamuth April 28, 2009 This presentation is available at
Collective diffusion of the interacting surface gas Magdalena Załuska-Kotur Institute of Physics, Polish Academy of Sciences.
STATISTICS AND OPTIMIZATION Dr. Asawer A. Alwasiti.
Radial Basis Function ANN, an alternative to back propagation, uses clustering of examples in the training set.
An Introduction to Monte Carlo Methods in Statistical Physics Kristen A. Fichthorn The Pennsylvania State University University Park, PA
(2) Scientific processes. The student uses scientific methods during field and laboratory investigations. The student is expected to: (A) plan and implement.
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.
The Science of Physics Mathematics. What We Want to Know… How do tables and graphs help understand data? How can we use graphs to understand the relationship.
Percolation Percolation is a purely geometric problem which exhibits a phase transition consider a 2 dimensional lattice where the sites are occupied with.
SLE and conformal invariance for critical Ising model jointly with Dmitry Chelkak 3rd LA PIETRA WEEK IN PROBABILITY Stochastic Models in Physics Firenze,
Project 1 : Phase 1 22C:021 CS II Data Structures.
Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.
Graphing Notes. Data: information being gathered quantitative: numbers qualitative:description; not numbers Why collect Data? When data is collected;
1 A Case Study: Percolation Percolation. Pour liquid on top of some porous material. Will liquid reach the bottom? Applications. [ chemistry, materials.
2.4 A Case Study: Percolation Introduction to Programming in Java: An Interdisciplinary Approach · Robert Sedgewick and Kevin Wayne · Copyright © 2008.
1 A Case Study: Percolation Percolation. Pour liquid on top of some porous material. Will liquid reach the bottom? Applications. [ chemistry, materials.
Theory of Computational Complexity Probability and Computing Chapter Hikaru Inada Iwama and Ito lab M1.
On the understanding of self-assembly of anisotropic colloidal particles using computer simulation methods Nikoletta Pakalidou1✣ and Carlos Avendaño1 1.
On the understanding of self-assembly of anisotropic colloidal particles using computer simulation methods Nikoletta Pakalidou1✣ and Carlos Avendaño1 1.
WARM UP Factor the polynomial completely. b b2
Peer-to-Peer and Social Networks
Reconstruction on trees and Phylogeny 1
Small World Networks Scotty Smith February 7, 2007.
A Computational Approach to Percolation Theory
Surface Areas of Pyramids and Cones
Approximation of Percolation Thresholds
Percolation.
2.4 A Case Study: Percolation
Exploring Energy-Latency Tradeoffs for Sensor Network Broadcasts
Presentation transcript:

Percolation Simulating percolation models Guillermo Amaral Caesar Systems - Argentina

ESUG 2009 Guillermo Amaral 2

ESUG 2009 Guillermo Amaral 3

ESUG 2009 Guillermo Amaral 4

ESUG 2009 A virtual lab Guillermo Amaral 5

ESUG 2009 Percolation deals with…

ESUG 2009 Propagation of diseases Guillermo Amaral 7

ESUG 2009 Propagation of fire Guillermo Amaral 8

ESUG 2009 Oil & gas in reservoirs Guillermo Amaral 9

ESUG 2009 Gelation & Polymerization Guillermo Amaral 10

ESUG 2009 The problem

ESUG 2009 Original problem (Broadbent - Hammersley, 1957) Guillermo Amaral 12 What is the probability that the water reaches the center of the rock?

ESUG 2009 The simulation

ESUG 2009 The mathematical model

ESUG 2009 The simplest model Guillermo Amaral 15 v ℤ2v ℤ2 v ℤ2v ℤ2 v u at distance 1 from v u v P( e “open”) = p P( e “close”) = 1 - p P( e “open”) = p P( e “close”) = 1 - p e Open path from u to v Open path from u to v v u Percolating cluster Open cluster from v v

ESUG 2009 Dimensions 3-D n-D… 2-D Element being open/close Bond Site Both… Structure SquareBow-tie HexagonalKagomé Other… Model types Guillermo Amaral 16 Direction Anisotropic p1p1 p2p2 Isotropic p p

ESUG 2009  θ(p) = P p (a given vertex belongs to a percolating cluster)  θ(p) = 0 si p = 0  θ(p) = 1 si p = 1  θ(p) is monotonically non-decrescent  There is p c Є [0, 1] such that:  θ(p) = 0 if p < p c  θ(p) > 0 if p > p c  When is p = p c ? Phase transition: Critical probability Guillermo Amaral 17 pcpc θ(p)θ(p) p pc?pc? pc?pc?

ESUG 2009 Known critical probabilities Guillermo Amaral 18 BondSite Square ½ … Bow-tie 1 − p − 6p 2 - 6p 3 − p 5 = 0 (0.4045…) … Hexagonal 1- 2 sin(π/18) (0.6527…) … Triangular 2 sin(π/18) (0.3472…) ½ Kagomé0.5244…0.6527…

ESUG 2009 Why simulation?  Problems very hard to prove analytically  Square bond model critical probability = 0.5  Clues for a formal proof  Application to practical cases Guillermo Amaral 19

ESUG 2009 Areas of interest  Large-graph representation  Pseudo-random numbers  Graph exploration  Analysis of connected components Guillermo Amaral 20

ESUG 2009 Simulation variables Guillermo Amaral 21 Simulation height, width Lattice parameters k Pattern parameters p p V, p H Open policy parameters Estimator θ(p) Percolating cluster size Simulation running time

ESUG 2009 Simulation process Guillermo Amaral Build the model 2. Generate a “random” configuration 3. Search for percolating clusters 4. Collect results of output variables

ESUG 2009 The simulator

ESUG 2009 My experience…

ESUG 2009 Guillermo Amaral 25 Programming with a solution in mind leads to answers, but modeling the problem also raises new questions

ESUG 2009 Questions

ESUG 2009 A case of study

ESUG 2009 Scope analysis Guillermo Amaral 28  v = ( x, y )  v ’ = ( y, x )  v = ( x, y )  v ’ = ( y, x ) v’v’ v pvpv pHpH x0x0  ( x 0 ↔ v )  ( x 0 ↔ v ’ )  ( x 0 ↔ v )  ( x 0 ↔ v ’ ) If p H < p v, P ( x 0 ↔ v ) <P ( x 0 ↔ v’ ) ? If p H < p v, P ( x 0 ↔ v ) <P ( x 0 ↔ v’ ) ?

ESUG 2009 Scope analysis visualization Guillermo Amaral 29 > = Mirror coloringScale coloring

ESUG 2009 Object design

ESUG 2009 Objects (1) Guillermo Amaral 31 PercolationModel BondPercolation SitePercolation Lattice SquareLattice GraphPattern SubgraphPattern NodeBasedPattern LatticeGraph Square1KVertical1Horizontal Square1Vertical1KHorizontal … … OpenPolicy SiteOpenPolicy BondOpenPolicy IsotropicPolicy AnisotropicPolicy AdjacencySolver PatternAdjacencySolver MatrixAdjacencySolver CubicLattice SquareVerticalHorizontal … … Caesar

ESUG 2009 Objects (2) Guillermo Amaral 32 AdjacencyMatrix PSBitMatix PSFloatMatrix PSSparseMatrix PSSparseFloatMatrix GraphAlgorithm GraphSearchAlgorithm QuickUnionFind BreathFirstSearch DepthFirstSearch WeightedQuickUnionFind WQUFPC ModelSampler CriticalRangeFinder CompositeSampler NodeScopeAnalizer VariableWalker ModelEvaluator ModelHistory UnionFindAnalizer … … … … Caesar

ESUG 2009 Objects (3) Guillermo Amaral 33 PSDrawer CriticalRangeDrawer ChartDrawer SquareLatticeGraphDrawer BondPercolationGraphDrawer SitePercolationGraphDrawer PieChartDrawer XYChartDrawer ChartObject ChartAxis Chart ChartSerie RangeMark XYSerieMarker PieChar XYChart DrawerTool NodeLocator XYChartPointLocator EdgeLocator ClusterPainter Caesar