{"id":3354,"date":"2012-01-13T10:07:31","date_gmt":"2012-01-13T18:07:31","guid":{"rendered":"http:\/\/www.mightyelephant.com\/ams\/?p=3354"},"modified":"2016-04-22T17:15:54","modified_gmt":"2016-04-23T01:15:54","slug":"my-social-network","status":"publish","type":"post","link":"https:\/\/www.mightyelephant.com\/ams\/my-social-network\/","title":{"rendered":"Project 7: My Social Network"},"content":{"rendered":"<figure id=\"attachment_3519\" aria-describedby=\"caption-attachment-3519\" style=\"width: 300px\" class=\"wp-caption aligncenter\"><a href=\"http:\/\/www.mightyelephant.com\/ams\/wp-content\/uploads\/2011\/10\/grhdr1.gif\"><img loading=\"lazy\" decoding=\"async\" class=\"size-medium wp-image-3519 \" title=\"Graphs\" src=\"http:\/\/www.mightyelephant.com\/ams\/wp-content\/uploads\/2011\/10\/grhdr1-300x143.gif\" alt=\"Graphs\" width=\"300\" height=\"143\" srcset=\"https:\/\/www.mightyelephant.com\/ams\/wp-content\/uploads\/2011\/10\/grhdr1-300x143.gif 300w, https:\/\/www.mightyelephant.com\/ams\/wp-content\/uploads\/2011\/10\/grhdr1.gif 430w\" sizes=\"auto, (max-width: 300px) 100vw, 300px\" \/><\/a><figcaption id=\"caption-attachment-3519\" class=\"wp-caption-text\">My Social Network &#8211; Graph<\/figcaption><\/figure>\n<h3><\/h3>\n<h3>AUTHORS:\u00a0 Bovril and Radiance<\/h3>\n<h3><\/h3>\n<h3>STATUS:Completed<\/h3>\n<p>This project is to develop a social network and submit it as a science fair project. The topics covered includes: social sciences (social network analysis), math (graph theory, statistics and matrix operations), and communication. Part of the objective will be to discover the alphas and cliques within a limited network of friends and acquaintances (no actual names will be used).<\/p>\n<h3>INTRODUCTION<\/h3>\n<p>People are, by nature, social animals. \u00a0This is of such\u00a0importance\u00a0that their connections and\u00a0relationships, their social network, defines who they are. \u00a0Families, clubs, church groups and friend circles are examples of social networks. \u00a0In fact, any activity where people have to come together and do something as a group can become a social network.<\/p>\n<p>Recently, many websites have been created to utilise the social nature of humans. \u00a0For example: Facebook, LinkedIn, Amazon.com and Ebay and even Schoology, allow people to<\/p>\n<ol>\n<li>find each other<\/li>\n<li>share ideas<\/li>\n<li>share likes and\u00a0dislikes<\/li>\n<li>share experiences and photos<\/li>\n<li>allow business to market their products<\/li>\n<\/ol>\n<p>and so many more.<\/p>\n<p><!--more--><\/p>\n<h3><strong>BACKGROUND<\/strong><\/h3>\n<p>This project is about discovering the characteristics of a particular social circle &#8211; a small sample of students and how they connect with each other and about what they might like and how they could become friends through common interests (likes). \u00a0To be clear, none of their real names will be used in this experiment.<\/p>\n<p>A graph is a mathematical concept made of vertices (nodes) and edges (relationships). \u00a0They can be fairly simple or extremely complex. \u00a0They have very interesting characteristics and are used in many different ways to model all kinds of things and their relationships. \u00a0They are extremely useful for solving many types of problems from traffic patterns to marketing strategy.<\/p>\n<p>There&#8217;s a lot of material written about how social networks can be studied using the mathematics of graphs. \u00a0This has become a popular area of research today, as large social networks are being created and grown so rapidly.<\/p>\n<h3>OBJECTIVE<\/h3>\n<p>Learn how graphs as a topic in mathematics can be used in social networks to discover interesting and useful information.<\/p>\n<h3>HYPOTHESIS<\/h3>\n<p>Using social networks, can we find the cliques, friends and potential new friends through common likes? \u00a0Can we show that graphs are useful to help figure out these things?<\/p>\n<h3>TOOLS AND METHODS<\/h3>\n<p>The tools we used included: a graph database software, spreadsheet and survey forms for collecting the data.<\/p>\n<p>1. Design and build a model of a social\u00a0network using a graph.<\/p>\n<ol>\n<li>Create students and activities (vertices)<\/li>\n<li>Define relationship (edges)<\/li>\n<li>Using a survey, add the students, their friends and their likes (what activities they like to do)<\/li>\n<\/ol>\n<figure id=\"attachment_3589\" aria-describedby=\"caption-attachment-3589\" style=\"width: 465px\" class=\"wp-caption alignleft\"><a href=\"http:\/\/www.mightyelephant.com\/ams\/wp-content\/uploads\/2011\/10\/Screenshot-at-2012-01-08-201229.png\"><img loading=\"lazy\" decoding=\"async\" class=\" wp-image-3589 \" title=\"First Graph\" src=\"http:\/\/www.mightyelephant.com\/ams\/wp-content\/uploads\/2011\/10\/Screenshot-at-2012-01-08-201229-300x182.png\" alt=\"First Graph\" width=\"465\" height=\"281\" \/><\/a><figcaption id=\"caption-attachment-3589\" class=\"wp-caption-text\">First Graph<\/figcaption><\/figure>\n<p>2. Collect data using this questionnaire:\u00a0<a href=\"http:\/\/www.mightyelephant.com\/ams\/wp-content\/uploads\/2011\/10\/Questionnaire.pdf\">Survey Questionnaire<\/a>\u00a0and enter the data into the graph.\u00a0 We limit the survey to the level of friends of friends starting with us, in other words, 3 levels friendship so we have enough data but not enough to overwhelm us.\u00a0 We&#8217;re not trying to research the entire 6th grade class.<\/p>\n<p>3. Using a spreadsheet we analyse the graph and find the simple degree centrality of the different students and\u00a0activities.\u00a0 Depending on the question we want to answer, we might use a modified degree centrality\u00a0\u00a0 to find the students who might have the most influence &#8211; the alpha.\u00a0 We&#8217;ll figure out how many connections they have, then sum the friendliness factors and multiply.\u00a0 The highest score will be the alpha.\u00a0 We&#8217;ll do the same thing to find the most popular activities (without the\u00a0friendliness factor).\u00a0 And we&#8217;ll just look at the graph to find any cliques (cycles).\u00a0 We&#8217;ll also just do simple matching of potential friends by looking at the graph and figuring out students who have many likes in common but are not yet friends.<\/p>\n<h3>EXPERIMENT<\/h3>\n<p><strong>Survey<\/strong><\/p>\n<p>We collected data from 30 different students and build a graph of them and their friends. We were able to record a &#8220;friendliness&#8221;, a rating of their friendship from 1 to 5.\u00a0 We also got their likes of 8 different activities: volleyball, soccer, dance, swimming, drama, baseball and lacrosse.<\/p>\n<p><strong>\u00a0Analysis<\/strong><\/p>\n<p>We ended up using a unique centrality, which we call the &#8220;Bovril-Radiance&#8221; \u00a0(B-R) centrality.\u00a0 It basically takes the average of the &#8220;friendliness&#8221; and multiplied it by a hundred.\u00a0 We used a thing called an adjacency matrix to figure out the B-R centrality.<\/p>\n<p><strong>My Social Network<\/strong><\/p>\n<figure id=\"attachment_3620\" aria-describedby=\"caption-attachment-3620\" style=\"width: 451px\" class=\"wp-caption alignleft\"><a href=\"http:\/\/www.mightyelephant.com\/ams\/wp-content\/uploads\/2011\/10\/Screenshot-at-2012-01-12-01_05_10.png\"><img loading=\"lazy\" decoding=\"async\" class=\" wp-image-3620 \" title=\"Final Graph\" src=\"http:\/\/www.mightyelephant.com\/ams\/wp-content\/uploads\/2011\/10\/Screenshot-at-2012-01-12-01_05_10-300x182.png\" alt=\"Final Graph\" width=\"451\" height=\"273\" \/><\/a><figcaption id=\"caption-attachment-3620\" class=\"wp-caption-text\">Final Graph<\/figcaption><\/figure>\n<p><strong>Likes<\/strong><\/p>\n<table border=\"1\" width=\"462\">\n<tbody>\n<tr>\n<td style=\"text-align: center;\"><strong>activity<\/strong><\/td>\n<td style=\"text-align: center;\">\u00a0<strong>degree centrality<\/strong><\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\">volleyball<\/td>\n<td style=\"text-align: center;\">13<\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\">dance<\/td>\n<td style=\"text-align: center;\">9<\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\">soccer<\/td>\n<td style=\"text-align: center;\">6<\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\">drama<\/td>\n<td style=\"text-align: center;\">5<\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\">baseball<\/td>\n<td style=\"text-align: center;\">3<\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\">reading<\/td>\n<td style=\"text-align: center;\">2<\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\">swimming<\/td>\n<td style=\"text-align: center;\">1<\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\">lacrosse<\/td>\n<td style=\"text-align: center;\">1<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p>&nbsp;<\/p>\n<h3>\u00a0CONCLUSION<\/h3>\n<p>Using the &#8220;Bovril-Radiance&#8221; centrality, we were able to figure out who had the best friends.\u00a0 It turned out to be Bovril (120.0) with Radiance (74.3), Mint (57.1), Ornate (51.4) and Dolphin (54.3) in the top group.\u00a0 This suggests they were the most influential students in this group. \u00a0The results are a little bit not right because the researchers were part of the experiment, so they had a better opportunity for linking up their friends than the other\u00a0subjects. \u00a0If they are removed from the graph, the graph might be more realistic and not so heavily centered\u00a0around\u00a0Bovril.<\/p>\n<p>We were also able to find the most popular activity.\u00a0 It was volleyball scored 13 while dance came in second at 9.\u00a0 Most likely, because so many students liked volleyball, they might be able to form friendship by their interest in volleyball.\u00a0 New friends might be able to form from these common interests, specially volleyball and dance.<\/p>\n<h3>REFERENCES<\/h3>\n<ol>\n<li><a title=\"Social Network Analysis - Wikipedia\" href=\"http:\/\/en.wikipedia.org\/wiki\/Social_network_analysis\">Social Network Analysis &#8211; Wikipedia<\/a><\/li>\n<li><a title=\"Graph Theory Fun Quiz\" href=\"http:\/\/www.funtrivia.com\/trivia-quiz\/SciTech\/Basics-of-Graph-Theory-318264.html\" target=\"_blank\">Graph Theory Fun Quiz<\/a><\/li>\n<li><a title=\"More Fun Graph Stuff\" href=\"http:\/\/wps.prenhall.com\/esm_blitzer_thinkmath_2\/10\/2683\/687020.cw\/index.html\" target=\"_blank\">More Fun Graph Stuff<\/a><\/li>\n<li><a title=\"Graphs\" href=\"http:\/\/en.wikipedia.org\/wiki\/Graph_(mathematics)\" target=\"_blank\">Graphs<\/a><\/li>\n<li><a title=\"Graph Centrality - Wikipedia\" href=\"http:\/\/en.wikipedia.org\/wiki\/Centrality\" target=\"_blank\">Graph Centrality<\/a><\/li>\n<\/ol>\n","protected":false},"excerpt":{"rendered":"<p>AUTHORS:\u00a0 Bovril and Radiance STATUS:Completed This project is to develop a social network and submit it as a science fair project. The topics covered includes: social sciences (social network analysis), math (graph theory, statistics and matrix operations), and communication. Part of the objective will be to discover the alphas and cliques within a limited network &hellip; <a href=\"https:\/\/www.mightyelephant.com\/ams\/my-social-network\/\" class=\"more-link\">Continue reading <span class=\"screen-reader-text\">Project 7: My Social Network<\/span> <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":3,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[81,6,3,28],"tags":[90,89,138,88,91,213,87,238],"class_list":["post-3354","post","type-post","status-publish","format-standard","hentry","category-6th-grade","category-projects","category-school","category-science-fair","tag-adjacency-matrix","tag-graphs","tag-math","tag-networks","tag-relationships","tag-science-project","tag-sna","tag-stem"],"_links":{"self":[{"href":"https:\/\/www.mightyelephant.com\/ams\/wp-json\/wp\/v2\/posts\/3354","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.mightyelephant.com\/ams\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.mightyelephant.com\/ams\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.mightyelephant.com\/ams\/wp-json\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/www.mightyelephant.com\/ams\/wp-json\/wp\/v2\/comments?post=3354"}],"version-history":[{"count":116,"href":"https:\/\/www.mightyelephant.com\/ams\/wp-json\/wp\/v2\/posts\/3354\/revisions"}],"predecessor-version":[{"id":6618,"href":"https:\/\/www.mightyelephant.com\/ams\/wp-json\/wp\/v2\/posts\/3354\/revisions\/6618"}],"wp:attachment":[{"href":"https:\/\/www.mightyelephant.com\/ams\/wp-json\/wp\/v2\/media?parent=3354"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.mightyelephant.com\/ams\/wp-json\/wp\/v2\/categories?post=3354"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.mightyelephant.com\/ams\/wp-json\/wp\/v2\/tags?post=3354"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}