Show simple item record

dc.contributor.authorClements, John
dc.date.accessioned2016-04-21T12:18:52Z
dc.date.available2016-04-21T12:18:52Z
dc.identifier.urihttp://hdl.handle.net/10464/9238
dc.description.abstractIn this thesis we study the properties of two large dynamic networks, the competition network of advertisers on the Google and Bing search engines and the dynamic network of friend relationships among avatars in the massively multiplayer online game (MMOG) Planetside 2. We are particularly interested in removal patterns in these networks. Our main finding is that in both of these networks the nodes which are most commonly removed are minor near isolated nodes. We also investigate the process of merging of two large networks using data captured during the merger of servers of Planetside 2. We found that the original network structures do not really merge but rather they get gradually replaced by newcomers not associated with the original structures. In the final part of the thesis we investigate the concept of motifs in the Barabási-Albert random graph. We establish some bounds on the number of motifs in this graph.en_US
dc.language.isoengen_US
dc.publisherBrock Universityen_US
dc.subjectlarge social network analysisen_US
dc.subjectdynamic network analysisen_US
dc.subjectgraph motifen_US
dc.subjectvertex/node removal networksen_US
dc.subjectMotifs in the Barabási–Albert Algorithmen_US
dc.titleDynamics in large scale networksen_US
dc.typeElectronic Thesis or Dissertationen
dc.degree.nameM.Sc. Mathematics and Statisticsen_US
dc.degree.levelMastersen_US
dc.contributor.departmentDepartment of Mathematicsen_US
dc.degree.disciplineFaculty of Mathematics and Scienceen_US
refterms.dateFOA2021-07-31T01:50:56Z


Files in this item

Thumbnail
Name:
Brock_clements_John_2016.pdf
Size:
34.60Mb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record