Slides are modified from Lada Adamic and Jure Leskovec

Slides:



Advertisements
Similar presentations
Mobile Communication Networks Vahid Mirjalili Department of Mechanical Engineering Department of Biochemistry & Molecular Biology.
Advertisements

The Small World Phenomenon: An Algorithmic Perspective Speaker: Bradford Greening, Jr. Rutgers University – Camden.
Fundamentals of Computer Networks ECE 478/578 Lecture #13: Packet Switching (2) Instructor: Loukas Lazos Dept of Electrical and Computer Engineering University.
Stelios Lelis UAegean, FME: Special Lecture Social Media & Social Networks (SM&SN)
Λ14 Διαδικτυακά Κοινωνικά Δίκτυα και Μέσα Strong and Weak Ties Chapter 3, from D. Easley and J. Kleinberg book.
Based on chapter 3 in Networks, Crowds and markets (by Easley and Kleinberg) Roy Mitz Supervised by: Prof. Ronitt Rubinfeld November 2014 Strong and weak.
Lecture 21 Network evolution Slides are modified from Jurij Leskovec, Jon Kleinberg and Christos Faloutsos.
Social Networks 101 P ROF. J ASON H ARTLINE AND P ROF. N ICOLE I MMORLICA.
Models of Network Formation Networked Life NETS 112 Fall 2013 Prof. Michael Kearns.
School of Information University of Michigan SI 614 Community structure in networks Lecture 17.
Feb 20, Definition of subgroups Definition of sub-groups: “Cohesive subgroups are subsets of actors among whom there are relatively strong, direct,
Identity and search in social networks Presented by Pooja Deodhar Duncan J. Watts, Peter Sheridan Dodds and M. E. J. Newman.
Directional triadic closure and edge deletion mechanism induce asymmetry in directed edge properties.
Link creation and profile alignment in the aNobii social network Luca Maria Aiello et al. Social Computing Feb 2014 Hyewon Lim.
Summary from Previous Lecture Real networks: –AS-level N= 12709, M=27384 (Jan 02 data) route-views.oregon-ix.net, hhtp://abroude.ripe.net/ris/rawdata –
Λ14 Διαδικτυακά Κοινωνικά Δίκτυα και Μέσα Strong and Weak Ties Chapter 3, from D. Easley and J. Kleinberg book.
Principles of Social Network Analysis. Definition of Social Networks “A social network is a set of actors that may have relationships with one another”
Feedback Effects between Similarity and Social Influence in Online Communities David Crandall, Dan Cosley, Daniel Huttenlocher, Jon Kleinberg, Siddharth.
Social Network Analysis Prof. Dr. Daning Hu Department of Informatics University of Zurich Mar 5th, 2013.
Λ14 Διαδικτυακά Κοινωνικά Δίκτυα και Μέσα Networks and Surrounding Contexts Chapter 4, from D. Easley and J. Kleinberg book.
Lecture 20 Network dynamics Slides are modified from Lada Adamic and Jure Leskovec.
Online Social Networks and Media
Lecture 10: Network models CS 765: Complex Networks Slides are modified from Networks: Theory and Application by Lada Adamic.
Slides are modified from Lada Adamic and Jure Leskovec
School of Information University of Michigan Unless otherwise noted, the content of this course material is licensed under a Creative Commons Attribution.
Community Discovery in Social Network Yunming Ye Department of Computer Science Shenzhen Graduate School Harbin Institute of Technology.
Extracting information from complex networks From the metabolism to collaboration networks Roger Guimerà Department of Chemical and Biological Engineering.
1 Friends and Neighbors on the Web Presentation for Web Information Retrieval Bruno Lepri.
Topics In Social Computing (67810) Module 1 Introduction & The Structure of Social Networks.
Contagion in Networks Networked Life NETS 112 Fall 2015 Prof. Michael Kearns.
Lecture 23: Structure of Networks
Connectivity and the Small World
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama
Analysis of University Researcher Collaboration Network Using Co-authorship Jiadi Yao School of Electronic and Computer Science,
Effects of User Similarity in Social Media Ashton Anderson Jure Leskovec Daniel Huttenlocher Jon Kleinberg Stanford University Cornell University Avia.
Topics In Social Computing (67810)
Biological networks CS 5263 Bioinformatics.
Effects of Targeted Troubleshooting Activities on
Slides are modified from Lada Adamic and Jure Leskovec
Empirical analysis of Chinese airport network as a complex weighted network Methodology Section Presented by Di Li.
The Strength of Weak Ties
How Do “Real” Networks Look?
Community detection in graphs
Lecture 23: Structure of Networks
Networked Life NETS 112 Fall 2018 Prof. Michael Kearns
Network Science: A Short Introduction i3 Workshop
Section 8.6 of Newman’s book: Clustering Coefficients
How Do “Real” Networks Look?
How Do “Real” Networks Look?
Models of Network Formation
Lecture 13 Network evolution
Models of Network Formation
Peer-to-Peer and Social Networks Fall 2017
Networked Life NETS 112 Fall 2017 Prof. Michael Kearns
Models of Network Formation
How Do “Real” Networks Look?
Networked Life NETS 112 Fall 2016 Prof. Michael Kearns
Models of Network Formation
Hannah Tang and Brian Tjaden Summer Quarter 2002
Clustering Coefficients
Emotions in Social Networks: Distributions, Patterns, and Models
Lecture 23: Structure of Networks
Lecture 9: Network models CS 765: Complex Networks
Social Network Analysis with Apache Spark and Neo4J
Lecture 21 Network evolution
Modelling and Searching Networks Lecture 2 – Complex Networks
Network Science: A Short Introduction i3 Workshop
Network Models Michael Goodrich Some slides adapted from:
“The Spread of Physical Activity Through Social Networks”
Networked Life NETS 112 Fall 2019 Prof. Michael Kearns
Presentation transcript:

Slides are modified from Lada Adamic and Jure Leskovec Lecture 18 Network dynamics Slides are modified from Lada Adamic and Jure Leskovec

Network and Community Evolution How does a network change over time? How does a community change over time? What properties do you expect to remain roughly constant? What properties do you expect to change? For example, Where do you expect new edges to form? Which edges do you expect to be dropped?

1. Network Segmentation Often, in evolving networks, segmentation takes place, where the large network is decomposed over time into three parts Giant Component: As network connections stabilize, a giant component of nodes is formed, with a large proportion of network nodes and edges falling into this component. Stars: These are isolated parts of the network that form star structures. A star is a tree with one internal node and n leaves. Singletons: These are orphan nodes disconnected from all nodes in the network.

First some thought What events can occur to change a network over time? What properties do you expect to remain roughly constant? What properties do you expect to change? Where do you expect new edges to form? Which edges do you expect to be dropped?

Empirical analysis of an evolving social network Gueorgi Kossinets & Duncan J. Watts Science, Jan. 6th, 2006 The data university email logs sender, recipient, timestamp no content 43,553 undergraduate and graduate students, faculty, staff filtered out messages with more than 4 recipients 5% of messages 14,584,423 messages remaining sent over a period of 355 days 2003-2004 school year

How does one choose new acquaintances in a social network? triadic closure: choose a friend of friend homophily: choose someone with similar interests proximity: choose someone who is close spatially and with whom you spend a lot of time seek novel information and resources connect outside of circle of acquaintances span structural holes between people who don’t know each other sometimes social ties also dissolve avoid conflicting relationships reason for tie is removed: common interest, activity

wij = weight of the tie between individuals i and j weighted ties wij = weight of the tie between individuals i and j m = # of messages from i to j in the time period between (t-t) and t t serves as a relevancy horizon (30 days, 60 days…) 60 days chosen as window in study because rate of tie formation stabilizes after 60 days sliding window: compare networks day by day but each day represents an overlapping 60 day window “geometric rate” – because rates are multiplied together high if email is reciprocated low if mostly one-way

cyclic closure & focal closure shortest path distance between i and j number of common foci, i.e. classes new ties that appeared on day t ties that were there in the past 60 days

university email network: properties such as degree distribution, average shortest path, and size of giant component have seasonal variation summer break, start of semester, etc. appropriate smoothing window (t) needed clustering coefficient, shape of degree distribution constant but rank of individuals changes over time Source: Empirical Analysis of an Evolving Social Network; Gueorgi Kossinets and Duncan J. Watts (6 January 2006) Science 311 (5757), 88.

cyclic closure & focal closure distance between two people in the email graph pairs that attend one or more classes together do not attend classes together Individuals who share at least one class are three times more likely to start emailing each other if they have an email contact in common If there is no common contact, then the probability of a new tie forming is lower, but ~ 140 times more likely if the individuals share a class than if they don’t

probability increases significantly for additional acquaintances, # triads vs. # foci Having 1 tie or 1 class in common yield equal probability of a tie forming probability increases significantly for additional acquaintances, but rises modestly for additional class >=1 class in common >=1 tie in common no classes in common no ties in common

the stronger the ties, the greater the likelihood of triadic closure the strength of ties the stronger the ties, the greater the likelihood of triadic closure bridges are on average weaker than other ties bridges are more unstable: may get stronger, become part of triads, or disappear

Is diversity (working with new people) always good? Team Assembly Mechanisms: Determine Collaboration Network Structure and Team Performance Roger Guimera, Brian Uzzi, Jarrett Spiro, Luıs A. Nunes Amaral; Science, 2005 Why assemble a team? different ideas different skills different resources What spurs innovation? applying proven innovations from one domain to another Is diversity (working with new people) always good? spurs creativity + fresh thinking but conflict miscommunication lack of sense of security of working with close collaborators

Parameters in team assembly m, # of team members p, probability of selecting individuals who already belong to the network q, propensity of incumbents to select past collaborators Two phases isolated clusters giant component of interconnected collaborators

creation of a new team Incumbents Newcomers people who have already collaborated with someone Newcomers people available to participate in new teams pick incumbent with probability p if incumbent, pick past collaborator with probability q

Time evolution of a collaboration network newcomer-newcomer collaborations newcomer-incumbent collaborations new incumbent-incumbent collaborations repeat collaborations after a time t of inactivity, individuals are removed from the network

BMI data Broadway musical industry 2,258 productions from 1877 to 1990 musical shows performed at least once on Broadway team: composers, writers, choreographers, directors, producers but not actors Team size increases from 1877-1929 the musical as an art form is still evolving After 1929 team composition stabilizes to include 7 people: choreographer, composer, director, librettist, lyricist, producer ldcross, Flickr; http://creativecommons.org/licenses/by-sa/2.0/deed.en

Collaboration networks 4 fields (with the top journals in each field) social psychology (7) economics (9) ecology (10) astronomy (4) impact factor of each journal ratio between citations and recent citable items published

size of teams grows over time

degree distributions data data generated from a model with the same p and q and sequence of team sizes formed

Predictions for the size of the giant component higher p means already published individuals are co-authoring linking the network together and increasing the giant component S = fraction of network occupied by the giant component

Predictions for the size of the giant component increasing q can slow the growth of the giant component co-authoring with previous collaborators does not create new edges fR = fraction of repeat incumbent-incumbent links

network statistics Field teams individuals p q fR S BMI 2,258 4,113 0.52 0.77 0.16 0.70 social psychology 16,526 23,029 0.56 0.78 0.22 0.67 economics 14,870 23,236 0.57 0.73 0.54 ecology 26,888 38,609 0.59 0.76 0.23 0.75 astronomy 30,552 30,192 0.82 0.39 0.98 what stands out? what is similar across the networks?

giant component takes up more than 50% of nodes in each network main findings all networks except astronomy close to the “tipping” point where giant component emerges sparse and stringy networks giant component takes up more than 50% of nodes in each network impact factor: how good the journal is where the work was published p positively correlated going with experienced members is good q negatively correlated new combinations more fruitful S for individual journals positively correlated more isolated clusters in lower-impact journals ecology, economics, social psychology ecology social psychology

In NetLogo demo library: team assembly lab In NetLogo demo library: what happens as you increase the probability of choosing a newcomer? what happens as you increase the probability of a repeat collaboration between same two nodes? http://ccl.northwestern.edu/netlogo/models/TeamAssembly

Backstrom, Huttenlocher, Kleinberg, Lan @ KDD 2006 data: Group Formation in Large Social Networks: Membership, Growth, and Evolution Backstrom, Huttenlocher, Kleinberg, Lan @ KDD 2006 data: LiveJournal DBLP

the more friends you have in a group, the more likely you are to join

if it’s a “group” of friends that have joined…

but community growth is slower if entirely cliquish…

group formation & social networks (summary) if your friends join, so will you if your friends who join know one another, you’re even more likely to join cliquish communities grow more slowly