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

Slides:



Advertisements
Similar presentations
Peer-to-Peer and Social Networks Power law graphs Small world graphs.
Advertisements

$100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300.
Online Social Networks and Media Navigation in a small world.
Graph Partitioning Dr. Frank McCown Intro to Web Science Harding University This work is licensed under Creative Commons Attribution-NonCommercial 3.0Attribution-NonCommercial.
Rumors and Routes Rajmohan Rajaraman Northeastern University, Boston May 2012 Chennai Network Optimization WorkshopRumors and Routes1.
Toward an Optimal Social Network Defense Against Sybil Attacks Haifeng Yu National University of Singapore Phillip B. Gibbons Intel Research Pittsburgh.
Information Networks Small World Networks Lecture 5.
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.
4. PREFERENTIAL ATTACHMENT The rich gets richer. Empirical evidences Many large networks are scale free The degree distribution has a power-law behavior.
CSE 522 – Algorithmic and Economic Aspects of the Internet Instructors: Nicole Immorlica Mohammad Mahdian.
Networks. Graphs (undirected, unweighted) has a set of vertices V has a set of undirected, unweighted edges E graph G = (V, E), where.
Social Networks 101 P ROF. J ASON H ARTLINE AND P ROF. N ICOLE I MMORLICA.
1 Complex systems Made of many non-identical elements connected by diverse interactions. NETWORK New York Times Slides: thanks to A-L Barabasi.
Network Design IS250 Spring 2010 John Chuang. 2 Questions  What does the Internet look like? -Why do we care?  Are there any structural invariants?
1 Analyzing Kleinberg’s (and other) Small-world Models Chip Martel and Van Nguyen Computer Science Department; University of California at Davis.
Copyright © 2008 Pearson Education, Inc. Chapter 11 Probability and Calculus Copyright © 2008 Pearson Education, Inc.
CSE 522 – Algorithmic and Economic Aspects of the Internet Instructors: Nicole Immorlica Mohammad Mahdian.
Maximizing the Spread of Influence through a Social Network
P247. Figure 9-1 p248 Figure 9-2 p251 p251 Figure 9-3 p253.
1CS 6401 Peer-to-Peer Networks Outline Overview Gnutella Structured Overlays BitTorrent.
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.
On the Optimal SINR in Random Access Networks with Spatial Re-Use Navid Ehsan and R. L. Cruz UCSD.
Proof of Kleinberg’s small-world theorems
$100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300.
Analysis of Social Media MLD , LTI William Cohen
Web Science Course Lecture: Social Networks - * Dr. Stefan Siersdorfer 1 * Figures from Easley and Kleinberg 2010 (
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.
Internet Economics כלכלת האינטרנט Class 10 – it’s a small world 1.
Lecture 10 The Label Correcting Algorithm.
B Topological Network Design: Access Networks Dr. Greg Bernstein Grotto Networking
HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity Algorithms for Radio Networks Exercise 12 Stefan Rührup
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)
Social Network Analysis - Lecture 1 - Dr. Stefan Siersdorfer 1.
The new protocol of freenet Taken from Ian Clarke and Oskar Sandberg (The Freenet Project)
On-line Social Networks - Anthony Bonato 1 Dynamic Models of On-Line Social Networks Anthony Bonato Ryerson University WAW’2009 February 13, 2009 nt.
Lecture 17: Search in structured networks CS 765 Complex Networks Slides are modified from Lada Adamic.
Geog. 579: GIS and Spatial Analysis - Lecture 21 Overheads 1 Point Estimation: 3. Methods: 3.3 Local sample mean (Moving average) 3.4 Inverse distance.
Preserving Privacy and Social Influence Isabelle Stanton.
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.
Siddhartha Gunda Sorabh Hamirwasia.  Generating small world network model.  Optimal network property for decentralized search.  Variation in epidemic.
Lecture 6 – Local Search Dr. Muhammad Adnan Hashmi 1 24 February 2016.
Models and Algorithms for Complex Networks
Class 4: It’s a Small World After All Network Science: Small World February 2012 Dr. Baruch Barzel.
Topics In Social Computing (67810) Module 1 Introduction & The Structure of Social Networks.
Small-world phenomenon: An Algorithmic Perspective Jon Kleinberg.
continued on next slide
Peer-to-Peer and Social Networks
                                                                                                                                                                                                                                                
continued on next slide
continued on next slide
Social Network Analysis - Lecture 3 - *
Network Notes Ms Allan 2012 AS91260 (2.5) Designed to teach from,
Lecture Slides Elementary Statistics Twelfth Edition
Lecture Slides Elementary Statistics Twelfth Edition
Proof of Kleinberg’s small-world theorems
Artificial Intelligence
Social Network Analysis - Lecture 2 - *
Modelling and Searching Networks Lecture 2 – Complex Networks
Navigation and Propagation in Networks
continued on next slide
Uniform Probability Distribution
Algorithms Lecture # 26 Dr. Sohail Aslam.
continued on next slide
Presentation transcript:

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

Milgram Experiment: Results 2

Small Wold: MS Instant Messenger 3

Watts-Strogatz Model (1) 4

Watts-Strogatz Model (2) 5

Decentralized Search 6

Modelling Decentralized Search Idea: probability of random edge beteen nodes v and w decay with distance: ~ d(v,w) -q 7

What‘s the best q for decentralized search? 8

Spatial Distribution of LiveJournal Users 9

Optimal Exponent: LiveJournal Experiment 10

Feedback: Privacy Policy Feedback
Do Not Sell My Personal Information
About project: SlidePlayer Terms of Service

© 2025 SlidePlayer.com. Inc. All rights reserved.