Dynamics in large scale networks

In 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.

Name thesis:degree_name

M.Sc. Mathematics and Statistics

Level thesis:degree_level

Masters

Discipline thesis:degree_discipline

Faculty of Mathematics and Science

Department dc:contributor.department

Department of Mathematics

Grantor

Brock University

Year dc:date.issued

2016

Author dc:creator

• Clements, John

• large social network analysis
• dynamic network analysis
• graph motif
• vertex/node removal networks
• Motifs in the Barabási–Albert Algorithm

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/10464/9238

OAI identifier oai:identifier

oai:brocku.scholaris.ca:10464/9238