Title

Authors

Primary Submission Contact

Faculty Sponsor

Karl Schmitt

Faculty Sponsor Email Address

karl.schmitt@valpo.edu

College

Arts and Sciences

Department/Program

Math

Document Type

Poster Presentation

Date

Fall 10-30-2015

Abstract

Network science has become increasingly popular over the last several years as people have realized that networks have the ability to represent the relationships or connections between any objects. While some networks are small and easy to gather information from, others can be very large. It can be very difficult and time consuming to map out these large networks if we collect data from all the nodes in the network. Instead of examining all nodes, we seek to collect data incrementally from a portion of the network at a time to discover the whole network. This discovery occurs by successively placing monitors which can see a local portion of the graph. We then tested all of our algorithms on four different networks. Although there was no one algorithm that did best overall, we were able to see some of the strengths and weaknesses of each on various structures of networks.