University of California at Santa Barbara Christo Wilson, Bryce Boe, Alessandra Sala, Krishna P. N. Puttaswamy, and Ben Zhao.

Slides:



Advertisements
Similar presentations
An analysis of Social Network-based Sybil defenses Bimal Viswanath § Ansley Post § Krishna Gummadi § Alan Mislove ¶ § MPI-SWS ¶ Northeastern University.
Advertisements

Measurement and Analysis of Online Social Networks 1 A. Mislove, M. Marcon, K Gummadi, P. Druschel, B. Bhattacharjee Presentation by Shahan Khatchadourian.
Analysis and Modeling of Social Networks Foudalis Ilias.
Modeling Malware Spreading Dynamics Michele Garetto (Politecnico di Torino – Italy) Weibo Gong (University of Massachusetts – Amherst – MA) Don Towsley.
VL Netzwerke, WS 2007/08 Edda Klipp 1 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Networks in Metabolism.
Authors Haifeng Yu, Michael Kaminsky, Phillip B. Gibbons, Abraham Flaxman Presented by: Jonathan di Costanzo & Muhammad Atif Qureshi 1.
An Analysis of Social Network-Based Sybil Defenses Sybil Defender
Xiaowei Ying, Xintao Wu, Daniel Barbara Spectrum based Fraud Detection in Social Networks 1.
Walter Willinger AT&T Research Labs Reza Rejaie, Mojtaba Torkjazi, Masoud Valafar University of Oregon Mauro Maggioni Duke University HotMetrics’09, Seattle.
Spectrum Based RLA Detection Spectral property : the eigenvector entries for the attacking nodes,, has the normal distribution with mean and variance bounded.
Asking Questions on the Internet
Search in Power-Law Networks Presented by Hakim Weatherspoon CS294-4: Peer-to-Peer Systems Slides also borrowed from the following paper Path Finding Strategies.
Weighted networks: analysis, modeling A. Barrat, LPT, Université Paris-Sud, France M. Barthélemy (CEA, France) R. Pastor-Satorras (Barcelona, Spain) A.
Topology Generation Suat Mercan. 2 Outline Motivation Topology Characterization Levels of Topology Modeling Techniques Types of Topology Generators.
Small-World File-Sharing Communities Adriana Iamnitchi, Matei Ripeanu and Ian Foster,
UNDERSTANDING VISIBLE AND LATENT INTERACTIONS IN ONLINE SOCIAL NETWORK Presented by: Nisha Ranga Under guidance of : Prof. Augustin Chaintreau.
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.
Web as Graph – Empirical Studies The Structure and Dynamics of Networks.
Peer-to-Peer and Grid Computing Exercise Session 3 (TUD Student Use Only) ‏
Maciej Kurant (EPFL / UCI) Joint work with: Athina Markopoulou (UCI),
1 BotGraph: Large Scale Spamming Botnet Detection Yao Zhao EECS Department Northwestern University.
Measurement and Analysis of Online Social Networks By Alan Mislove, Massimiliano Marcon, Krishna P. Gummadi, Peter Druschel, Bobby Bhattacharjee Attacked.
User Interactions in OSNs Evangelia Skiani. Do you have a Facebook account? Why? How likely to know ALL your friends? Why confirm requests? Why not remove.
Measurement and Analysis of Online Social Networks Alan Mislove,Massimiliano Marcon, Krishna P. Gummadi, Peter Druschel, Bobby Bhattacharjee Presented.
Minas Gjoka, UC IrvineWalking in Facebook 1 Walking in Facebook: A Case Study of Unbiased Sampling of OSNs Minas Gjoka, Maciej Kurant ‡, Carter Butts,
On Distinguishing between Internet Power Law B Bu and Towsley Infocom 2002 Presented by.
1 Measurement and Analysis of Online Social Networks A. Mislove, M. Marcon, K Gummadi, P. Druschel, B. Bhattacharjee Presentation by Yong Wang (Defense.
GAYATRI SWAMYNATHAN, CHRISTO WILSON, BRYCE BOE, KEVIN ALMEROTH AND BEN Y. ZHAO UC SANTA BARBARA Do Social Networks Improve e-Commerce? A Study on Social.
SocialFilter: Introducing Social Trust to Collaborative Spam Mitigation Michael Sirivianos Telefonica Research Telefonica Research Joint work with Kyungbaek.
Measurement and Evolution of Online Social Networks Review of paper by Ophir Gaathon Analysis of Social Information Networks COMS , Spring 2011,
(Social) Networks Analysis III Prof. Dr. Daning Hu Department of Informatics University of Zurich Oct 16th, 2012.
Analysis and Modeling of the Open Source Software Community Yongqin Gao, Greg Madey Computer Science & Engineering University of Notre Dame Vincent Freeh.
Towards Modeling Legitimate and Unsolicited Traffic Using Social Network Properties 1 Towards Modeling Legitimate and Unsolicited Traffic Using.
Analysis of Topological Characteristics of Huge Online Social Networking Services Friday 10am Telefonica Barcelona Yong-Yeol Ahn Seungyeop Han.
Preserving Link Privacy in Social Network Based Systems Prateek Mittal University of California, Berkeley Charalampos Papamanthou.
Using Transactional Information to Predict Link Strength in Online Social Networks Indika Kahanda and Jennifer Neville Purdue University.
Wherefore Art Thou R3579X? Anonymized Social Networks, Hidden Patterns, and Structural Stenography.
Data Analysis in YouTube. Introduction Social network + a video sharing media – Potential environment to propagate an influence. Friendship network and.
WALKING IN FACEBOOK: A CASE STUDY OF UNBIASED SAMPLING OF OSNS junction.
Understanding Cross-site Linking in Online Social Networks Yang Chen 1, Chenfan Zhuang 2, Qiang Cao 1, Pan Hui 3 1 Duke University 2 Tsinghua University.
To Blog or Not to Blog: Characterizing and Predicting Retention in Community Blogs Imrul Kayes 1, Xiang Zuo 1, Da Wang 2, Jacob Chakareski 3 1 University.
Uncovering Social Network Sybils in the Wild Zhi YangChristo WilsonXiao Wang Peking UniversityUC Santa BarbaraPeking University Tingting GaoBen Y. ZhaoYafei.
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.
A Graph-based Friend Recommendation System Using Genetic Algorithm
By Gianluca Stringhini, Christopher Kruegel and Giovanni Vigna Presented By Awrad Mohammed Ali 1.
“SybilGuard: Defending Against Sybil Attacks via Social Networks” Authors: Haifeng Yu, Phillip B. Gibbons, and Suman Nath (several slides based on authors’)
LENS: Leveraging Social Networking and Trust to Prevent Spam Transmission Sufian Hameed Advisors Prof. Xiaoming Fu (UoG) Dr. Pan Hui (Deutsche Telekom.
Complex Network Theory – An Introduction Niloy Ganguly.
User Interactions in Social Networks and their Implications Christo Wilson, Bryce Boe, Alessandra Sala, Krishna P. N. Puttaswamy, Ben Y. Zhao (UC Santa.
SybilGuard: Defending Against Sybil Attacks via Social Networks.
Complex Network Theory – An Introduction Niloy Ganguly.
Most of contents are provided by the website Network Models TJTSD66: Advanced Topics in Social Media (Social.
Du, Faloutsos, Wang, Akoglu Large Human Communication Networks Patterns and a Utility-Driven Generator Nan Du 1,2, Christos Faloutsos 2, Bai Wang 1, Leman.
Community-enhanced De-anonymization of Online Social Networks Shirin Nilizadeh, Apu Kapadia, Yong-Yeol Ahn Indiana University Bloomington CCS 2014.
Stefanos Antaris A Socio-Aware Decentralized Topology Construction Protocol Stefanos Antaris *, Despina Stasi *, Mikael Högqvist † George Pallis *, Marios.
SOCIAL NETWORKING Nazia Hassan Usman Kamran Sophia Hasan Fahad Zafar 1.
1 Friends and Neighbors on the Web Presentation for Web Information Retrieval Bruno Lepri.
CS 590 Term Project Epidemic model on Facebook
Social Turing Tests: Crowdsourcing Sybil Detection Gang Wang, Manish Mohanlal, Christo Wilson, Xiao Wang Miriam Metzger, Haitao Zheng and Ben Y. Zhao Computer.
Social Networks and Peer to Peer As Presented by Jeremy Robinson 3/22/2007.
Privacy Preserving in Social Network Based System PRENTER: YI LIANG.
Anonymous communication over social networks Shishir Nagaraja and Ross Anderson Security Group Computer Laboratory.
Don’t Follow me : Spam Detection in Twitter January 12, 2011 In-seok An SNU Internet Database Lab. Alex Hai Wang The Pensylvania State University International.
Hierarchical Organization in Complex Networks by Ravasz and Barabasi İlhan Kaya Boğaziçi University.
Cmpe 588- Modeling of Internet Emergence of Scale-Free Network with Chaotic Units Pulin Gong, Cees van Leeuwen by Oya Ünlü Instructor: Haluk Bingöl.
Measuring the Mixing Time of Social Graphs Abedelaziz Mohaisen, Aaram Yun, and Yongdae Kim Computer Science and Engineering Department University of Minnesota.
Dieudo Mulamba November 2017
Network Science: A Short Introduction i3 Workshop
Social Network-Based Sybil Defenses
Presentation transcript:

University of California at Santa Barbara Christo Wilson, Bryce Boe, Alessandra Sala, Krishna P. N. Puttaswamy, and Ben Zhao

Social Networks 4/2/2009University of California at Santa Barbara 2

Social Applications 4/2/2009University of California at Santa Barbara  Enables new ways to solve problems for distributed systems  Social web search  Social bookmarking  Social marketplaces  Collaborative spam filtering (RE: Reliable )  How popular are social applications?  Facebook Platform – 50,000 applications Popular ones have >10 million users each 3

4/2/2009 Social Graphs and User Interactions  Social applications rely on 1. Social graph topology 2. User interactions  Currently, social applications evaluated just using social graph  Assume all social links are equally important/interactive  Is this true in reality? Milgram’s familiar stranger Connections for ‘status’ rather than ‘friendship’  Incorrect assumptions lead to faulty application design and evaluation University of California at Santa Barbara 4

Goals 4/2/2009University of California at Santa Barbara 5  Question: Are social links valid indicators of real user interaction?  First large scale study of Facebook 10 million users (15% of total users) / 24 million interactions  Use data to show highly skewed distribution of interactions 50% of their friends  Propose new model for social graphs that includes interaction information  Interaction Graph  Reevaluate existing social application using new model In some cases, break entirely

Characterizing Facebook Analyzing User Interactions Interaction Graphs Effects on Social Applications Outline 4/2/2009University of California at Santa Barbara 6

Crawling Facebook for Data 4/2/2009University of California at Santa Barbara 7  Facebook is the most popular social network  Crawling social networks is difficult  Too large to crawl completely, must be sampled  Privacy settings may prevent crawling  Thankfully, Facebook is divided into ‘networks’  Represent geographic regions, schools, companies  Regional networks are not authenticated

Crawling for Data, cont.  Crawled Facebook regional networks  22 largest networks: London, Australia, New York, etc  Timeframe: March – May 2008  Start with 50 random ‘seed’ users, perform BFS search  Data recorded for each user:  Friends list  History of wall posts and photo comments Collectively referred to as interactions Most popular publicly accessible Facebook applications 4/2/2009University of California at Santa Barbara 8

FacebookOrkut 1 Number of Users Crawled10,697,0001,846,000  Percentage of Total Users 15%26.9% Number of Social Links Crawled408,265,00022,613,000 Radius9.86 Diameter13.49 Average Path Length Clustering Coefficient Power-law Coefficient α= 1.5, D = 0.55 α= 1.5, D = 0.6 High Level Graph Statistics 4/2/2009University of California at Santa Barbara 9 1. A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee. Measurement and analysis of online social networks. In Proc. of IMC, October Based on Facebook’s total size of 66 million users in early 2008 Represents ~50% of all users in the crawled regions ~49% of links were crawlable This provides a lower bound on the average number of in- network friends Avg. social degree = ~77 Low average path length and high clustering coefficient indicate Facebook is small-world

Characterizing Facebook Analyzing User Interactions Interaction Graphs Effects on Social Applications Outline 4/2/2009University of California at Santa Barbara 10

Analyzing User Interactions  Having established that Facebook has the expected social graph properties…  Question: Are social links valid indicators of real user interaction?  Examine distribution of interactions among friends 4/2/2009University of California at Santa Barbara 11

Distribution Among Friends 4/2/2009University of California at Santa Barbara 12 For 50% of users, 70% of interaction comes from 7% of friends. Almost nobody interacts with more than 50% of their friends! For 50% of users, 100% of interaction comes from 20% of friends. Social degree does not accurately predict human behavior Initial Question: Are social links valid indicators of real user interaction?  Answer: NO Social degree does not accurately predict human behavior Initial Question: Are social links valid indicators of real user interaction?  Answer: NO

Characterizing Facebook Analyzing User Interactions Interaction Graphs Effects on Social Applications Outline 4/2/2009University of California at Santa Barbara 13

A Better Model of Social Graphs 4/2/2009University of California at Santa Barbara 14  Answer to our initial question:  Not all social links are created equal  Implication: can not be used to evaluate social applications  What is the right way to model social networks?  More accurately approximate reality by taking user interactivity into account  Interaction Graphs Chun et. al. IMC 2008

Interaction Graphs  Definition: a social graph parameterized by…  n : minimum number of interactions per edge  t : some window of time for interactions  n = 1 and t = {2004 to the present} 4/2/2009University of California at Santa Barbara 15

Social vs. Interaction Degree 4/2/2009University of California at Santa Barbara 16 1:1 Degree RatioDunbar’s Number (150)99% of Facebook Users Interaction graph prunes useless edges Results agree with theoretical limits on human social cognition Interaction graph prunes useless edges Results agree with theoretical limits on human social cognition

Interaction Graph Analysis 4/2/2009University of California at Santa Barbara 17 Do Interaction Graphs maintain expected social network graph properties? Social GraphInteraction Graph Number of Vertices10,697,0008,403,000 Number of Edges408,265,00094,665,000 Radius Diameter Average Path Length Clustering Coefficient Power-law Coefficient α= 1.5, D = 0.55 α= 1.5, D = 0.24 Interaction Graphs still have  Power-law scaling  Scale-free behavior  Small-world clustering … But, exhibit less of these characteristics than the full social network Interaction Graphs still have  Power-law scaling  Scale-free behavior  Small-world clustering … But, exhibit less of these characteristics than the full social network

Characterizing Facebook Analyzing User Interactions Interaction Graphs Effects on Social Applications Outline 4/2/2009University of California at Santa Barbara 18

Social Applications, Revisited 4/2/2009University of California at Santa Barbara 19  Recap:  Need a better model to evaluate social applications  Interaction Graphs augment social graphs with interaction information  How do these changes effect social applications?  Sybilguard  Analysis of Reliable in the paper

Sybilguard 4/2/2009University of California at Santa Barbara 20  Sybilguard is a system for detecting Sybil nodes in social graphs  Why do we care about detecting Sybils?  Social network based games:  Social marketplaces:  How Sybilguard works  Key insight: few edges between Sybils and legitimate users (attack edges)  Use persistent routing tables and random walks to detect attack edges

Sybilguard Algorithm 4/2/2009University of California at Santa Barbara 21 Step 1: Bootstrap the network. All users exchange signed keys. Key exchange implies that both parties are human and trustworthy. Step 2: Choose a verifier (A) and a suspect (B). A and B send out random walks of a certain length (2). Look for intersections. A knows B is not a Sybil because multiple paths intersect and they do so at different nodes. A B

Sybilguard Algorithm, cont. 4/2/2009University of California at Santa Barbara 22 A B

Sybilguard Caveats 4/2/2009University of California at Santa Barbara 23  Bootstrapping requires human interaction  Evaluating Sybilguard on the social graph is overly optimistic because most friends never interact!  Better to evaluate using Interaction Graphs

Expected Impact 4/2/2009University of California at Santa Barbara 24 Fewer of edges, lower clustering lead to reduced performance Why? Self-loops A B

Sybilguard on Interaction Graphs 4/2/2009University of California at Santa Barbara 25 When evaluated under real world conditions, performance of social applications changes dramatically

Conclusion 4/2/2009University of California at Santa Barbara 26  First large scale analysis of Facebook  Answer the question: Are social links valid indicators of real user interaction?  Formulate new model of social networks: Interaction Graphs  Demonstrate the effect of Interaction Graphs on social applications  Final takeaway: when building social applications, use interaction graphs!

Anonymized Facebook data (social graphs and interaction graphs) will be available for download soon at the Current Lab website! Questions? 4/2/ University of California at Santa Barbara

4/2/2009 Social Networks  Social Networks are popular platforms for interaction, communication and collaboration  > 110 million users 9 th most trafficked site on the Internet  > 170 million users #1 photo sharing site 4 th most trafficked site on the Internet 114% user growth in 2008  > 800 thousand users 1,689% user growth in 2008 University of California at Santa Barbara 28

FacebookOrkut 1 Number of Users Crawled10,697,0001,846,000  Percentage of Total Users 15%26.9% Number of Social Links Crawled408,265,00022,613,000 Radius9.86 Diameter13.49 Average Path Length Clustering Coefficient Power-law Coefficient α= 1.5, D = 0.55 α= 1.5, D = 0.6 High Level Graph Statistics 4/2/2009University of California at Santa Barbara A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee. Measurement and analysis of online social networks. In Proc. of IMC, October Based on Facebook’s total size of 66 million users in early 2008 Represents ~50% of all users in the crawled regions ~49% of links were crawlable This provides a lower bound on the average number of in- network friends Avg. social degree = ~77 Clustering Coefficient measures strength of local cliques Measured between zero (random graphs) and one (complete connectivity) Social networks display power law degree distribution Alpha is the curve of the power law D is the fitting error

Social Degree CDF 4/2/2009University of California at Santa Barbara 30

Nodes vs. Total Interactions 4/2/2009University of California at Santa Barbara 31 Top 10% of most well connected users are responsible for 60% of total interactions Top 10% of most interactive users are responsible for 85% of total interactions Social degree does not accurately predict human behavior Interactions are highly skewed towards a small percent of the Facebook population Social degree does not accurately predict human behavior Interactions are highly skewed towards a small percent of the Facebook population