Back to search

Hosted by Utah State University Libraries

Network Applications and the Utah Homeless Network

Abstract

dc:description.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.

Degree

thesis:*
Name thesis:degree_name
Master of Science (MS)
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Mathematics and Statistics
Grantor dc:publisher
Hosted by Utah State University Libraries

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Snyder, Michael A.
Contributors dc:contributor
  • David E. Brown
  • Jamison Fargo
  • Guifang Fu

Subjects

dc:subject × 4

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
Utah State University
Base URL
digitalcommons.usu.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Snyder, Michael A.. Network Applications and the Utah Homeless Network. Thesis thesis, Hosted by Utah State University Libraries, https://digitalcommons.usu.edu/etd/3877