Presentation is loading. Please wait.

Presentation is loading. Please wait.

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

Published byDorothy Barber Modified over 8 years ago

Similar presentations

Presentation on theme: "Social Network Analysis - Lecture 11 - * Dr. Stefan Siersdorfer 1 * Figures and Examples in Slides from Easley and Kleinberg 2010."— Presentation transcript:

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

2 Milgram Experiment: Results 2

3 Small Wold: MS Instant Messenger 3

4 Watts-Strogatz Model (1) 4

5 Watts-Strogatz Model (2) 5

6 Decentralized Search 6

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

8 What‘s the best q for decentralized search? 8

9 Spatial Distribution of LiveJournal Users 9

10 Optimal Exponent: LiveJournal Experiment 10

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

Similar presentations

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

Peer-to-Peer and Social Networks Power law graphs Small world graphs.
$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.

$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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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?

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.

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.

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.

CSE 522 – Algorithmic and Economic Aspects of the Internet Instructors: Nicole Immorlica Mohammad Mahdian.
Maximizing the Spread of Influence through a Social Network

Maximizing the Spread of Influence through a Social Network

Similar presentations

Ads by Google