DOCSLIB.ORG

Chap. 3 Strong and Weak Ties

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Chap. 3 Strong and Weak Ties Chap. 3 Strong and weak ties • 3.1 Triadic closure • 3.2 The strength of weak ties • 3.3 Tie Strength and Network Structure in Large- Scale Data • 3.4 Tie Strength, Social Media, and Passive Engagement • 3.5 Closure, Structural Holes, and Social Capital • 3.6 Advanced Material: Betweenness Measures and Graph Partitioning 3.1 Triadic Closure • Grundidee von Triadic Closure ist: Wenn 2 Leute einen gemeinsamen Freund haben, dann sind sie mit größer Wahrscheinlichkeit, dass sie mit einander befreundet sind. 3.1 Triadic Closure 3.1 Triadic Closure • Clustering Coefficient : – The clustering coefficient of a node A is defined as the probability that two randomly selected friends of A are friends with each other. 3.1 Triadic Closure • Betrachten wir Node A • Freunde von A : B,C,D,E • Es gibt 6 Möglichkeiten, um solche Nodes zu verbinden, gibt aber nur eine Kante (C,D) => Co(A) = 1/6 3.1 Triadic Closure • Reasons for Triadic Closure: – Opportunity • B, C have chances to meet when they both know A – Basis for Trusting • When B, C both know A, they can trust each other better then unconnected people – Incentive • A wanted to bring B, C together to avoid relationship’s problems 3.2 The Strength of Weak Tie • Bridges: – An edge (A,B) is a Bridge if deleting it would cause A,B to lie in 2 different components • Means there is only one route between A,B • Bridge is extremely rare in real social network 3.2 The Strength of Weak Tie • Local Bridge: – An edge (A,B) is a local Bridge if its endpoints have no friends in common (if deleting the edge would increase the distance between A and B to a value strictly more than 2.) • Span: – span of a local bridge is the distance its endpoints would be from each other if the edge were deleted 3.2 The Strength of Weak Tie 3.2 The Strength of Weak Tie • The Strong Triadic Closure Property. – a node A violates the Strong Triadic Closure Property if it has strong ties to two other nodes B and C, and there is no edge at all (either a strong or weak tie) between B and C. • We say that a node A satisfies the Strong Triadic Closure Property if it does not violate it. 3.2 The Strength of Weak Tie • Local Bridges and Weak Ties. – If a node A in a network satifies the Strong Triadic Closure Property and is involved in at least two strong ties, then any local bridge it is involved in must be a weak tie 3.3 Tie Strength and Network Structure in Large-Scale Data • Generalizing the Notions of Weak Ties and Local Bridges: – Neighborhood overlap – NO(A, B) = 0 if (A,B) is local Bridge • No common neighbor 3.3 Tie Strength and Network Structure in Large-Scale Data • Empirical Results on Tie Strength and Neighborhood Overlap. • Dependence between tie strength of an edge and its neighborhood overlap: – neighborhood overlap should grow as tie strength grows • Weak ties servers for keeping giant component intact 3.4 Tie Strength, Social Media, and Passive Engagement • reciprocal (mutual) communication – user both sent messages to the friend at the other end of the link, and also received messages from them during the observation period. • one-way communication – user sent one or more messages to the friend at the other end of the link • maintained relationship – user followed information about the friend at the other end of the link, whether or not actual communication took place (z.B : news von Facebook) Tie Strength in Twitter 3.5 Closure, Structural Holes, and Social Capital • Embeddedness: – embeddedness of an edge in a network is the number of common neighbors the two endpoints have. – Numerator of neighborhood overlap • Bridge has embeddedness 0 3.5 Closure, Structural Holes, and Social Capital 3.5 Closure, Structural Holes, and Social Capital • Closure and Bridging as Forms of Social Capital. • two important sources of variation – (1) property of a group, with some groups functioning more effectively than others because of favorable properties of their social structures or networks – (2) based on whether • social capital is a property that is purely intrinsic to a group — based only on the social interactions among the group’s members – or whether • it is also based on the interactions of the group with the outside world. 3.6 Advanced Material: Betweenness Measures and Graph Partitioning A. A Method for Graph Partitioning General Approaches to Graph Partitioning. 1) Identifying and removing the “spanning links” between densely-connected regions. ( which would break network apart) 2) find nodes that are likely to belong to the same region and merge them together. ( which would make each Group larger) 3.6 Advanced Material: Betweenness Measures and Graph Partitioning • The Notion of Betweenness. – betweenness of an edge to be the total amount of flow it carries, counting flow between all pairs of nodes using this edge. • Using betweenness as unit for traffic • look for the edges that carry the most of traffic • if there are k shortest paths from A and B, then 1/k units of flow pass along each one. 3.6 Advanced Material: Betweenness Measures and Graph Partitioning 3.6 Advanced Material: Betweenness Measures and Graph Partitioning 3.6 Advanced Material: Betweenness Measures and Graph Partitioning 3.6 Advanced Material: Betweenness Measures and Graph Partitioning 3.6 Advanced Material: Betweenness Measures and Graph Partitioning 3.6 Advanced Material: Betweenness Measures and Graph Partitioning • The Girvan-Newman Method: Successively Deleting Edges of High Betweenness. – (1) Find the edge of highest betweenness — or multiple edges of highest betweenness, if there is a tie and remove these edges from the graph. – (2) Recalculate all betweennesses, and again remove the edge or edges of highest betweenness. – Redo (1) 3.6 Advanced Material: Betweenness Measures and Graph Partitioning • Es gibt noch eine andere Methode: – deleting edges of minimum total strength so as to separate two specified nodes (known as the problem of finding a minimum cut) – Find the same result as Girvan-Newman Method • Which methode is better is hard to say – more or less effective on different kinds of networks – Both work effectively only on small network 3.6 Advanced Material: Betweenness Measures and Graph Partitioning • B. Computing Betweenness Values – the definition of betweenness involves reasoning about the set of all the shortest paths between pairs of nodes. – how can we efficiently compute betweenness without the overhead of actually listing out all such paths? • We can compute betweennesses efficiently using breadth-first search – Computes total flow from 1 Node to all the other 3.6 Advanced Material: Betweenness Measures and Graph Partitioning • (1) Perform a breadth-first search of the graph, starting at a Vetex (A). • (2) Determine the number of shortest paths from A to each other node. • (3) Based on these numbers, determine the amount of flow from A to all other nodes that uses each edge. 3.6 Advanced Material: Betweenness Measures and Graph Partitioning 3.6 Advanced Material: Betweenness Measures and Graph Partitioning • Counting Shortest Paths. 3.6 Advanced Material: Betweenness Measures and Graph Partitioning • Determining Flow Values. 3.6 Advanced Material: Betweenness Measures and Graph Partitioning • Final Observations. – Methode works well on networks of moderate size (up to a few thousand nodes) – for larger networks, the need to recompute betweenness values in every step becomes computationally very expensive. • Effectiver : – approximating the betweenness – divisive and agglomerative methods.
Load more

Recommended publications
  • Why Do Academics Use Academic Social Networking Sites?
    International Review of Research in Open and Distributed Learning Volume 18, Number 1 February – 2017 Why Do Academics Use Academic Social Networking Sites? Hagit Meishar-Tal1 and Efrat Pieterse2 1Holon institute of Technology (HIT), 2Western Galilee College Abstract Academic social-networking sites (ASNS) such as Academia.edu and ResearchGate are becoming very popular among academics. These sites allow uploading academic articles, abstracts, and links to published articles; track demand for published articles, and engage in professional interaction. This study investigates the nature of the use and the perceived utility of the sites for academics. The study employs the Uses and Gratifications theory to analyze the use of ASNS. A questionnaire was sent to all faculty members at three academic institutions. The findings indicate that researchers use ASNS mainly for consumption of information, slightly less for sharing of information, and very scantily for interaction with others. As for the gratifications that motivate users to visit ASNS, four main ones were found: self-promotion and ego-bolstering, acquisition of professional knowledge, belonging to a peer community, and interaction with peers. Keywords: academic social-networking sites, users' motivation, Academia.edu, ResearchGate, uses and gratifications Introduction In the past few years, the Internet has seen the advent of academic social-networking sites (ASNS) such as Academia.edu and ResearchGate. These sites allow users to upload academic articles, abstracts, and links to published articles; track demand for their published articles; and engage in professional interaction, discussions, and exchanges of questions and answers with other users. The sites, used by millions (Van Noorden, 2014), constitute a major addition to scientific media.
    [Show full text]
  • Music As a Bridge: an Alternative for Existing Historical Churches in Reaching Young Adults David B
    Digital Commons @ George Fox University Doctor of Ministry Theses and Dissertations 1-1-2012 Music as a bridge: an alternative for existing historical churches in reaching young adults David B. Parker George Fox University This research is a product of the Doctor of Ministry (DMin) program at George Fox University. Find out more about the program. Recommended Citation Parker, David B., "Music as a bridge: an alternative for existing historical churches in reaching young adults" (2012). Doctor of Ministry. Paper 24. http://digitalcommons.georgefox.edu/dmin/24 This Dissertation is brought to you for free and open access by the Theses and Dissertations at Digital Commons @ George Fox University. It has been accepted for inclusion in Doctor of Ministry by an authorized administrator of Digital Commons @ George Fox University. GEORGE FOX UNIVERSTY MUSIC AS A BRIDGE: AN ALTERNATIVE FOR EXISTING HISTORICAL CHURCHES IN REACHING YOUNG ADULTS A DISSERTATION SUBMITTED TO THE FACULTY OF GEORGE FOX EVANGELICAL SEMINARY IN CANDIDACY FOR THE DEGREE OF DOCTOR OF MINISTRY BY DAVID B. PARKER PORTLAND, OREGON JANUARY 2012 Copyright © 2012 by David B. Parker All rights reserved. The Scripture quotations contained herein are from the New International Version Bible, copyright © 1984. Used by permission. All rights reserved. ii George Fox Evangelical Seminary George Fox University Newberg, Oregon CERTIFICATE OF APPROVAL ________________________________ D.Min. Dissertation ________________________________ This is to certify that the D.Min. Dissertation of DAVID BRADLEY PARKER has been approved by the Dissertation Committee on March 13, 2012 as fully adequate in scope and quality as a dissertation for the degree of Doctor of Ministry in Semiotics and Future Studies Dissertation Committee: Primary Advisor: Deborah Loyd, M.A.
    [Show full text]
  • Strong and Weak Ties
    From the book Networks, Crowds, and Markets: Reasoning about a Highly Connected World. By David Easley and Jon Kleinberg. Cambridge University Press, 2010. Complete preprint on-line at http://www.cs.cornell.edu/home/kleinber/networks-book/ Chapter 3 Strong and Weak Ties One of the powerful roles that networks play is to bridge the local and the global — to offer explanations for how simple processes at the level of individual nodes and links can have complex effects that ripple through a population as a whole. In this chapter, we consider some fundamental social network issues that illustrate this theme: how information flows through a social network, how different nodes can play structurally distinct roles in this process, and how these structural considerations shape the evolution of the network itself over time. These themes all play central roles throughout the book, adapting themselves to different contexts as they arise. Our context in this chapter will begin with the famous “strength of weak ties” hypothesis from sociology [190], exploring outward from this point to more general settings as well. Let’s begin with some backgound and a motivating question. As part of his Ph.D. thesis research in the late 1960s, Mark Granovetter interviewed people who had recently changed employers to learn how they discovered their new jobs [191]. In keeping with earlier research, he found that many people learned information leading to their current jobs through personal contacts. But perhaps more strikingly, these personal contacts were often described
    [Show full text]
  • Myspace, Facebook, and the Strength of Internet Ties
    MYSPACE, FACEBOOK, AND THE STRENGTH OF INTERNET TIES: ONLINE SOCIAL NETWORKING AND BRIDGING SOCIAL CAPITAL A Thesis Presented to The Graduate Faculty of The University of Akron In Partial Fulfillment of the Requirements for the Degree Master of Arts Angela M. Adkins May, 2009 May, 2009 MYSPACE, FACEBOOK, AND THE STRENGTH OF INTERNET TIES: ONLINE SOCIAL NETWORKING AND BRIDGING SOCIAL CAPITAL Angela M. Adkins Thesis Approved: Accepted: ______________________________ ______________________________ Advisor Dean of the College Dr. Rebecca J. Erickson Dr. Chand Midha ______________________________ ______________________________ Faculty Reader Dean of the Graduate School Dr. Clare L. Stacey Dr. George R. Newkome ______________________________ ______________________________ Department Chair Date Dr. John F. Zipp ii ABSTRACT Online social networking sites seem particularly well-suited to forming the loose connections between diverse social networks, or weak ties, associated with bridging social capital, but is using one site the same as using another? This study explores the user and usage characteristics of two popular social networking websites, Myspace and Facebook, and then investigates the relationship between online social networking and bridging social capital using survey data from 929 university students and faculty members. Myspace users tend to have less education and be more racially diverse, have lower incomes, and focus more on forming new social ties online. Conversely, Facebook users tend to be better educated, have higher income, and focus more on maintaining relationships with their existing offline ties. A positive association exists between the degree of online social networking and bridging capital, although there was no meaningful difference in bridging capital between those who used Myspace only and those who used Facebook only.
    [Show full text]
  • Bridge Centrality: a Network Approach to Understanding Comorbidity
    Multivariate Behavioral Research ISSN: 0027-3171 (Print) 1532-7906 (Online) Journal homepage: https://www.tandfonline.com/loi/hmbr20 Bridge Centrality: A Network Approach to Understanding Comorbidity Payton J. Jones, Ruofan Ma & Richard J. McNally To cite this article: Payton J. Jones, Ruofan Ma & Richard J. McNally (2019): Bridge Centrality: A Network Approach to Understanding Comorbidity, Multivariate Behavioral Research, DOI: 10.1080/00273171.2019.1614898 To link to this article: https://doi.org/10.1080/00273171.2019.1614898 View supplementary material Published online: 10 Jun 2019. Submit your article to this journal View Crossmark data Full Terms & Conditions of access and use can be found at https://www.tandfonline.com/action/journalInformation?journalCode=hmbr20 MULTIVARIATE BEHAVIORAL RESEARCH https://doi.org/10.1080/00273171.2019.1614898 Bridge Centrality: A Network Approach to Understanding Comorbidity Payton J. Jonesa , Ruofan Mab, and Richard J. McNallya aDepartment of Psychology, Harvard University; bDepartment of Psychology, University of Waterloo ABSTRACT KEYWORDS Recently, researchers in clinical psychology have endeavored to create network models of Graph theory; network the relationships between symptoms, both within and across mental disorders. Symptoms analysis; psychopathology; that connect two mental disorders are called "bridge symptoms." Unfortunately, no formal bridge nodes; node centrality linear models; quantitative methods for identifying these bridge symptoms exist. Accordingly, we devel- comorbidity oped four network statistics to identify bridge symptoms: bridge strength, bridge between- ness, bridge closeness, and bridge expected influence. These statistics are nonspecific to the type of network estimated, making them potentially useful in individual-level psychometric networks, group-level psychometric networks, and networks outside the field of psychopath- ology such as social networks.
    [Show full text]
  • Social Networking Analysis
    Social Networking Analysis Kevin Curran and Niamh Curran Abstract A social network indicates relationships between people or organisations and how they are connected through social familiarities. The concept of social net- work provides a powerful model for social structure, and that a number of important formal methods of social network analysis can be perceived. Social network analysis can be used in studies of kinship structure, social mobility, science citations, con- tacts among members of nonstandard groups, corporate power, international trade exploitation, class structure and many other areas. A social network structure is made up of nodes and ties. There may be few or many nodes in the networks or one or more different types of relations between the nodes. Building a useful understanding of a social network is to sketch a pattern of social relationships, kinships, community structure, interlocking dictatorships and so forth for analysis. 1 Introduction Communication is and has always been vital to the growth and the development of human society. An individual’s attitudes opinions and behaviours can only be characterised in a group or community [5]. Social networking is not an exact science, it can be described as a means of discovering the method in which problems are solved, how individuals achieve goals and how businesses and operations are run. In network theory, social networks are discussed in terms of node and ties (see Fig. 1). Nodes are individual actors and ties are relationships within networks. The social capital of individual nodes/actors can be measured through social network diagrams, as can measures of determination of the usefulness of the network to the actors individually [4].
    [Show full text]
  • Gohitchhike - Object-Centered Social Networking Site
    GoHitchhike - Object-centered Social Networking Site: To Bridge Online and Physical Interactions A Thesis Submitted to the Faculty of the Interactive Design and Game Development Department in Partial Fulfillment of the Requirements for the Degree of Master of Fine Arts Savannah College of Art and Design By Yu-Wei Fu Savannah, Georgia, USA May 2010 Acknowledgements In addition to my thesis committee, I would like to extend a grand appreciation to Professor Andrew Hieronymi for help through the usability aspects of the wireframe development, Jennifer Johnson for professional writing supports of the thesis paper, Shao Ying Lee and Peter Huang for technical supports of the website development. Thank you. Fu 1 Thesis Abstract Social websites can be categorized into two groups: focusing on objects or focusing on people. The general socializing concept of an object-centered website rarely emphasizes actual physical interaction. GoHitchhike is an object-centered social networking site that attempts to bridge the online and physical interactions. Any social interactions online and in the real world revolve around the objects acquired and transported. This trend improves on current social networking websites by combining three concepts: emotional objects, social network service, and physical interaction. Additionally, GoHitchhike utilizes the concept of emotional objects to tailor the social correspondence and experience of the users. Through such process, users can benefit through shared adventures and learn cultural significance of the requested items, therefore not only crossing location specific boundaries but also cultural boundaries as well. Fu 2 1. Introduction The Social Web is currently used to describe how people socialize or interact with each other throughout the World Wide Web.
    [Show full text]
  • A Structural Approach to Contact Recommendations in Online Social Networks
    A Structural Approach to Contact Recommendations in Online Social Networks Scott A. Golder Sarita Yardi Cornell University Georgia Institute of Ithaca, NY 14850 Technology [email protected] Atlanta, GA 30332 [email protected] Alice Marwick danah boyd New York University Microsoft Research New New York, NY 10003 England [email protected] Cambridge, MA 02142 [email protected] ABSTRACT as potential new ties is heavily dependent on our existing People generally form network ties with those similar to set of ties – e.g. friends of friends – and on the organiza- them. However, it is not always easy for users of social tions of which we are part, such as schools, workplaces and media sites to find people to connect with, decreasing the community groups [8]. utility of the network for its users. This position paper looks at different ways we can make friend recommenda- At the same time, since homophily lessens exposure to peo- tions, or suggest users to follow on the microblogging site ple who are different in terms of their attitudes, experiences Twitter. We examine a number of ways in which similarity and information, people often actively seek new sources of can be defined, and the implications of these differences for information, and so they must venture outside of their local community-building. People may want different things for networks and create social ties that bridge relatively length- friend suggestions, which has implications for both future ier social distances to individuals who are different from research and product design. them, and thus have access to different information [4][10].
    [Show full text]
  • Social Network Analysis Lecture 5–Strength of Weak Ties Paradox
    Social network Analysis Lecture 5{Strength of weak ties paradox Donglei Du Faculty of Business Administration, University of New Brunswick, NB Canada Fredericton E3B 9Y2 ([email protected]) Du (UNB) Social network 1 / 31 Table of contents 1 An introduction 2 Link roles A theory to explain the strength of weak ties 3 Node roles Structural holes 4 Case study Tie Strength on Facebook Tie Strength on Twitter Du (UNB) Social network 2 / 31 Outline We first look at how links can play different role in the network structure: a few edges spanning different groups while most are surrounded by dense patterns of connections. We then look at how nodes can play different role in the network structure. Du (UNB) Social network 3 / 31 Strength of weak ties: Mark Granovetter: "It is the distant acquaintances who are actually to thank for crucial information leading to your new job, rather than your close friends!" Mark Granovetter (born October 20, 1943): an American sociologist and professor at Stanford University. 1969: submitted his paper to the American Sociological Review|rejected! 1972, submitted a shortened version to the American Journal of Sociology|published in 1973 (Granovetter, 1973). According to Current Contents, by 1986, the Weak Ties paper had become a citation classic, being one of the most cited papers in sociology. Du (UNB) Social network 4 / 31 Strong vs weak ties Tie strength refers to a general sense of closeness with another person: Strong ties: the stronger links, corresponding to friends, dependable sources of social or emotional support; Weak ties: the weaker links, corresponding to acquaintances.
    [Show full text]
  • Social and Information Networks
    Social and Information Networks University of Toronto CSC303 Winter/Spring 2019 Week 2: January 14,16 (2019) 1 / 42 Todays agenda Last weeks lectures and tutorial: a number of basic graph-theoretic concepts: I undirected vs directed graphs I unweighted and vertex/edge weighted graphs I paths and cycles I breadth first search I connected components and strongly connected components I giant component in a graph I bipartite graphs This lecture: Chapter 3 of the textbook on \Strong and Weak Ties". But let's first briefly return to the \romantic relations" table to see how graph structure may or may not align with our understanding of sociological phenomena. 2 / 42 The dispersion of edge In their paper, Backstrom and Kleinberg introduce various dispersion measures for an edge. The general idea of the dispersion of an edge (u; v) is that mutual neighbours of u and v should not be well \well-connected" to one another. They consider dense subgraphs of the Facebook network (where a known relationship has been stated) and study how well certain dispersion measures work in predicting a relationship edge (marriage, engagement, relationship) when one is known to exist. Another problem is to discover which individuals have a romantic relationship. Note that discovering the romantic edge or if one exists raises questions of the privacy of data. They compare their dispersion measures against the embeddedmess of an edge (to be defined) and also against certain semantic interaction features (e.g., appearance together in a photo, viewing the profile of a neighbour). 3 / 42 Performance of (Dispersion + b)^a/(Embededness + c) type embed rec.disp.
    [Show full text]
  • Small World Networks and Clustered Small World Networks with Random Connectivity Faraz Zaidi
    Small world networks and clustered small world networks with random connectivity Faraz Zaidi To cite this version: Faraz Zaidi. Small world networks and clustered small world networks with random connectivity. Social Network Analysis and Mining, Springer, 2012. hal-00679660 HAL Id: hal-00679660 https://hal.archives-ouvertes.fr/hal-00679660 Submitted on 16 Mar 2012 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. To be inserted manuscript No. (will be inserted by the editor) Small World Networks and Clustered Small World Networks with Random Connectivity Faraz Zaidi Received: date / Accepted: date Abstract The discovery of small world properties in real world networks has rev- olutionized the way we analyze and study real world systems. Mathematicians and Physicists in particular have closely studied and developed several models to artifi- cially generate networks with small world properties. The classical algorithms to pro- duce these graphs artificially, make use of the fact that with the introduction of some randomness in ordered graphs, small world graphs can be produced. In this paper, we present a novel algorithm to generate graphs with small world properties based on the idea that with the introduction of some order in a random graph, small world graphs can be generated.
    [Show full text]
  • User Behavior, Social Networking, and Playing Style in Online And
    User Behavior, Social Networking, and Playing Style in Online and Face to Face Bridge Communities Mihaela Balint, Vlad Posea, Alexandru Dimitriu Alexandru Iosup Politehnica University of Bucharest, Delft University of Technology, Romania The Netherlands Massively Social Gaming Bridge as traditional card game (online) games with massive numbers • Duplicate bridge: same hand at of players (100K+), for which social every table, eliminates luck interaction improves the gaming experience • Millions of players world-wide • Only team game at World Mind Sport Bridge as massively social game • Complex agreements between partners (like a social partnership) • A good pair forms in a very long Key market advantage: period of time (like a social …) Use [Social Network] analysis to improve gameplay experience • Online stats, pairing, ranking? Zynga CTO • Use SocNet analysis NetGames, Taiwan, 2010 – Analysis of BBO Fans 1 Key Idea: Social Network Analysis Play Relationships=Social Graph Edges Loco BBO BBO Fans Period Jan 1-Dec 31, 2009 Sep 5-Oct 15, 2009 Tournaments/Week 4 n/a 21 Example: Player Types Players 275 142,401 8,609 • Community Builder Hands 28,756 3,115,536 565,799 plays many hands with many other players • Community Member plays mostly with a few community members • Faithful Player 1-2 stable partners • Random Player no stable partner (Memory jog: Creating a bridge relationship takes longer than creating a relationship in FaceBook, Orkut, …) NetGames, Taiwan, 2010 – Analysis of BBO Fans 2 Massively Social Gaming • Million-users, multi-bn. market http://BridgeHelper.org • Content, World Sim, Analytics Current Technology Our Vision • Complete game mechanics • Social Network Analysis + • Basic social network tools Applications = BridgeHelper • Makes players unhappy • Many starters quit Ongoing Work • More analysis • Ranking • Matchmaking The Future • Scalability, efficiency • Happy players NetGames, Taiwan, 2010 – Analysis of BBO Fans 3.
    [Show full text]