Main content

A Novel Representation for Graph Evolution

Show full item record

Title: A Novel Representation for Graph Evolution
Author: Timmins, Meghan
Department: Department of Mathematics and Statistics
Program: Mathematics and Statistics
Advisor: Ashlock, Daniel
Abstract: Networks and combinatorial graphs are commonly used in a wide variety of types of mathematical modelling to represent structures such as contact networks in epidemiology, road networks in urban planning, and scheduling conflicts. Introduction to the topic of graphs comes through a brief look at the community assembly problem. A new method for community using evolutionary computation is established and compared to a pre-existing method. We then examine the novel problem of graph evolution and develop a new graph representation, one that expands previously effective representations. The expansion includes the addition of two new operators to yield the THADSN representation which allows for both local and global adjustment of connectivity. We examine three benchmark functions on which to test the THADSN representation. The test problems are used to compare the new representation with the previously used TADS representation.
URI: http://hdl.handle.net/10214/9898
Date: 2016-08
Terms of Use: All items in the Atrium are protected by copyright with all rights reserved unless otherwise indicated.


Files in this item

Files Size Format View
Timmins_Meghan_201608_Msc.pdf 3.472Mb PDF View/Open

This item appears in the following Collection(s)

Show full item record