Date of Award:
5-2014
Document Type:
Thesis
Degree Name:
Master of Science (MS)
Department:
Mathematics and Statistics
Committee Chair(s)
David E. Brown
Committee
David E. Brown
Committee
Jamison Fargo
Committee
Guifang Fu
Abstract
Graph theory is the foundation on which social network analysis (SNA) is built. With the flood of "big data," graph theoretical concepts and their linear algebraic counterparts are essential tools for analysis in the burgeoning field of network data analysis, in which SNA is a subset. Here we begin with an overview of SNA. We then discuss the common descriptive measures taken on network data as well as proposing new measures specific to homeless networks. We also define a new data structure which we call the location sequence matrix. This data structure makes certain computational network analyses particularly easy. Finally we apply Pulse Processes in a new way to the homeless network in Utah. We believe the new data structure and pulse processes, when used for analysis of the Utah homeless services. In particular, pulse processes, first introduced by Brown, Roberts, and Spencer, to analyze energy demand, form a dynamic population model that can provide a measure of the stability in a network and the patterns of action of individuals experiencing homelessness.
Checksum
9b268d2a4bd09b9c45bafeca174262c8
Recommended Citation
Snyder, Michael A., "Network Applications and the Utah Homeless Network" (2014). All Graduate Theses and Dissertations, Spring 1920 to Summer 2023. 3877.
https://digitalcommons.usu.edu/etd/3877
Included in
Copyright for this work is retained by the student. If you have any questions regarding the inclusion of this work in the Digital Commons, please email us at .