{"id":15459,"date":"2019-07-15T16:34:58","date_gmt":"2019-07-15T20:34:58","guid":{"rendered":"http:\/\/studentwork.prattsi.org\/infovis\/?p=15459"},"modified":"2019-07-15T16:36:07","modified_gmt":"2019-07-15T20:36:07","slug":"friendship-network-of-a-german-boys-school-class-of-1880-81","status":"publish","type":"post","link":"https:\/\/studentwork.prattsi.org\/infovis\/visualization\/friendship-network-of-a-german-boys-school-class-of-1880-81\/","title":{"rendered":"Friendship network of a german boys’ school class of 1880-81"},"content":{"rendered":"\n

INTRODUCTION<\/p>\n\n\n\n

One of the initial attempts to map networks in social structures was made by a German primary school teacher Johannes Delitsch. He built a friendship network upon the students of his class from 1880 to 1881. The network delineates reciprocity among students, and considers the influence of class ranking order on their relationships. I acquired the dataset of this study and visualized it on Gephi.  <\/p>\n\n\n\n

MATERIALS<\/p>\n\n\n\n

I found the dataset on Github<\/a>.<\/p>\n\n\n\n

I used Gephi<\/a>, an open source network analysis and visualization software to prepare the following visualizations. <\/p>\n\n\n\n

PROCESS<\/p>\n\n\n\n

I imported the file onto Gephi and ran the statistics. It helped in analyzing the social network. Hereafter I began playing with the appearance and layouts to see what depicted the network dynamics best. I used ForceAtlas 2 for the layout, and I applied a color palette to the nodes and edges. For the following visualization, I used a range of 10 – 30 for the size of the nodes. In this, the attribute depicting the class ranking of the students determined the size. I realized that the highest ranking student is represented within a small circle, and by a light color which made it even less appreciable. <\/p>\n\n\n\n

\"\"<\/figure>\n\n\n\n

I improvised in this next visualization by inverting the size range to represent the higher ranking students with larger nodes. I did not invert the color scheme to avoid complete non-recognition of the smaller circles. I colored the edges based on weight. In the preview section, I gave labels to the nodes and deselected curved lines for edges. This is a directional network which illustrates reciprocity via the arrow heads. <\/p>\n\n\n\n

\"\"<\/figure>\n\n\n\n

RESULTS<\/p>\n\n\n\n

It appears through the visualization that most high ranking students are also the most popular ones in class, as they are condensed in the center with several bi-directional arrows suggesting reciprocity. All the students except a few isolated ones are well connected within this friendship network. Predominantly, the friendships are also reciprocated. <\/p>\n\n\n\n

REFLECTION<\/p>\n\n\n\n

Gephi worked well in representing this social network with analytical insights. I liked the feature of statistics which offers an instant analytical scan before designing the visualization. However, since Gephi is a very heavy software, it kept crashing constantly and that hindered my design process.<\/p>\n\n\n\n

I would further like to explore this software with different forms of data, and networks with higher number of nodes. <\/p>\n\n\n\n

<\/p>\n","protected":false},"excerpt":{"rendered":"

INTRODUCTION One of the initial attempts to map networks in social structures was made by a German primary school teacher Johannes Delitsch. He built a friendship network upon the students of his class from 1880 to 1881. The network delineates reciprocity among students, and considers the influence of class ranking order on their relationships. I…<\/p>\n","protected":false},"author":623,"featured_media":15466,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[342,1],"tags":[],"coauthors":[435],"class_list":["post-15459","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-networks","category-visualization"],"jetpack_featured_media_url":"https:\/\/i0.wp.com\/studentwork.prattsi.org\/infovis\/wp-content\/uploads\/sites\/3\/2019\/07\/2.png?fit=1024%2C1024&ssl=1","jetpack_sharing_enabled":true,"jetpack_shortlink":"https:\/\/wp.me\/paBdcV-41l","_links":{"self":[{"href":"https:\/\/studentwork.prattsi.org\/infovis\/wp-json\/wp\/v2\/posts\/15459","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/studentwork.prattsi.org\/infovis\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/studentwork.prattsi.org\/infovis\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/studentwork.prattsi.org\/infovis\/wp-json\/wp\/v2\/users\/623"}],"replies":[{"embeddable":true,"href":"https:\/\/studentwork.prattsi.org\/infovis\/wp-json\/wp\/v2\/comments?post=15459"}],"version-history":[{"count":9,"href":"https:\/\/studentwork.prattsi.org\/infovis\/wp-json\/wp\/v2\/posts\/15459\/revisions"}],"predecessor-version":[{"id":15476,"href":"https:\/\/studentwork.prattsi.org\/infovis\/wp-json\/wp\/v2\/posts\/15459\/revisions\/15476"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/studentwork.prattsi.org\/infovis\/wp-json\/wp\/v2\/media\/15466"}],"wp:attachment":[{"href":"https:\/\/studentwork.prattsi.org\/infovis\/wp-json\/wp\/v2\/media?parent=15459"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/studentwork.prattsi.org\/infovis\/wp-json\/wp\/v2\/categories?post=15459"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/studentwork.prattsi.org\/infovis\/wp-json\/wp\/v2\/tags?post=15459"},{"taxonomy":"author","embeddable":true,"href":"https:\/\/studentwork.prattsi.org\/infovis\/wp-json\/wp\/v2\/coauthors?post=15459"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}