On-line Social Networks - Anthony Bonato 1 Dynamic Models of On-Line Social Networks Anthony Bonato Ryerson University WAW’2009 February 13, 2009 nt.

Slides:



Advertisements
Similar presentations
1 Dynamics of Real-world Networks Jure Leskovec Machine Learning Department Carnegie Mellon University
Advertisements

Jurij Leskovec, CMU Jon Kleinberg, Cornell Christos Faloutsos, CMU
1 Realistic Graph Generation and Evolution Using Kronecker Multiplication Jurij Leskovec, CMU Deepay Chakrabarti, CMU/Yahoo Jon Kleinberg, Cornell Christos.
Analysis and Modeling of Social Networks Foudalis Ilias.
Week 5 - Models of Complex Networks I Dr. Anthony Bonato Ryerson University AM8002 Fall 2014.
Lecture 21 Network evolution Slides are modified from Jurij Leskovec, Jon Kleinberg and Christos Faloutsos.
Kronecker Graphs: An Approach to Modeling Networks Jure Leskovec, Deepayan Chakrabarti, Jon Kleinberg, Christos Faloutsos, Zoubin Ghahramani Presented.
Information Networks Generative processes for Power Laws and Scale-Free networks Lecture 4.
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.
SILVIO LATTANZI, D. SIVAKUMAR Affiliation Networks Presented By: Aditi Bhatnagar Under the guidance of: Augustin Chaintreau.
Information Networks Small World Networks Lecture 5.
1 Dimension matching in Facebook and LinkedIn networks Anthony Bonato Ryerson University Seminar on Social Networks, Big Data, Influence, and Decision-Making.
CS 599: Social Media Analysis University of Southern California1 The Basics of Network Analysis Kristina Lerman University of Southern California.
Universal Random Semi-Directed Graphs
The influence of search engines on preferential attachment Dan Li CS3150 Spring 2006.
CSE 522 – Algorithmic and Economic Aspects of the Internet Instructors: Nicole Immorlica Mohammad Mahdian.
Complex Networks Third Lecture TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA TexPoint fonts used in EMF. Read the.
CS728 Lecture 5 Generative Graph Models and the Web.
1 Complex systems Made of many non-identical elements connected by diverse interactions. NETWORK New York Times Slides: thanks to A-L Barabasi.
Web as Graph – Empirical Studies The Structure and Dynamics of Networks.
CS Lecture 6 Generative Graph Models Part II.
Sampling from Large Graphs. Motivation Our purpose is to analyze and model social networks –An online social network graph is composed of millions of.
Advanced Topics in Data Mining Special focus: Social Networks.
1 Algorithms for Large Data Sets Ziv Bar-Yossef Lecture 7 May 14, 2006
Computer Science 1 Web as a graph Anna Karpovsky.
Measurement and Evolution of Online Social Networks Review of paper by Ophir Gaathon Analysis of Social Information Networks COMS , Spring 2011,
Networks - Bonato1 Modelling, Mining, and Searching Networks Anthony Bonato Ryerson University Master’s Seminar November 2012.
Lecture 6 - Models of Complex Networks II Dr. Anthony Bonato Ryerson University AM8002 Fall 2014.
Topic 13 Network Models Credits: C. Faloutsos and J. Leskovec Tutorial
Log Dimension Hypothesis1 The Logarithmic Dimension Hypothesis Anthony Bonato Ryerson University MITACS International Problem Solving Workshop July 2012.
Complex networks - Bonato1 Complex networks and their models Anthony Bonato Ryerson University Graduate Seminar October 2011.
Analysis of Topological Characteristics of Huge Online Social Networking Services Friday 10am Telefonica Barcelona Yong-Yeol Ahn Seungyeop Han.
1 Vertex-pursuit in heirarchical social networks Anthony Bonato Ryerson University TAMC’12 Complex Networks.
Weighted Graphs and Disconnected Components Patterns and a Generator IDB Lab 현근수 In KDD 08. Mary McGlohon, Leman Akoglu, Christos Faloutsos.
Jure Leskovec Computer Science Department Cornell University / Stanford University Joint work with: Eric Horvitz, Michael Mahoney,
Week 3 - Complex Networks and their Properties
Network Characterization via Random Walks B. Ribeiro, D. Towsley UMass-Amherst.
1 Burning a graph as a model of social contagion Anthony Bonato Ryerson University Institute of Software Chinese Academy of Sciences.
Jure Leskovec Computer Science Department Cornell University / Stanford University Joint work with: Jon Kleinberg (Cornell), Christos.
1 “Expansion” in Power Law and Scale Free Graphs Milena Mihail Georgia Tech with Christos Gkantsidis, Christos Papadimitriou and Amin Saberi.
Yongqin Gao, Greg Madey Computer Science & Engineering Department University of Notre Dame © Copyright 2002~2003 by Serendip Gao, all rights reserved.
Lecture 10: Network models CS 765: Complex Networks Slides are modified from Networks: Theory and Application by Lada Adamic.
KPS 2007 (April 19, 2007) On spectral density of scale-free networks Doochul Kim (Department of Physics and Astronomy, Seoul National University) Collaborators:
Most of contents are provided by the website Network Models TJTSD66: Advanced Topics in Social Media (Social.
Clusters Recognition from Large Small World Graph Igor Kanovsky, Lilach Prego Emek Yezreel College, Israel University of Haifa, Israel.
RTM: Laws and a Recursive Generator for Weighted Time-Evolving Graphs Leman Akoglu, Mary McGlohon, Christos Faloutsos Carnegie Mellon University School.
Miniconference on the Mathematics of Computation
1 How to burn a graph Anthony Bonato Ryerson University GRASCan 2015.
On-line Social Networks - Anthony Bonato 1 Dynamic Models of On-line Social Networks Anthony Bonato Ryerson University ICMCM’09 December, 2009.
A short course on complex networks
Community structure in graphs Santo Fortunato. More links “inside” than “outside” Graphs are “sparse” “Communities”
1 Dimension matching in Facebook and LinkedIn networks Anthony Bonato Ryerson University Toronto, Canada ICMCE 2015.
Graph Models Class Algorithmic Methods of Data Mining
Random Walk for Similarity Testing in Complex Networks
Topics In Social Computing (67810)
Peer-to-Peer and Social Networks
Lecture 13 Network evolution
Modelling and Searching Networks Lecture 3 – ILT model
Discrete Mathematics and its Applications Lecture 3 – ILT model
Modelling and Searching Networks Lecture 4 – ILAT model
Lecture 21 Network evolution
Modelling and Searching Networks Lecture 2 – Complex Networks
Modelling and Searching Networks Lecture 5 – Random graphs
Modelling and Searching Networks Lecture 6 – PA models
18th Ontario Combinatorics Workshop On-line Social Networks
Discrete Mathematics and its Applications Lecture 5 – Random graphs
Network Models Michael Goodrich Some slides adapted from:
Discrete Mathematics and its Applications Lecture 6 – PA models
Advanced Topics in Data Mining Special focus: Social Networks
Cops and Robbers from a Distance
Presentation transcript:

On-line Social Networks - Anthony Bonato 1 Dynamic Models of On-Line Social Networks Anthony Bonato Ryerson University WAW’2009 February 13, 2009 nt

On-line Social Networks - Anthony Bonato 2 Complex Networks web graph, social networks, biological networks, internet networks, …

On-line Social Networks - Anthony Bonato 3 Social Networks nodes: people edges: social interaction

On-line Social Networks - Anthony Bonato 4 On-line networks: Flickr graph

On-line Social Networks - Anthony Bonato 5 Facebook graph

On-line Social Networks - Anthony Bonato 6 On-line gaming networks

On-line Social Networks - Anthony Bonato 7 Properties of Complex Networks observed properties: –massive, power law, small world, decentralized –many bipartite subgraphs, high clustering, sparse cuts, strong conductance, eigenvalue power law, … (Broder et al, 01)

On-line Social Networks - Anthony Bonato 8 Small World Property small world networks introduced by social scientists Watts & Strogatz in 1998 –low diameter/average distance (“6 degrees of separation”) –globally sparse, locally dense (high clustering coefficient)

On-line Social Networks - Anthony Bonato 9 Social network analysis Milgram (67): average distance between two Americans is 6 Watts and Strogatz (98): introduced small world property Adamic et al. (03): early study of on-line social networks Liben-Nowell et al. (05): small world property in LiveJournal Kumar et al. (06): Flickr, Yahoo!360; average distances decrease with time Golder et al. (06): studied 4 million users of Facebook Ahn et al. (07): studied Cyworld in South Korea, along with MySpace and Orkut Mislove et al. (07): studied Flickr, YouTube, LiveJournal, Orkut On-line

On-line Social Networks - Anthony Bonato 10 Key parameters power law degree distributions: average distance: clustering coefficient: Wiener index, W(G)

On-line Social Networks - Anthony Bonato 11 Facebook Golder et al (06): current number of users (nodes): > 120 million

On-line Social Networks - Anthony Bonato 12 Flickr and Yahoo!360 Kumar et al (06): shrinking diameters

On-line Social Networks - Anthony Bonato 13 Sample data: Flickr, YouTube, LiveJournal, Orkut Mislove et al (07): short average distances and high clustering coefficients

On-line Social Networks - Anthony Bonato 14 Leskovec, Kleinberg, Faloutsos (05): –many complex networks obey two laws: 1.Densification Power Law –networks are becoming more dense over time; i.e. average degree is increasing e(t) ≈ n(t) a where 1 < a ≤ 2: densification exponent –a=1: linear growth – constant average degree, such as in web graph models –a=2: quadratic growth – cliques

On-line Social Networks - Anthony Bonato 15 Densification – Physics Citations n(t) e(t) 1.69

On-line Social Networks - Anthony Bonato 16 Densification – Autonomous Systems n(t) e(t) 1.18

On-line Social Networks - Anthony Bonato 17 2.Decreasing distances distances (diameter and/or average distances) decrease with time –noted by Kumar et al in Flickr and Yahoo!360 in contrast with Preferential attachment model –a.a.s. diameter O(log t)

On-line Social Networks - Anthony Bonato 18 Diameter – ArXiv citation graph time [years] diameter

On-line Social Networks - Anthony Bonato 19 Diameter – Autonomous Systems number of nodes diameter

On-line Social Networks - Anthony Bonato 20 Models for the laws Leskovec, Kleinberg, Faloutsos (05, 07): –Forest Fire model stochastic densification power law, decreasing diameter, power law degree distribution Leskovec, Chakrabarti, Kleinberg,Faloutsos (05, 07): –Kronecker Multiplication deterministic densification power law, decreasing diameter, power law degree distribution

On-line Social Networks - Anthony Bonato 21 Models of On-line Social Networks many models exist for general complex networks (preferential attachment, random power law, copying, duplication, geometric, rank-based, Forest fire, …) few models for on-line social networks goal: design and analyze a model which simulates many of the observed properties of on-line social networks –model should be simple and evolve in a natural way

On-line Social Networks - Anthony Bonato 22 “All models are wrong, but some are more useful.” – G.P.E. Box

On-line Social Networks - Anthony Bonato 23 Iterated Local Transitivity (ILT) model (Bonato, Hadi, Horn, Prałat, Wang, 08) key paradigm is transitivity: friends of friends are more likely friends; eg (Frank,80), (White, Harrison, Breiger, 76), (Scott, 00) –iterative cloning of closed neighbour sets deterministic: amenable to analysis local: nodes often only have local influence evolves over time, but retains memory of initial graph

On-line Social Networks - Anthony Bonato 24 ILT model parameter: finite simple undirected graph G = G 0 to form the graph G t+1 for each vertex x from time t, add a vertex x’, the clone of x, so that xx’ is an edge, and x’ is joined to each neighbour of x

On-line Social Networks - Anthony Bonato 25 G 0 = C 4

On-line Social Networks - Anthony Bonato 26 Properties of ILT model average degree increasing to ∞ with time average distance bounded by constant and converging, and in many cases decreasing with time; diameter does not change clustering higher than in a random generated graph with same average degree cop and domination numbers do not change with time bad expansion: small gaps between 1 st and 2 nd eigenvalues in adjacency and normalized Laplacian matrices of G t

On-line Social Networks - Anthony Bonato 27 Densification n t = order of G t, e t = size of G t Lemma: For t > 0, n t = 2 t n 0, e t = 3 t (e 0 +n 0 ) - 2 t n 0. → densification power law: e t ≈ n t a, where a = log(3)/log(2).

On-line Social Networks - Anthony Bonato 28 Average distance Theorem 2: If t > 0, then average distance bounded by a constant, and converges; for many initial graphs (large cycles) it decreases diameter does not change from time 0

On-line Social Networks - Anthony Bonato 29 Clustering Coefficient Theorem 3: If t > 0, then c(G t ) = n t log(7/8)+o(1). higher clustering than in a random graph G(n t,p) with same order and average degree as G t, which satisfies c(G(n t,p)) = n t log(3/4)+o(1)

On-line Social Networks - Anthony Bonato 30 Sketch of proof each node x at time t has a binary sequence corresponding to descendants from time 0, with a clone indicated by 1 let e(x,t) be the number of edges in N(x) at time t we show that e(x,t+1) = 3e(x,t) + 2deg t (x) e(x’,t+1) = e(x,t) + deg t (x) if there are k many 1’s in the binary sequence of x, then e(x,t) ≥ 3 k-2 e(x,2) = Ω(3 k )

On-line Social Networks - Anthony Bonato 31 Sketch of proof, continued there are many nodes with k many 0’s in their binary sequence hence,

On-line Social Networks - Anthony Bonato 32 example: (Zachary, 72) observed social ties and rivalries in a university karate club (34 nodes,78 edges) during his observation, conflicts intensified and group split see also (Girvan, Newman, 02) Community structure in social networks

On-line Social Networks - Anthony Bonato 33 Spectral results the spectral gap λ of G is defined by min{λ 1, 2 - λ n-1 }, where 0 = λ 0 ≤ λ 1 ≤ … ≤ λ n-1 ≤ 2 are the eigenvalues of the normalized Laplacian of G: I-D -1/2 AD 1/2 (Chung, 97) for random graphs, λ tends to 1 as order grows in the ILT model, λ < ½ similar results for adjacency matrix A bad expansion/small spectral gaps in the ILT model found in social networks but not in the web graph or biological networks (Estrada, 06) –in social networks, there are a higher number of intra- rather than inter-community links

On-line Social Networks - Anthony Bonato 34 Random model randomize the ILT model –add random edges independently to new nodes, with probability a function of t –makes densification tuneable densification exponent becomes log(3 + ε) / log(2), where ε is any fixed real number in (0,1) –gives any exponent in (log(3)/log(2), 2) similar (or better) distance, clustering and spectral results as in deterministic case

On-line Social Networks - Anthony Bonato 35 Missing ingredient: Power laws –generate power law graphs from ILT? deterministic ILT model gives a binomial-type distribution

On-line Social Networks - Anthony Bonato 36 preprints, reprints, contact: Google: “Anthony Bonato”