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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Graph Fourier Transform Centrality for Taipei Metro System


    Beteiligte:
    Tseng, Chien-Cheng (Autor:in) / Lee, Su-Ling (Autor:in)


    Erscheinungsdatum :

    01.11.2020


    Format / Umfang :

    521546 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch