1 Social networks Small world networks. TU/e - 0ZM05/0EM15/0A150 2 Course aim knowledge about concepts in network theory, and being able to apply that.

Slides:



Advertisements
Similar presentations
Six degrees: The science of a connected age By Duncan J. Watts Brian Lewis INF 385Q December 1, 2005 Brian Lewis INF 385Q December 1, 2005.
Advertisements

Peer-to-Peer and Social Networks Power law graphs Small world graphs.
Complex Networks Advanced Computer Networks: Part1.
Scale Free Networks.
Small-world networks.
P2P Topologies Centralized Ring Hierarchical Decentralized Hybrid.
Information Networks Small World Networks Lecture 5.
Advanced Topics in Data Mining Special focus: Social Networks.
CS 599: Social Media Analysis University of Southern California1 The Basics of Network Analysis Kristina Lerman University of Southern California.
CSE 522 – Algorithmic and Economic Aspects of the Internet Instructors: Nicole Immorlica Mohammad Mahdian.
Emergence of Scaling in Random Networks Barabasi & Albert Science, 1999 Routing map of the internet
1 Social networks Small world networks. TU/e - 0ZM05/0EM15/0A150 2 Course aim knowledge about concepts in network theory, and being able to apply that.
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.
Small Worlds Presented by Geetha Akula For the Faculty of Department of Computer Science, CALSTATE LA. On 8 th June 07.
How to Sell It Practical Sales Techniques for QRC’s Presented to the QRCA DC chapter April, 2011 –Jay Zaltzman.
1 Complex systems Made of many non-identical elements connected by diverse interactions. NETWORK New York Times Slides: thanks to A-L Barabasi.
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.
Advanced Topics in Data Mining Special focus: Social Networks.
1 Algorithms for Large Data Sets Ziv Bar-Yossef Lecture 7 May 14, 2006
Network analysis and applications Sushmita Roy BMI/CS 576 Dec 2 nd, 2014.
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.
Large-scale organization of metabolic networks Jeong et al. CS 466 Saurabh Sinha.
Optimization Based Modeling of Social Network Yong-Yeol Ahn, Hawoong Jeong.
(Social) Networks Analysis III Prof. Dr. Daning Hu Department of Informatics University of Zurich Oct 16th, 2012.
Topic 13 Network Models Credits: C. Faloutsos and J. Leskovec Tutorial
Graph Theory in 50 minutes. This Graph has 6 nodes (also called vertices) and 7 edges (also called links)
(with an emphasis on innovation and alliances)
1 Innovation in networks and alliance management Lecture 3 Small world networks & Trust.
1 Part 1 – Trust. 2 Trust is a Honda Accord As opposed to: "Existentialist trust" Reliance on...
Jure Leskovec Computer Science Department Cornell University / Stanford University Joint work with: Eric Horvitz, Michael Mahoney,
Section 8 – Ec1818 Jeremy Barofsky March 31 st and April 1 st, 2010.
Small World Social Networks With slides from Jon Kleinberg, David Liben-Nowell, and Daniel Bilar.
Principles of Social Network Analysis. Definition of Social Networks “A social network is a set of actors that may have relationships with one another”
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.
Clustering of protein networks: Graph theory and terminology Scale-free architecture Modularity Robustness Reading: Barabasi and Oltvai 2004, Milo et al.
1 Innovation in networks and alliance management Small world networks.
COLOR TEST COLOR TEST. Social Networks: Structure and Impact N ICOLE I MMORLICA, N ORTHWESTERN U.
Complex Networks First Lecture TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA TexPoint fonts used in EMF. Read the.
Shi Zhou University College London Second-order mixing in networks Shi Zhou University College London.
Part 1: Biological Networks 1.Protein-protein interaction networks 2.Regulatory networks 3.Expression networks 4.Metabolic networks 5.… more biological.
Professor Yashar Ganjali Department of Computer Science University of Toronto
1 Innovation networks and alliance management Lecture 3 Small world networks & Trust.
Complex Network Theory – An Introduction Niloy Ganguly.
Class 9: Barabasi-Albert Model-Part I
Lecture 10: Network models CS 765: Complex Networks Slides are modified from Networks: Theory and Application by Lada Adamic.
Complex Network Theory – An Introduction Niloy Ganguly.
Most of contents are provided by the website Network Models TJTSD66: Advanced Topics in Social Media (Social.
What Is A Network? (and why do we care?). An Introduction to Network Theory | Kyle Findlay | SAMRA 2010 | 2 “A collection of objects (nodes) connected.
CS:4980:0005 Peer-to-Peer and Social Networks Fall 2015 Introduction.
1 Innovation in networks and alliance management Lecture 3 Small world networks & Trust.
An Effective Method to Improve the Resistance to Frangibility in Scale-free Networks Kaihua Xu HuaZhong Normal University.
1 Innovation in networks and alliance management Small world networks & Trust.
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.
Teachers Teaching With Technology 2010 Annual Meeting - Atlanta, GA Ray Barton, Olympus High, SLC, UT.
Information Retrieval Search Engine Technology (10) Prof. Dragomir R. Radev.
Class 4: It’s a Small World After All Network Science: Small World February 2012 Dr. Baruch Barzel.
Hierarchical Organization in Complex Networks by Ravasz and Barabasi İlhan Kaya Boğaziçi University.
Netlogo demo. Complexity and Networks Melanie Mitchell Portland State University and Santa Fe Institute.
Topics In Social Computing (67810) Module 1 Introduction & The Structure of Social Networks.
Algorithms and Computational Biology Lab, Department of Computer Science and & Information Engineering, National Taiwan University, Taiwan Network Biology.
Social Networks Some content from Ding-Zhu Du, Lada Adamic, and Eytan Adar.
Lecture 23: Structure of Networks
Structures of Networks
Peer-to-Peer and Social Networks
Lecture 23: Structure of Networks
Peer-to-Peer and Social Networks Fall 2017
Lecture 23: Structure of Networks
Lecture 9: Network models CS 765: Complex Networks
Navigation and Propagation in Networks
Presentation transcript:

1 Social networks Small world networks

TU/e - 0ZM05/0EM15/0A150 2 Course aim knowledge about concepts in network theory, and being able to apply that knowledge

TU/e - 0ZM05/0EM15/0A150 3 The setup in some more detail Network theory and background - Introduction: what are they, why important … - Four basic network arguments - Kinds of network data (collection) - Small world networks - Business networks

TU/e - 0ZM05/0EM15/0A150 Two approaches to network theory Bottom up (let’s try to understand network characteristics and arguments) as in … “Four network arguments” by Matzat (lecture 2) Top down (let’s have a look at many networks, and try to deduce what is happening from what we see) as in “small world networks” (now) 4

TU/e - 0ZM05/0EM15/0A150 What kind of structures do networks have, empirically? Answer: often “small-world”, and often also “scale-free” 5

TU/e - 0ZM05/0EM15/0A150 3 important network properties Average Path Length (APL) ( ) Shortest path between two nodes i and j of a network, averaged across all (pairs of) nodes Clustering coefficient (“cliquishness”) Number of closed triplets / Total number of triplets (= probability that two of my ties are connected) (Shape of the) degree distribution A distribution is “scale free” when P(k), the proportion of nodes with degree k follows this formula, for some value of gamma: 6

TU/e - 0ZM05/0EM15/0A150 7 Example 1 - Small world networks NOTE - Edge of network theory - Not fully understood yet … - … but interesting findings

TU/e - 0ZM05/0EM15/0A150 Enter: Stanley Milgram ( ) Remember him? 8

TU/e - 0ZM05/0EM15/0A150 9 The small world phenomenon – Milgram´s (1967) original study Milgram sent packages to several (60? 160?) people in Nebraska and Kansas. Aim was “get this package to ” Rule: only send this package to someone whom you know on a first name basis. Aim: try to make the chain as short as possible. Result: average length of a chain is only six “six degrees of separation”

TU/e - 0ZM05/0EM15/0A Milgram’s original study (2) An urban myth?  Milgram used only part of the data, actually mainly the ones supporting his claim  Many packages did not end up at the Boston address  Follow up studies typically small scale

TU/e - 0ZM05/0EM15/0A The small world phenomenon (cont.) “Small world project” has been testing this assertion (not anymore, see to, otherwise same rules. Addresses were American college professor, Indian technology consultant, Estonian archival inspector, … Conclusion:  Low completion rate (384 out of 24,163 = 1.5%)  Succesful chains more often through professional ties  Succesful chains more often through weak ties (weak ties mentioned about 10% more often)  Chain size 5, 6 or 7.

TU/e - 0ZM05/0EM15/0A150 Some Milgram follow-ups… !

TU/e - 0ZM05/0EM15/0A150 13

TU/e - 0ZM05/0EM15/0A The Kevin Bacon experiment – Tjaden ( +/- 1994) Actors = actors Ties = “has played in a movie with”

TU/e - 0ZM05/0EM15/0A The Kevin Bacon game Can be played at: Kevin Bacon number (data might have changed by now) Jack Nicholson:1 (A few good men) Robert de Niro:1 (Sleepers) Rutger Hauer (NL):2 [Nick Stahl] Famke Janssen (NL):2 [Nick Stahl] Bruce Willis:2 [Patrick Michael Strange] Kl.M. Brandauer (AU):2 [Robert Redford] Arn. Schwarzenegger:2 [Kevin Pollak]

TU/e - 0ZM05/0EM15/0A A search for high Kevin Bacon numbers… 3 2

TU/e - 0ZM05/0EM15/0A The center of the movie universe (sept 2013) Nr 370 Nr 136 Nr 39

TU/e - 0ZM05/0EM15/0A150 The best centers… ( ) 18 (Kevin Bacon at place 444 in 2011) (Rutger Hauer at place 39, J.Krabbé 935)

TU/e - 0ZM05/0EM15/0A150 19

TU/e - 0ZM05/0EM15/0A “Elvis has left the building …”

TU/e - 0ZM05/0EM15/0A Think about why these two properties emerge

TU/e - 0ZM05/0EM15/0A We find small average path lengths in all kinds of places… Caenorhabditis Elegans 959 cells Genome sequenced 1998 Nervous system mapped  low average path length + cliquishness = small world network Power grid network of Western States 5,000 power plants with high-voltage lines  low average path length + cliquishness = small world network

TU/e - 0ZM05/0EM15/0A150 How weird is that? 23

TU/e - 0ZM05/0EM15/0A150 Could there be a simple explanation? Consider a random network: each pair of nodes is connected with a given probability p. This is called an Erdos-Renyi network. 24 NB Erdos was a “Kevin Bacon” long before Kevin Bacon himself!|

TU/e - 0ZM05/0EM15/0A150 APL is small in random networks 25 [Slide copied from Jari_Chennai2010.pdf]

TU/e - 0ZM05/0EM15/0A [Slide copied from Jari_Chennai2010.pdf]

TU/e - 0ZM05/0EM15/0A150 But let’s move on to the second network characteristic … 27

TU/e - 0ZM05/0EM15/0A150 28

TU/e - 0ZM05/0EM15/0A150 This is how small-world networks are defined: A short Average Path Length and A high clustering coefficient … and a randomly “grown” network does NOT lead to both these small-world properties (the 2 nd one fails) 29

TU/e - 0ZM05/0EM15/0A150 Networks of the Real-world (1) Information networks:  World Wide Web: hyperlinks  Citation networks  Blog networks Social networks: people + interactions  Organizational networks  Communication networks  Collaboration networks  Sexual networks  Collaboration networks Technological networks:  Power grid  Airline, road, river networks  Telephone networks  Internet  Autonomous systems Florence families Karate club network Collaboration network Friendship network Source: Leskovec & Faloutsos

TU/e - 0ZM05/0EM15/0A150 Networks of the Real-world (2) Biological networks  metabolic networks  food web  neural networks  gene regulatory networks Language networks  Semantic networks Software networks … Yeast protein interactions Semantic network Language network Software network Source: Leskovec & Faloutsos

TU/e - 0ZM05/0EM15/0A Small world networks … so what? You see it a lot around us: for instance in road maps, food chains, electric power grids, metabolite processing networks, neural networks, telephone call graphs and social influence networks  may be useful to study them They seem to be useful for a lot of things, and there are reasons to believe they might be useful for innovation purposes (and hence we might want to create them)

TU/e - 0ZM05/0EM15/0A150 Examples of interesting properties of small world networks 33

TU/e - 0ZM05/0EM15/0A150 Synchronizing fireflies … Synchronization speed depends on small-world properties of the network  Network characteristics important for “integrating local nodes” 34

TU/e - 0ZM05/0EM15/0A Combining game theory and networks – Axelrod (1980), Watts & Strogatz (1998 ? ) 1. Consider a given network. 2. All connected actors play the repeated Prisoner’s Dilemma for some rounds 3. After a given number of rounds, the strategies “reproduce” in the sense that the proportion of the more succesful strategies increases in the network, whereas the less succesful strategies decrease or die 4. Repeat 2 and 3 until a stable state is reached. 5. Conclusion: to sustain cooperation, you need a short average distance, and cliquishness (“small worlds”)

TU/e - 0ZM05/0EM15/0A And another peculiarity... Seems to be useful in “decentralized computing”  Imagine a ring of 1,000 lightbulbs  Each is on or off  Each bulb looks at three neighbors left and right... ... and decides somehow whether or not to switch to on or off. Question: how can we design a rule so that the network can tackle a given GLOBAL (binary) question, for instance the question whether most of the lightbulbs were initially on or off. - As yet unsolved. Best rule gives 82 % correct. - But: on small-world networks, a simple majority rule gets 88% correct. How can local knowledge be used to solve global problems?

TU/e - 0ZM05/0EM15/0A150 If small-world networks are so interesting and we see them everywhere, how do they arise? (potential answer: through random rewiring of a given structure) 37

TU/e - 0ZM05/0EM15/0A Strogatz and Watts 6 billion nodes on a circle Each connected to nearest 1,000 neighbors Start rewiring links randomly Calculate average path length and clustering as the network starts to change Network changes from structured to random APL: starts at 3 million, decreases to 4 (!) Clustering: starts at 0.75, decreases to zero (actually to 1 in 6 million) Strogatz and Watts asked: what happens along the way with APL and Clustering?

TU/e - 0ZM05/0EM15/0A Strogatz and Watts (2) “We move in tight circles yet we are all bound together by remarkably short chains” (Strogatz, 2003)  Implications for, for instance, research on the spread of diseases... The general hint: -If networks start from relatively structured … -… and tend to progress sort of randomly … -- … then you might get small world networks a large part of the time

TU/e - 0ZM05/0EM15/0A150 And now the third characteristic 40

TU/e - 0ZM05/0EM15/0A150 If we consider all three… 41

TU/e - 0ZM05/0EM15/0A150 … then we find this: 42 Wang & Chen (2003) Complex networks: Small-world, Scale-free and beyond

TU/e - 0ZM05/0EM15/0A Same thing … we see “scale-freeness” all over

TU/e - 0ZM05/0EM15/0A150 … and it can’t be based on an ER-network 44

TU/e - 0ZM05/0EM15/0A150 45

TU/e - 0ZM05/0EM15/0A150 46

TU/e - 0ZM05/0EM15/0A Scale-free networks are: Robust to random problems/mistakes but vulnerable to selectively targeted attacks

TU/e - 0ZM05/0EM15/0A Another BIG question: How do scale free networks arise? Potential answer: Perhaps through “preferential attachment” (Another) critique to this approach: it ignores ties created by those in the network

TU/e - 0ZM05/0EM15/0A150 Some related issues 49

TU/e - 0ZM05/0EM15/0A “The tipping point” (Watts*) Consider a network in which each node determines whether or not to adopt, based on what his direct connections do. Nodes have different thresholds to adopt (randomly distributed) Question: when do you get cascades of adoption? Answer: two phase transitions or tipping points:  in sparse networks no cascades, as networks get more dense you get cascades suddenly  as networks get more heterogenous, a sudden jump in the likelihood of cascades  as networks get even more heterogenous, the likelihood of cascades decreases * Watts, D.J. (2002) A simple model of global cascades on random networks. Proceedings of the National Academy of Sciences USA 99,

TU/e - 0ZM05/0EM15/0A “Find the influentials” (or not?)

TU/e - 0ZM05/0EM15/0A Malcolm Gladwell (journalist/writer: wrote “Blink” and “The tipping point” Duncan Watts (scientist, Yahoo, Microsoft Research) H6AVVU /tipping-point-toast

TU/e - 0ZM05/0EM15/0A "All they'll ever say," Watts insists, is that a) there are people who are more influential than others, and b) they are disproportionately important in getting a trend going. That may be oversimplifying it a bit, but last year, Watts decided to put the whole idea to the test by building another Sims-like computer simulation. He programmed a group of 10,000 people, all governed by a few simple interpersonal rules. Each was able to communicate with anyone nearby. With every contact, each had a small probability of "infecting" another. And each person also paid attention to what was happening around him: If lots of other people were adopting a trend, he would be more likely to join, and vice versa. The "people" in the virtual society had varying amounts of sociability--some were more connected than others. Watts designated the top 10% most-connected as Influentials; they could affect four times as many people as the average Joe. In essence, it was a virtual society run--in a very crude fashion--according to the rules laid out by thinkers like Gladwell and Keller. Watts set the test in motion by randomly picking one person as a trendsetter, then sat back to see if the trend would spread. He did so thousands of times in a row. The results were deeply counterintuitive. The experiment did produce several hundred societywide infections. But in the large majority of cases, the cascade began with an average Joe (although in cases where an Influential touched off the trend, it spread much further). To stack the deck in favor of Influentials, Watts changed the simulation, making them 10 times more connected. Now they could infect 40 times more people than the average citizen (and again, when they kicked off a cascade, it was substantially larger). But the rank-and-file citizen was still far more likely to start a contagion. Why didn't the Influentials wield more power? With 40 times the reach of a normal person, why couldn't they kick-start a trend every time? Watts believes this is because a trend's success depends not on the person who starts it, but on how susceptible the society is overall to the trend--not how persuasive the early adopter is, but whether everyone else is easily persuaded. And in fact, when Watts tweaked his model to increase everyone's odds of being infected, the number of trends skyrocketed. "If society is ready to embrace a trend, almost anyone can start one--and if it isn't, then almost no one can," Watts concludes. To succeed with a new product, it's less a matter of finding the perfect hipster to infect and more a matter of gauging the public's mood. Sure, there'll always be a first mover in a trend. But since she generally stumbles into that role by chance, she is, in Watts's terminology, an "accidental Influential."

TU/e - 0ZM05/0EM15/0A "All they'll ever say," Watts insists, is that a) there are people who are more influential than others, and b) they are disproportionately important in getting a trend going. That may be oversimplifying it a bit, but last year, Watts decided to put the whole idea to the test by building another Sims-like computer simulation. He programmed a group of 10,000 people, all governed by a few simple interpersonal rules. Each was able to communicate with anyone nearby. With every contact, each had a small probability of "infecting" another. And each person also paid attention to what was happening around him: If lots of other people were adopting a trend, he would be more likely to join, and vice versa. The "people" in the virtual society had varying amounts of sociability--some were more connected than others. Watts designated the top 10% most-connected as Influentials; they could affect four times as many people as the average Joe. In essence, it was a virtual society run--in a very crude fashion--according to the rules laid out by thinkers like Gladwell and Keller. Watts set the test in motion by randomly picking one person as a trendsetter, then sat back to see if the trend would spread. He did so thousands of times in a row. The results were deeply counterintuitive. The experiment did produce several hundred societywide infections. But in the large majority of cases, the cascade began with an average Joe (although in cases where an Influential touched off the trend, it spread much further). To stack the deck in favor of Influentials, Watts changed the simulation, making them 10 times more connected. Now they could infect 40 times more people than the average citizen (and again, when they kicked off a cascade, it was substantially larger). But the rank-and-file citizen was still far more likely to start a contagion. Why didn't the Influentials wield more power? With 40 times the reach of a normal person, why couldn't they kick-start a trend every time? Watts believes this is because a trend's success depends not on the person who starts it, but on how susceptible the society is overall to the trend--not how persuasive the early adopter is, but whether everyone else is easily persuaded. And in fact, when Watts tweaked his model to increase everyone's odds of being infected, the number of trends skyrocketed. "If society is ready to embrace a trend, almost anyone can start one--and if it isn't, then almost no one can," Watts concludes. To succeed with a new product, it's less a matter of finding the perfect hipster to infect and more a matter of gauging the public's mood. Sure, there'll always be a first mover in a trend. But since she generally stumbles into that role by chance, she is, in Watts's terminology, an "accidental Influential." “If society is ready to embrace a trend, Almost anyone can start it. And if it Isn’t then almost no one can” – Duncan Watts

TU/e - 0ZM05/0EM15/0A150 Hmm... We will see that you do not always end up with small worlds! 55

TU/e - 0ZM05/0EM15/0A The bigger picture: Understanding macro patterns from micro behavior

TU/e - 0ZM05/0EM15/0A150 The general approach … understand how STRUCTURE can arise from underlying MICRO-DYNAMICS Scientists are trying to connect the structural properties … Scale-free, small-world, locally clustered, bow-tie, hubs and authorities, communities, bipartite cores, network motifs, highly optimized tolerance, … … to processes (Erdos-Renyi) Random graphs, Exponential random graphs, Small-world model, Preferential attachment, Edge copying model, Community guided attachment, Forest fire models, Kronecker graphs, …

TU/e - 0ZM05/0EM15/0A RECAP Six degrees of separation: average path length is often small Many real-world networks have properties that are similar: small-world and scale-free. We do not really understand yet how these properties emerge. We saw two clues: the Watts-Strogatz model for small-worlds and the preferential attachment model for scale-freeness. Small-world and scale-free networks have some nice properties (which might explain why they exist) Considerable controversy over what these kinds of results imply, for instance for marketing purposes Hot scientific topic: connecting micro-behavior to macro-properties

TU/e - 0ZM05/0EM15/0A To Do: Read and comprehend the papers on small world networks, scale-free networks (see website, there is extra material too). Think about implications and applications of these results