In this paper, the graph Fourier transform (GFT) centrality is used as node importance measure to identify central stations of the Taipei metro system. First, the computation algorithm of the GFT centrality is presented. Then, GFT centrality is employed to analyze Taipei metro system and determine which stations are more central. This information is useful to analyze the vulnerability of the metro system that considers the recovering ability after system suffers a disaster. Finally, the comparisons among degree centrality, closeness centrality, betweenness centrality, and eigenvector centrality are made to show their differences and characteristics.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Graph Fourier Transform Centrality for Taipei Metro System


    Contributors:


    Publication date :

    2020-11-01


    Size :

    521546 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English