{"id":{"repo_id":"calpoly","oai_identifier":"oai:digitalcommons.calpoly.edu:theses-5042"},"canonical_url":"https://search.ndltd.org/etd/calpoly/oai:digitalcommons.calpoly.edu:theses-5042","repository":{"repo_id":"calpoly","name":"Cal Poly","base_url":"https://digitalcommons.calpoly.edu/do/oai/"},"display":{"title":"An Evaluation of Road Network Structure as a Predictor of Traffic Volume","abstract":"This thesis evaluates the relationships between various graph theory metrics and taxi traffic volume for the cities of San Francisco, California and Porto, Portugal. We also evaluate a modified betweenness centrality metric which incorporates the count of distinct origin-destination pairs from the taxi data as the weight function. This thesis extends a paper by Pengyao Ye, Bo Wu, and Wenbo Fan by reducing circularity through a temporal train-test split and by comparing both line-graph and primal-graph formulations of betweenness centrality. We found that past traffic volume is almost perfectly correlated with future traffic volume and that the modified betweenness centrality substantially outperforms purely structural metrics. We also found that weighted primal-graph formulations of betweenness centrality consistently outperform the line-graph formulation used in the original paper and, in the San Francisco case study, outperform raw origin-destination counts. These results suggest traffic patterns are highly temporally consistent, that degree centrality, closeness centrality, and pure betweenness centrality poorly correlate with traffic volume, and that preserving street-length information in the primal graph may improve the predictive power of modified betweenness centrality.","abstract_html":"This thesis evaluates the relationships between various graph theory metrics and taxi traffic volume for the cities of San Francisco, California and Porto, Portugal. We also evaluate a modified betweenness centrality metric which incorporates the count of distinct origin-destination pairs from the taxi data as the weight function. This thesis extends a paper by Pengyao Ye, Bo Wu, and Wenbo Fan by reducing circularity through a temporal train-test split and by comparing both line-graph and primal-graph formulations of betweenness centrality. We found that past traffic volume is almost perfectly correlated with future traffic volume and that the modified betweenness centrality substantially outperforms purely structural metrics. We also found that weighted primal-graph formulations of betweenness centrality consistently outperform the line-graph formulation used in the original paper and, in the San Francisco case study, outperform raw origin-destination counts. These results suggest traffic patterns are highly temporally consistent, that degree centrality, closeness centrality, and pure betweenness centrality poorly correlate with traffic volume, and that preserving street-length information in the primal graph may improve the predictive power of modified betweenness centrality.","abstract_has_math":false,"creators":["McDonald, Colin M"],"institution":null,"degree_name":"MS in Computer Science","degree_level":null,"degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Theresa Migler","Computer Science","College of Engineering"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T07:12:58Z","subjects":["Network science","graph theory","street networks","centrality","betweenness centrality","Theory and Algorithms"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.calpoly.edu/theses/3352","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://digitalcommons.calpoly.edu/theses/3352","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://digitalcommons.calpoly.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.calpoly.edu%3Atheses-5042","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Theresa Migler","Computer Science","College of Engineering"]},{"key":"dc:creator","label":"Author","values":["McDonald, Colin M"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2026-06-12T07:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2026-06-01T07:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_name","label":"Degree Name","values":["MS in Computer Science"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Network science","graph theory","street networks","centrality","betweenness centrality","Theory and Algorithms"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.calpoly.edu/theses/3352"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["This thesis evaluates the relationships between various graph theory metrics and taxi traffic volume for the cities of San Francisco, California and Porto, Portugal. We also evaluate a modified betweenness centrality metric which incorporates the count of distinct origin-destination pairs from the taxi data as the weight function. This thesis extends a paper by Pengyao Ye, Bo Wu, and Wenbo Fan by reducing circularity through a temporal train-test split and by comparing both line-graph and primal-graph formulations of betweenness centrality. We found that past traffic volume is almost perfectly correlated with future traffic volume and that the modified betweenness centrality substantially outperforms purely structural metrics. We also found that weighted primal-graph formulations of betweenness centrality consistently outperform the line-graph formulation used in the original paper and, in the San Francisco case study, outperform raw origin-destination counts. These results suggest traffic patterns are highly temporally consistent, that degree centrality, closeness centrality, and pure betweenness centrality poorly correlate with traffic volume, and that preserving street-length information in the primal graph may improve the predictive power of modified betweenness centrality."]},{"key":"dc:title","label":"Title","values":["An Evaluation of Road Network Structure as a Predictor of Traffic Volume"]}]}],"canonical_facts":{"dc:contributor":["Theresa Migler","Computer Science","College of Engineering"],"dc:creator":["McDonald, Colin M"],"dc:date.available":["2026-06-12T07:00:00Z"],"dc:date.created":["2026-06-01T07:00:00Z"],"dc:description.abstract":["This thesis evaluates the relationships between various graph theory metrics and taxi traffic volume for the cities of San Francisco, California and Porto, Portugal. We also evaluate a modified betweenness centrality metric which incorporates the count of distinct origin-destination pairs from the taxi data as the weight function. This thesis extends a paper by Pengyao Ye, Bo Wu, and Wenbo Fan by reducing circularity through a temporal train-test split and by comparing both line-graph and primal-graph formulations of betweenness centrality. We found that past traffic volume is almost perfectly correlated with future traffic volume and that the modified betweenness centrality substantially outperforms purely structural metrics. We also found that weighted primal-graph formulations of betweenness centrality consistently outperform the line-graph formulation used in the original paper and, in the San Francisco case study, outperform raw origin-destination counts. These results suggest traffic patterns are highly temporally consistent, that degree centrality, closeness centrality, and pure betweenness centrality poorly correlate with traffic volume, and that preserving street-length information in the primal graph may improve the predictive power of modified betweenness centrality."],"dc:identifier":["https://digitalcommons.calpoly.edu/theses/3352"],"dc:subject":["Network science","graph theory","street networks","centrality","betweenness centrality","Theory and Algorithms"],"dc:title":["An Evaluation of Road Network Structure as a Predictor of Traffic Volume"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_name":["MS in Computer Science"]},"updated_at":"2026-11-19T07:12:58Z"}