• Login
    View Item 
    •   Home
    • Theses & Dissertations
    • 2018 - Mines Theses & Dissertations
    • View Item
    •   Home
    • Theses & Dissertations
    • 2018 - Mines Theses & Dissertations
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of Mines RepositoryCommunitiesPublication DateAuthorsTitlesSubjectsThis CollectionPublication DateAuthorsTitlesSubjects

    My Account

    Login

    Mines Links

    Arthur Lakes LibraryColorado School of Mines

    Statistics

    Display Statistics

    Improved methods to compare distance metrics using uniform random spanning trees and their applications in network analysis

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    Bourbour_mines_0052E_11431.pdf
    Size:
    4.462Mb
    Format:
    PDF
    Download
    Author
    Bourbour, Sara
    Advisor
    Mehta, Dinesh P.
    Date issued
    2018
    Keywords
    distance matrices
    road networks performance
    network analytics
    correlation coefficient
    
    Metadata
    Show full item record
    URI
    https://hdl.handle.net/11124/172140
    Abstract
    This dissertation considers the network analytics problem of comparing two distance metrics on the same set of $n$ entities. The classical solution proposed in 1967 is the Mantel test: a permutation-based hypothesis test whose complexity of $\Theta(n^2)$ per permutation makes it intractable for even medium-sized data sets. Our first contribution is the development of a faster ($\Theta(n)$ per permutation) permutation test based on uniform random spanning trees called DIMECOST\textsubscript{P}. In addition, we present DIMECOST\textsubscript{CC} a method that once again uses uniform random spanning trees to compute correlation coefficients that quantify the strength of the linear relationships between distance metrics. The spanning tree based method eliminates dependencies in the data resulting from the triangle inequality making the correlation coefficient a more robust metric. We next develop mathematical formulas for special cases of transportation networks (line, circle and mesh graphs) based on the DIMECOST\textsubscript{CC} methodology. These are used to analyze trends in graph size and topology and location and amount of congestion in the network changes. Finally, we apply DIMECOST\textsubscript{CC} to assess fairness in the Denver area transportation network. Along with average speed to evaluate network effectiveness, we show that this approach can be used by transportation planners and policymakers to perform a quick screening of potential future projects in order to recommend a short list of projects for subsequent, extensive evaluations.
    Rights
    Copyright of the original work is retained by the author.
    Collections
    2018 - Mines Theses & Dissertations

    entitlement

     
    DSpace software (copyright © 2002 - 2023)  DuraSpace
    Quick Guide | Contact Us
    Open Repository is a service operated by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.