Evidence map›Paper›PMID 39987246›Full record

ArticleScientific reports2025

Quantifying the non-isomorphism of global urban road networks using GNNs and graph kernels.

Linfang Tian, Weixiong Rao, Kai Zhao, Huy T Vo

Abstract read
In one paragraph

Article in Scientific reports, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Linfang TianSchool of Software Engineering, Tongji University, Shanghai, 201804, China. tianlinfang@tongji.edu.cn.
Weixiong RaoSchool of Software Engineering, Tongji University, Shanghai, 201804, China.
Kai ZhaoJ. Mack Robinson College of Business, Georgia State University, Atlanta, 30301, USA.
Huy T VoThe City College of New York, City University of New York and New York University, New York, 10031, USA.

Funding

National Natural Science Foundation of China 61972286
6 · The paper itself

Abstract

A novel concept of quantifying graph non-isomorphism is introduced to measure structural differences between graphs, and thus overcoming the strict limitations of traditional graph isomorphism tests. This paper trains Graph Neural Networks (GNNs) and graph kernels to classify urban road networks and proposes using graph classification accuracy as a metric to quantify graph non-isomorphism. Experimental results demonstrate that Edge Convolutional Neural Network (EdgeCNN) not only leverages node attributes effectively but also fully utilizes edge features, achieving an 85% classification accuracy, which surpasses that of the Weisfeiler-Lehman (WL) kernel algorithm (80%). This finding challenges the claim that "GNNs are at most as powerful as the WL test in distinguishing graph structures." Furthermore, the paper explores the non-isomorphism of 10,361 road networks from 30 cities worldwide, providing valuable insights for future urban development.

Identifiers

PMID39987246
PMCPMC11846977

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC-ND
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.