Computational methods in physics

Slides:



Advertisements
Similar presentations
Chapter 8 Geocomputation Part A:
Advertisements

Stochastic Simulations Monday, 9/9/2002 Monte Carlo simulations are generally concerned with large series of computer experiments using uncorrelated random.
Game of Life in 21 st Century ECE817 Presentation By Kyusik Chung
Cellular Automata: Life with Simple Rules
Game of Life Rules and Games Linh Tran ECE 573. What is Life? Life is just one example of a cellular automaton, which is any system in which rules are.
CITS4403 Computational Modelling Game of Life. One of the first cellular automata to be studied, and probably the most popular of all time, is a 2-D CA.
1 The Game of Life Supplement 2. 2 Background The Game of Life was devised by the British mathematician John Horton Conway in More sophisticated.
University of Buffalo The State University of New York Spatiotemporal Data Mining on Networks Taehyong Kim Computer Science and Engineering State University.
Cellular Automata (Reading: Chapter 10, Complexity: A Guided Tour)
1 Chapter 13 Artificial Life: Learning through Emergent Behavior.
CELLULAR AUTOMATON Presented by Rajini Singh.
CELLULAR AUTOMATA Derek Karssenberg, Utrecht University, the Netherlands LIFE (Conway)
Joanne Turner 15 Nov 2005 Introduction to Cellular Automata.
Hilton’s Game of Life (HGL) A theoretical explanation of the phenomenon “life” in real nature. Hilton Tamanaha Goi Ph.D. 1st Year, KAIST, Dept. of EECS.
Cellular Automata Orit Moskovich
Cellular Automata This is week 7 of Biologically Inspired Computing Various credits for these slides, which have in part been adapted from slides by:
Cellular Automata Avi Swartz 2015 UNC Awards Ceremony.
Nawaf M Albadia Introduction. Components. Behavior & Characteristics. Classes & Rules. Grid Dimensions. Evolving Cellular Automata using Genetic.
Parallelization: Conway’s Game of Life. Cellular automata: Important for science Biology – Mapping brain tumor growth Ecology – Interactions of species.
Absorbing Phase Transitions
The Role of Artificial Life, Cellular Automata and Emergence in the study of Artificial Intelligence Ognen Spiroski CITY Liberal Studies 2005.
Multiscale Modelling Mateusz Sitko
CS 484 – Artificial Intelligence1 Announcements Lab 4 due today, November 8 Homework 8 due Tuesday, November 13 ½ to 1 page description of final project.
1 Cellular Automata and Applications Ajith Abraham Telephone Number: (918) WWW:
Centre for Advanced Spatial Analysis (CASA), UCL, 1-19 Torrington Place, London WC1E 6BT, UK web Talk.
1 Chapter 13 Artificial Life: Learning through Emergent Behavior.
Activity 2-1: The Game of Life
Playing God: The Engineering of Functional Designs in the Game of Life Liban Mohamed Computer Systems Research Lab
CELLULAR AUTOMATA A Presentation By CSC. OUTLINE History One Dimension CA Two Dimension CA Totalistic CA & Conway’s Game of Life Classification of CA.
Research Into the Time Reversal of Cellular Automata Team rm -rf / Daniel Kaplun, Dominic Labanowski, Alex Lesman.
Cellular Automata Martijn van den Heuvel Models of Computation June 21st, 2011.
The Game of Life Erik Amelia Amy. What is the “Game of Life?” The “Game of Life” (often referred to as Life) is not your typical game. There are no actual.
The Science of Complexity J. C. Sprott Department of Physics University of Wisconsin - Madison Presented to the First National Conference on Complexity.
Time-dependent Schrodinger Equation Numerical solution of the time-independent equation is straightforward constant energy solutions do not require us.
Cellular Automata Introduction  Cellular Automata originally devised in the late 1940s by Stan Ulam (a mathematician) and John von Neumann.  Originally.
PROTEIN FOLDING: H-P Lattice Model 1. Outline: Introduction: What is Protein? Protein Folding Native State Mechanism of Folding Energy Landscape Kinetic.
Intro to Life32. 1)Zoom to 10 That will allow you to see the grid and individual cells.
Conway’s Game of Life Jess Barak Game Theory. History Invented by John Conway in 1970 Wanted to simplify problem from 1940s presented by John von Neumann.
1 1 2 What is a Cellular Automaton? A one-dimensional cellular automaton (CA) consists of two things: a row of "cells" and a set of "rules". Each of.
Cellular Automata and Music
Elementary cellular automata
Intro to Life32.
Chaotic Behavior - Cellular automata
Spatio-Temporal Information for Society Münster, 2014
Theory of nonlinear dynamic systems Practice 12
Cellular automata.
Hiroki Sayama NECSI Summer School 2008 Week 3: Methods for the Study of Complex Systems Cellular Automata Hiroki Sayama
Introduction Abstract
Pedro Ribeiro de Andrade Münster, 2013
Computational Models.
Discrete diffusion modeling
A Cellular Automata Approach to Population Modeling
Illustrations of Simple Cellular Automata
Complex Systems Engineering SwE 488 Artificial Complex Systems
Cellular Automata + Reaction-Diffusion Systems
Topic 26 Two Dimensional Arrays
Computer simulation of cell aggregation & growth on a tissue scaffold
Cellular Automata.
Spatio-temporal information in society: cellular automata
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Cellular Automata Hiroki Sayama
Excursions into Logic Based Computation using Conway’s Game of Life
Homework #5 — Monte Carlo Simulation
The Engineering of Functional Designs in the Game of Life
Modeling Pattern Formation in Skin Diseases by a Cellular Automaton
A Cellular Automata Approach to Population Modeling
Von Neumann’s Automaton and Viruses
Activity 2-1: The Game of Life
Cellular Automata (CA) Overview
2D Array and Matrix Application: Game of Life
The Formation of a Packard Snowflake
Presentation transcript:

Computational methods in physics

1 Introduction to Lattice Models Introduction to Easy Java Simulations software 2 Deterministic cellular automata Conway model 3 Monte-Carlo method Ising model 4 Random and self-avoiding walk Brownian motion and diffusion 5 Percolation theory Site square model 6 Pattern and dendrite growth Diffusion limited aggregation model Colouring model 7 Protein folding HP (hydrophobic-polar) model

Deterministic cellular automata Conway model

Introduction to Lattice Models Introduction to Easy Java Simulations software

Period 1

Life objects: Still life Oscilators Gliders Exponential growth Can simulate: Nuclear chain reaction Spread of forest fire Plague or epidemic Cellular automata characteristics: Parallelism: every cell is updated simultaneously Homogeneity: every cell is updated using the same rules Localism: every cell is updated based upon its neighbors Book online: S.Wolfram – A new kind of science https://www.wolframscience.com/nksonline/toc.html

Moore Neighborhood   Van Neumann Neighborhood Boundary conditions Right: Cells beyond the grid boundary Left: toroidal topology are always treated as if they were dead.

Homework 1: Use cellLattice to color your squares from 1 to 8 depending on the number of neighbours.

Homework 2: Find all 3x3 “creatures” (total number 2^18=262.144 ) and find the number of creatures (up to vertical, horizontal, diagonal mirror symmetry): * Stable - Patterns that do not change over time * Oscillators - Patterns that change over time but repeat themselves every n cycles. * Flyers - Patterns that essentially stay the same over time but move across the board like a bird or spaceship. Other patterns - Discover your own type of pattern Homework 3: Find the lifespans of 3x3 “creatures” classified to Other patterns. Find methuselahs with long lifespan Lifespan – number of generations until the pattern dies or becomes stable, oscillator or flyer.  R-pentomimo with 1103 generations

Statistics N.Johnston toroidal 20x20 lattice Density=initial nr.alive cells/400 13.520 random chosen initial states 175.000 random chosen initial states Longest lifespan 2092 Homework 4: For all 3x3 “creatures” find: Lifespan vs. density Lifespan frequency histogram

Survive if two or three cells are alive B36/S23 – High Life Homework 5: Explore other rules B3/S23 Conway Game of life – Born when 3 cells alive, Survive if two or three cells are alive B36/S23 – High Life B2/S –Seeds B23/S3 –Reversed GOL B02468/S02468 – Evens B3678/S34678 – Day and night B3/S12345 – Maze B45678/S2345 – Walled cities

Forest Fire

Other: couple – distance 1  quarantine type A couple – distance 1  quarantine type B coworkers- distance 2

Real and simulated epidemic results for the SARS outbreak in Singapore 2003

Game of Plague: The four key quantities are the infectivity (the rate at which the disease spreads), latency, (how long before it becomes active in the host), duration (how long it remains in the host and mortality (the percentage of people the disease kills)