Siddhartha Gunda Sorabh Hamirwasia.  Generating small world network model.  Optimal network property for decentralized search.  Variation in epidemic.

Slides:

Advertisements

Similar presentations

Probability in Propagation

Advertisements

Uninformed search strategies

The Small World Phenomenon: An Algorithmic Perspective Speaker: Bradford Greening, Jr. Rutgers University – Camden.

1 Analyzing Kleinberg’s Small-world Model Chip Martel and Van Nguyen Computer Science Department; University of California at Davis.

Small-world networks.

Modeling Malware Spreading Dynamics Michele Garetto (Politecnico di Torino – Italy) Weibo Gong (University of Massachusetts – Amherst – MA) Don Towsley.

Quiz 4-26-’07 Search.

Online Social Networks and Media Navigation in a small world.

Information Networks Failures and Epidemics in Networks Lecture 12.

Rumors and Routes Rajmohan Rajaraman Northeastern University, Boston May 2012 Chennai Network Optimization WorkshopRumors and Routes1.

Algorithmic and Economic Aspects of Networks Nicole Immorlica.

Modeling and Analysis of Random Walk Search Algorithms in P2P Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE, Rensselaer Polytechnic Institute.

What did we see in the last lecture?. What are we going to talk about today? Generative models for graphs with power-law degree distribution Generative.

Information Networks Small World Networks Lecture 5.

Identity and search in social networks Presented by Pooja Deodhar Duncan J. Watts, Peter Sheridan Dodds and M. E. J. Newman.

Lecture 7 CS 728 Searchable Networks. Errata: Differences between Copying and Preferential Attachment In generative model: let p k be fraction of nodes.

CS 599: Social Media Analysis University of Southern California1 The Basics of Network Analysis Kristina Lerman University of Southern California.

Company LOGO 1 Identity and Search in Social Networks D.J.Watts, P.S. Dodds, M.E.J. Newman Maryam Fazel-Zarandi.

Farnoush Banaei-Kashani and Cyrus Shahabi Criticality-based Analysis and Design of Unstructured P2P Networks as “ Complex Systems ” Mohammad Al-Rifai.

Dave Lattanzi’s RRT Algorithm. General Concept Use dictionaries for trees Create a randomized stack of nodes Iterate through stack “Extend” each tree.

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.

UnInformed Search What to do when you don’t know anything.

CSE 522 – Algorithmic and Economic Aspects of the Internet Instructors: Nicole Immorlica Mohammad Mahdian.

Small World Networks Somsubhra Sharangi Computing Science, Simon Fraser University.

Secure routing for structured peer-to-peer overlay networks (by Castro et al.) Shariq Rizvi CS 294-4: Peer-to-Peer Systems.

(hyperlink-induced topic search)

1 Algorithms for Large Data Sets Ziv Bar-Yossef Lecture 7 May 14, 2006

Lecture 18: Small World Networks CS 790g: Complex Networks

It’s a Small World After All Kim Dressel - The small world phenomenon Please hold applause until the end of the presentation. Angie Heimkes Eric Larson.

Online Social Networks and Media Epidemics and Influence.

Author: M.E.J. Newman Presenter: Guoliang Liu Date:5/4/2012.

Proof of Kleinberg’s small-world theorems

Rate-based Data Propagation in Sensor Networks Gurdip Singh and Sandeep Pujar Computing and Information Sciences Sanjoy Das Electrical and Computer Engineering.

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.

V5 Epidemics on networks

CCAN: Cache-based CAN Using the Small World Model Shanghai Jiaotong University Internet Computing R&D Center.

1 Mobility Increases the Capacity of Ad-hoc Wireless Networks Matthias Grossglauser, David Tse IEEE Infocom 2001 (Best paper award) Oct 21, 2004 Som C.

Gennaro Cordasco - How Much Independent Should Individual Contacts be to Form a Small-World? - 19/12/2006 How Much Independent Should Individual Contacts.

Online Social Networks and Media

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.

Navigation in small worlds Social Networks: Models and Applications Seminar Toronto, Fall 2007 (based on a presentation by Stratis Ioannidis)

InterConnection Network Topologies to Minimize graph diameter: Low Diameter Regular graphs and Physical Wire Length Constrained networks Nilesh Choudhury.

The new protocol of freenet Taken from Ian Clarke and Oskar Sandberg (The Freenet Project)

Social Network Analysis - Lecture 11 - * Dr. Stefan Siersdorfer 1 * Figures and Examples in Slides from Easley and Kleinberg 2010.

MMAC: A Mobility- Adaptive, Collision-Free MAC Protocol for Wireless Sensor Networks Muneeb Ali, Tashfeen Suleman, and Zartash Afzal Uzmi IEEE Performance,

The Structure of the Web. Getting to knowing the Web How big is the web and how do you measure it? How many people use the web? How many use search engines?

SybilGuard: Defending Against Sybil Attacks via Social Networks.

 Probability in Propagation. Transmission Rates  Models discussed so far assume a 100% transmission rate to susceptible individuals (e.g. Firefighter.

CPSC 322, Lecture 6Slide 1 Uniformed Search (cont.) Computer Science cpsc322, Lecture 6 (Textbook finish 3.5) Sept, 17, 2012.

Biologically Inspired Computation Ant Colony Optimisation.

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.

NETWORK FLOWS Shruti Aggrawal Preeti Palkar. Requirements 1.Implement the Ford-Fulkerson algorithm for computing network flow in bipartite graphs. 2.For.

Distributed, Self-stabilizing Placement of Replicated Resources in Emerging Networks Bong-Jun Ko, Dan Rubenstein Presented by Jason Waddle.

1 Lecture 16 Epidemics University of Nevada – Reno Computer Science & Engineering Department Fall 2015 CS 791 Special Topics: Network Architectures and.

Models and Algorithms for Complex Networks

SCHOOL OF ENGINEERING AND ADVANCED TECHNOLOGY Engineering Project Routing in Small-World Networks.

Class 4: It’s a Small World After All Network Science: Small World February 2012 Dr. Baruch Barzel.

Biao Wang 1, Ge Chen 1, Luoyi Fu 1, Li Song 1, Xinbing Wang 1, Xue Liu 2 1 Shanghai Jiao Tong University 2 McGill University

Incrementally Improving Lookup Latency in Distributed Hash Table Systems Hui Zhang 1, Ashish Goel 2, Ramesh Govindan 1 1 University of Southern California.

Genetic Algorithm(GA)

Small-world phenomenon: An Algorithmic Perspective Jon Kleinberg.

Distributed voting application for handheld devices

Identity and Search in Social Networks

Peer-to-Peer and Social Networks

Department of Computer Science University of York

Proof of Kleinberg’s small-world theorems

Navigation and Propagation in Networks

Presentation transcript:

Siddhartha Gunda Sorabh Hamirwasia

 Generating small world network model.  Optimal network property for decentralized search.  Variation in epidemic dynamics with structure of network.

 What is small world network model ?  Watts-Strogatz vs Kleinberg’s Model.  BFS vs Decentralized search.

2D latticeKleinberg’s Model

 Step 1- Select source and target node randomly.  Step 2 – Send message using decentralized search.  At each node find neighbor nearest to the target.  Pass message to the neighbor found above.  Repeat till message reaches target node.  Compute hops required.  Step 3 - Repeat Step1and Step2 for N cycles.  Step 4 - Calculate average number of hops.

Parameters:  Lattice dimension = 2, Number of Nodes/dimension = 100, Number of iterations =  For same value of r, decrease in q results in increase in average path length.  For different values of r, optimal average length is found at r = 2.

 Epidemic Models.  Branching Model.  SIS Model  SIR Model  SIRS Model  SIRS over SIR

 Step 1 – Generate Kleinberg’s graph.  Step 2 – Simulate SIRS algorithm.  If state = Susceptible Check if node can get infection. If yes change the state to infected.  If state = Infected Check if T I expires. If yes change the state to recovery.  If state = Recovered Check if T R expires. If yes change the state to susceptible.  Step 3 – Store number of infected nodes.  Step 4 – Repeat above steps for N cycles.

1000 Cycles

 ‘r=0’ means uniform probability. Behavior same as Watts-Strogatz Model.  For constant “q”, Decrease in “r” results in increase in “p” for same distance. Hence high synchronization.  For constant “r”, Decrease in “q” results in decrease in “p”. Hence low synchronization.

 [1] Jon Kleinberg. The small-world phenomenon: an algorithmic perspective. In Proc.32nd ACM Symposium on Theory of Computing, pages 163–170,  [2] Marcelo Kuperman and Guillermo Abramson. Small world effect in an epidemiological model. Physical Review Letters, 86(13):2909– 2912, March 2001.

Questions ?

Thank You!