Abstract by Jason Kinghorn
Centrality and Network Similarity
A network is a group of objects with some connection between them. Our research focuses on how to tell if two given networks are similar in nature. We do this through comparing values of the centralities of the nodes and the distribution of the centrality values. Centrality is one metric used to determine node importance. We also have experimented with a node and edge similarity algorithm between two graphs to determine if two networks are similar means that this algorithm will result in nodes and edges being similar also. Knowing if two networks similar could be important in many different uses such as being able to detect a dangerous network while it is growing and in early stages.