2019
DOI: 10.1088/1367-2630/ab0065
|View full text |Cite
|
Sign up to set email alerts
|

Comparing complex networks: in defence of the simple

Abstract: To improve our understanding of connected systems, different tools derived from statistics, signal processing, information theory and statistical physics have been developed in the last decade. Here, we will focus on the graph comparison problem. Although different estimates exist to quantify how different two networks are, an appropriate metric has not been proposed. Within this framework we compare the performances of two networks distances (a topological descriptor and a kernel-based approach as representat… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(7 citation statements)
references
References 24 publications
0
7
0
Order By: Relevance
“…the probability of following a particular trajectory from node i to j is almost equal to the probability of going back on the same trajectory from j to i. This can be seen because the random walk fulfills approximately the detailed balance condition (7), since }ΠM ´ΠM T } F {}ΠM } F " 0.03, where Π " diag pπq and } ¨}F denotes the Frobenius norm [29]. This near time-reversibility coincides with the intuition that most journeys in the mobility network are based on commuting travel patterns.…”
Section: Characteristics Of the Baseline Mobility Networkmentioning
confidence: 95%
“…the probability of following a particular trajectory from node i to j is almost equal to the probability of going back on the same trajectory from j to i. This can be seen because the random walk fulfills approximately the detailed balance condition (7), since }ΠM ´ΠM T } F {}ΠM } F " 0.03, where Π " diag pπq and } ¨}F denotes the Frobenius norm [29]. This near time-reversibility coincides with the intuition that most journeys in the mobility network are based on commuting travel patterns.…”
Section: Characteristics Of the Baseline Mobility Networkmentioning
confidence: 95%
“…Connectedness is described by the network degree (also called centrality degree), which defines the number of edges incident on a certain node, that is how many catchments a certain catchment is correlated with. Connectedness length is defined for each existing edge as the Euclidean distance (Martinez & Chavez, 2019) between catchment outlets of flow‐dependent but not necessarily physically connected catchments. We compare overall network degree and connectedness length for different network types by comparing their degree and connectedness length distributions and the medians of these distributions.…”
Section: Methodsmentioning
confidence: 99%
“…how many catchments a certain catchment is connected with. Connectedness length is defined for each existing edge as the Euclidean distance between catchment outlets of flood-dependent but not necessarily physically connected catchments (Martinez and Chavez 2019). We compare the overall network degree and connectedness length for the different flood types by comparing the distributions of degree and connectedness length across catchments for the different flood types.…”
Section: Spatial Dependencementioning
confidence: 99%