Recognizing Critical Stations in Urban Rail Transit Networks Based on the PCA‐TPE Method: Shanghai Metro as an Example
Bibliographic record
Abstract
The identification of core stations in urban rail transit (URT) networks remains a vital issue in network structure organization analysis and an integral part of network reliability evaluation. However, the identification of critical stations with a single centrality metric has limitations and the varying interactions between stations cannot be ignored. In this paper, a novel integrated approach is proposed by using the principal component analysis and topological potential considering entropy (PCA‐TPE) method. Taking the Shanghai metro (SHM) network as a case study, a Space L network model is constructed and the network topology characteristics are analyzed. Moreover, the susceptible‐infected (SI) model and the network failure simulation are employed to demonstrate the effectiveness of the proposed method. The results show that the SHM network exhibits characteristics of both small‐world networks and scale‐free networks. According to the experiments of the SI model, the nodes obtained by the PCA‐TPE method have stronger spreading influence than those derived by other methods, especially in the initial stage. The failure simulations illustrate that attacks against the nodes detected by the PCA‐TPE method will lead to devastating network failures. Hence, the proposed method is effective for identifying critical nodes in URT networks, and the findings of the research can provide theoretical evidence for the development planning and emergency management of the public traffic system.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".