Stochastic Simulations Six degrees of Kevin Bacon.

Slides:



Advertisements
Similar presentations
Performance in Decentralized Filesharing Networks Theodore Hong Freenet Project.
Advertisements

Peer-to-Peer and Social Networks Power law graphs Small world graphs.
Complex Networks Advanced Computer Networks: Part1.
Complex Networks Luis Miguel Varela COST meeting, Lisbon March 27 th 2013.
‘Small World’ Networks (An Introduction) Presenter : Vishal Asthana
Small-world networks.
Collective Dynamics of ‘Small World’ Networks C+ Elegans: Ilhan Savut, Spencer Telford, Melody Lim 29/10/13.
Random variables 1. Note  there is no chapter in the textbook that corresponds to this topic 2.
SE503 Advanced Project Management Dr. Ahmed Sameh, Ph.D. Professor, CS & IS Project Uncertainty Management.
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.
Materials for Lecture 11 Chapters 3 and 6 Chapter 16 Section 4.0 and 5.0 Lecture 11 Pseudo Random LHC.xls Lecture 11 Validation Tests.xls Next 4 slides.
CSE 522 – Algorithmic and Economic Aspects of the Internet Instructors: Nicole Immorlica Mohammad Mahdian.
Network Models Social Media Mining. 2 Measures and Metrics 2 Social Media Mining Network Models Why should I use network models? In may 2011, Facebook.
Scale-free networks Péter Kómár Statistical physics seminar 07/10/2008.
Small-World Graphs for High Performance Networking Reem Alshahrani Kent State University.
Small Worlds Presented by Geetha Akula For the Faculty of Department of Computer Science, CALSTATE LA. On 8 th June 07.
Small-World File-Sharing Communities Adriana Iamnitchi, Matei Ripeanu and Ian Foster,
Monte Carlo Simulation Methods - ideal gas. Calculating properties by integration.
Using Structure Indices for Efficient Approximation of Network Properties Matthew J. Rattigan, Marc Maier, and David Jensen University of Massachusetts.
CS 728 Lecture 4 It’s a Small World on the Web. Small World Networks It is a ‘small world’ after all –Billions of people on Earth, yet every pair separated.
Stochastic Simulations Six degrees of Kevin Bacon.
Materials for Lecture 12 Chapter 7 – Study this closely Chapter 16 Sections and 4.3 Lecture 12 Multivariate Empirical Dist.xls Lecture 12 Multivariate.
Statistics.
Advanced Topics in Data Mining Special focus: Social Networks.
1 Algorithms for Large Data Sets Ziv Bar-Yossef Lecture 7 May 14, 2006
CSCE Monte Carlo Methods When you can’t do the math, simulate the process with random numbers Numerical integration to get areas/volumes Particle.
Materials for Lecture 18 Chapter 7 – Study this closely Chapter 16 Sections and 4.3 Lecture 18 Multivariate Empirical Dist.xlsx Lecture 18.
Lecture II-2: Probability Review
Lecture (16) Introduction to Stochastic Hydrology.
Random Graph Models of Social Networks Paper Authors: M.E. Newman, D.J. Watts, S.H. Strogatz Presentation presented by Jessie Riposo.
Graph Theory in 50 minutes. This Graph has 6 nodes (also called vertices) and 7 edges (also called links)
A SCALABLE LIBRARY FOR PSEUDORANDOM NUMBER GENERATION ALGORITHM 806: SPRNG.
Section 8 – Ec1818 Jeremy Barofsky March 31 st and April 1 st, 2010.
MA3264 Mathematical Modelling Lecture 6 Monte Carlo Simulation.
Network properties Slides are modified from Networks: Theory and Application by Lada Adamic.
Montecarlo Simulation LAB NOV ECON Montecarlo Simulations Monte Carlo simulation is a method of analysis based on artificially recreating.
Small World Social Networks With slides from Jon Kleinberg, David Liben-Nowell, and Daniel Bilar.
Small-world networks. What is it? Everyone talks about the small world phenomenon, but truly what is it? There are three landmark papers: Stanley Milgram.
Module 1: Statistical Issues in Micro simulation Paul Sousa.
Random Numbers and Simulation  Generating truly random numbers is not possible Programs have been developed to generate pseudo-random numbers Programs.
Valuation of Asian Option Qi An Jingjing Guo. CONTENT Asian option Pricing Monte Carlo simulation Conclusion.
Monte Carlo Methods Versatile methods for analyzing the behavior of some activity, plan or process that involves uncertainty.
Gennaro Cordasco - How Much Independent Should Individual Contacts be to Form a Small-World? - 19/12/2006 How Much Independent Should Individual Contacts.
APPENDIX D R ANDOM N UMBER G ENERATION Organization of chapter in ISSO* – General description and linear congruential generators Criteria for “good” random.
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.
ITEC 2620A Introduction to Data Structures Instructor: Prof. Z. Yang Course Website: 2620a.htm Office: TEL 3049.
Random Dot Product Graphs Ed Scheinerman Applied Mathematics & Statistics Johns Hopkins University IPAM Intelligent Extraction of Information from Graphs.
Lecture 10: Network models CS 765: Complex Networks Slides are modified from Networks: Theory and Application by Lada Adamic.
Machine Design Under Uncertainty. Outline Uncertainty in mechanical components Why consider uncertainty Basics of uncertainty Uncertainty analysis for.
Most of contents are provided by the website Network Models TJTSD66: Advanced Topics in Social Media (Social.
Stochastic Simulations Six degrees of Kevin Bacon.
1 Friends and Neighbors on the Web Presentation for Web Information Retrieval Bruno Lepri.
March 3, 2009 Network Analysis Valerie Cardenas Nicolson Assistant Adjunct Professor Department of Radiology and Biomedical Imaging.
Small World Social Networks With slides from Jon Kleinberg, David Liben-Nowell, and Daniel Bilar.
Performance Evaluation Lecture 1: Complex Networks Giovanni Neglia INRIA – EPI Maestro 10 December 2012.
EMIS 7300 SYSTEMS ANALYSIS METHODS FALL 2005 Dr. John Lipp Copyright © 2005 Dr. John Lipp.
Module 9.2 Simulations. Computer simulation Having computer program imitate reality, in order to study situations and make decisions Applications?
Network (graph) Models
Lecture 23: Structure of Networks
Structures of Networks
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama
Lecture 1: Complex Networks
Lecture 23: Structure of Networks
Network Science: A Short Introduction i3 Workshop
The Watts-Strogatz model
Lecture 2 – Monte Carlo method in finance
Connectivity Section 10.4.
Lecture 23: Structure of Networks
Lecture 9: Network models CS 765: Complex Networks
Other Random Graph Models
Presentation transcript:

Stochastic Simulations Six degrees of Kevin Bacon

Outline Announcements: –Homework II: due Today. by 5, by Discuss on Friday. –Homework III: on web Cookie Challenge Monte Carlo Simulations Random Numbers Example--Small Worlds

Homework III For HW IV--you will create your own programming assignment. –Develop a solution (function or two) to a particular problem –Pick something relevant to you! For HW III –Define your problem –Will give me a chance to comment

Monte Carlo Monte Carlo methods refer to any procedure that uses random numbers Monte Carlo methods are inherently statistical (probabilistic) Used in every field –Galaxy formation –Population model –Economics –Computer algorithms

Monte Carlo Example Have a computer model which computes price of corn in Omaha using rainfall. –You have a forecast of rainfall for next few months from NWS –Forecast is rain +/- SE How can you incorporate uncertainty of rainfall into your forecast of prices? –Want $ +/- SE Model rain 1 rain 2 rain 3 $1$1 $2$2 $3$3

Monte Carlo Example 1. Create several random forecast rainfall series –mean of the series is the forecast –SE of series is the forecast SE 2. Compute prices 3. Calculate SE of prices. Model rain 1 rain 2 rain 3 $1$1 $2$2 $3$3 Model rain 1 rain 2 rain 3 $1$1 $2$2 $3$3 Model rain 1 rain 2 rain 3 $1$1 $2$2 $3$3

Random Numbers Computers are deterministic –Therefore, computers generate “pseudo-random” numbers Matlab’s random numbers are “good” –“The uniform random number generator in MATLAB 5 uses a lagged Fibonacci generator, with a cache of 32 floating point numbers, combined with a shift register random integer generator.” – shtmlhttp:// shtml

Random functions rand(m,n) produces m-by-n matrix of uniformly distributed random numbers [0,1] randn(m,n) produces random numbers normally distributed with mean=0 and std=1 randperm(n) is a random permutation of integers [1:n] –I=randperm(n); B=A(I,:) scrambles the rows of A

Seeds Random number generators are usually recurrence equations: –r(n)=F(r(n-1)) Must provide an initial value r(0) –Matlab’s random functions are seeded at startup, but THE SEED IS THE SAME EVERY TIME! –Initialize seed with rand( 'state', sum(100*clock) ) –How would you ensure rand is always random?

Monte Carlo Example 1. Create several random forecast rainfall series –rain, rainerr--n-by-1 vectors of rain forecasts and SE –P=randn(n,p) –randrain=P*(rainerr*ones(1,p))+(rain*ones(1,p)) 2. Compute prices –for j=1:p;prices(:,j)=Model(randrain(:,j));end 3. Calculate SE of prices. –priceerr=std(prices,2)/sqrt(p); –pricemn=mean(prices,2);

It’s a Small, Small World Watts & Strogatz (1998) Nature, 393: Complicated systems can be viewed as graphs –describe how components are connected

Example: Six Degrees of Kevin Bacon Components (vertices) are actors Connections (edges) are movies Hypothesis: 6 or fewer links separate Kevin Bacon from all other actors. –“Oracle of Bacon” at

Sir Ian McKellen Andy Serkis Lord of the Rings GI Jane Viggo Mortensen Example: Kevin Bacon & Gollum A Few Good Men Jack Nicholson Demi Moore Kevin

Other Systems Power Grid Food Webs Nervous system of Caenorhabditis elegans Goal is to learn about these systems by studying their graphs Many of these systems are “Small Worlds”--only a few links separate any two points

Watts & Strogatz Can organize graphs on a spectrum from ordered to random How do graph properties change across this spectrum? –L=mean path length (# links between points) –C=cluster coefficient (“lumpiness”) Used a Monte-Carlo approach--created lots of graphs along spectrum and computed L and C

Watts & Strogatz Creating the graphs n=# of vertices, k=number of edges/vertex Start with a regular ring lattice and change edges at random with probability p For every p, compute stats for many graphs

Small Worlds in Matlab G=createlattice(n,k,p) –creates a lattice--represented as a sparse matrix [L,C]=latticestats(G) –computes the path length and clustering stats [L,C]=SmallWorldsEx(n,k,P,N) –Creates N graphs for every P(j) and saves the mean stats in L(j) and C(j) plotlattice(G) –Plots a lattice