{"id":288,"date":"2015-04-06T16:38:46","date_gmt":"2015-04-06T16:38:46","guid":{"rendered":"http:\/\/blog.soton.ac.uk\/skillted\/?p=288"},"modified":"2015-04-29T13:46:44","modified_gmt":"2015-04-29T13:46:44","slug":"final-thoughts-on-graph-theory-for-skillted","status":"publish","type":"post","link":"https:\/\/blog.soton.ac.uk\/skillted\/2015\/04\/06\/final-thoughts-on-graph-theory-for-skillted\/","title":{"rendered":"More Graph Theory concepts related to Skillted"},"content":{"rendered":"

\"triadic-closure\"<\/a>To shed more light on the previous post<\/a>, as to how graph theory can help inform better business decisions, more graph theory concepts that could relate to the Skillted network are elaborated upon.<\/p>\n

 <\/p>\n

Triadic Closure<\/strong><\/span><\/p>\n

Three nodes in a social network could exhibit the property known as Triadic closure. Triadic closure occurs when two of the three nodes happen to have strong ties with the third node. Hence for users Alice, Bob and Carol, a strong relationship exists between Alice and Bob and also between Alice and Carol. This follows that a weak tie exists between Bob and Carol.<\/p>\n

In Skillted, if user Alice had bartered skill successfully with user Bob and user Carol subsequently, (and Bob happened to have a skill that Carol requires) user Bob and user Carol would eventually barter skill successfully in the future. This could occur by word of mouth by Alice to either Bob and Carol about the skill either parties required and since Alice has worked with both parties in the past, it would provide a basis for them to trust each other.<\/p>\n

 <\/p>\n

Scale-free network<\/strong><\/span><\/p>\n

Scale free networks are networks in which the degree distribution among nodes follow the power-law distribution. The Skillted network could be a scale free network if there exists a substantial number of highly skilled users with successful reviews. These users would tend to have other users in the network interact with them due to the good reputation they have built over time.<\/p>\n

 <\/p>\n

Structural Holes and Social Capital<\/strong><\/span><\/p>\n

Users with rare desirable skills or\/and many good reviews could form Structural Holes within the network. These sort of users have established social capital hence an advantage in the network.<\/p>\n

 <\/p>\n

Tie Strengths within the Skillted Network<\/span><\/strong><\/p>\n

Ties strengths could be strong, weak or absent. Two users could have strong ties\u00a0between them if they have successfully bartered skills before. Weak ties between two users,\u00a0if they have transacted with another mutual user as explained in Triadic Closure above. A tie is non-existent between two users if their interaction is intelligible.<\/p>\n

 <\/p>\n

Although graph theory and some of its concepts could be rigorous and mostly considered an academic chore, applying these concepts and interpreting the social network to be formed by users of Skillted brings about some enlightenment and interesting nuances that would help make better design and business decisions while the app is being developed.<\/p>\n

 <\/p>\n

References<\/strong><\/span><\/p>\n

1 Peter V. Madsen, Karen E. Campbell;\u00a0Measuring Tie Strength – Social Forces, Vol. 63, No. 2 (Dec., 1984), pp. 482-501<\/a><\/p>\n

2\u00a0 Granovetter, M.S. . “The Strength of Weak Ties”, Amer. J. of Sociology, Vol. 78, Issue 6, May 1973<\/p>\n

3\u00a0Easley, D. and Kleinberg, J. Networks Crowds and Markets<\/a>. Cambridge University Press, 2010.<\/p>\n

4 Lecture Notes on Graph Theory –\u00a0http:\/\/www.edshare.soton.ac.uk\/6662\/1\/3-graph-theory-social-nets.pdf<\/p>\n

Image Credits:\u00a0http:\/\/crzyjcky.com\/2013\/01\/20\/who-will-be-your-next-friend\/<\/p>\n","protected":false},"excerpt":{"rendered":"

To shed more light on the previous post, as to how graph theory can help inform better business decisions, more graph theory concepts that could relate to the Skillted network are elaborated upon.   Triadic Closure Three nodes in a social network could exhibit the property known as Triadic closure. Triadic closure occurs when two of the three nodes happen… Read more → <\/a><\/span><\/p>\n","protected":false},"author":97412,"featured_media":308,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[8883],"tags":[15092,32028,437,918020],"class_list":["post-288","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-related-academic-work","tag-clustering","tag-graphs","tag-reputation","tag-skillted"],"_links":{"self":[{"href":"https:\/\/blog.soton.ac.uk\/skillted\/wp-json\/wp\/v2\/posts\/288","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blog.soton.ac.uk\/skillted\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blog.soton.ac.uk\/skillted\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blog.soton.ac.uk\/skillted\/wp-json\/wp\/v2\/users\/97412"}],"replies":[{"embeddable":true,"href":"https:\/\/blog.soton.ac.uk\/skillted\/wp-json\/wp\/v2\/comments?post=288"}],"version-history":[{"count":9,"href":"https:\/\/blog.soton.ac.uk\/skillted\/wp-json\/wp\/v2\/posts\/288\/revisions"}],"predecessor-version":[{"id":357,"href":"https:\/\/blog.soton.ac.uk\/skillted\/wp-json\/wp\/v2\/posts\/288\/revisions\/357"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/blog.soton.ac.uk\/skillted\/wp-json\/wp\/v2\/media\/308"}],"wp:attachment":[{"href":"https:\/\/blog.soton.ac.uk\/skillted\/wp-json\/wp\/v2\/media?parent=288"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.soton.ac.uk\/skillted\/wp-json\/wp\/v2\/categories?post=288"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.soton.ac.uk\/skillted\/wp-json\/wp\/v2\/tags?post=288"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}