2017
DOI: 10.1016/j.procs.2017.05.314
|View full text |Cite
|
Sign up to set email alerts
|

Galois's algebraic structure and bipartite graph spatio-structural analytics for urban public transportation system assessment

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 19 publications
0
1
0
Order By: Relevance
“…The computation of the four centralities relies on the concepts of shortest paths and random walks, respectively, which is believed to correspond with the space discovery modes with different levels of familiarity (Nourian, 2016). All four centralities are common in social network analysis and space syntax, capturing related yet distinct characteristics of the nodes as either street-lines or junctions (Agryzkov et al, 2019; Agryzkov et al, 2019; Boulmakoul et al, 2017; Curado et al, 2020; Nourian, 2016; Nourian et al, 2016; Page et al, 1998; Porta et al, 2006; Taheri et al, 2017; Wasserman and Faust, 1994). The centrality computation yields three groups of vectorswhere σv(γ,G) denotes the centrality index γ (one of the four indices) of node v (either a street-centreline or a street junction) computed in graph bold-italicG (one of the three graphs).…”
Section: Methodsmentioning
confidence: 99%
“…The computation of the four centralities relies on the concepts of shortest paths and random walks, respectively, which is believed to correspond with the space discovery modes with different levels of familiarity (Nourian, 2016). All four centralities are common in social network analysis and space syntax, capturing related yet distinct characteristics of the nodes as either street-lines or junctions (Agryzkov et al, 2019; Agryzkov et al, 2019; Boulmakoul et al, 2017; Curado et al, 2020; Nourian, 2016; Nourian et al, 2016; Page et al, 1998; Porta et al, 2006; Taheri et al, 2017; Wasserman and Faust, 1994). The centrality computation yields three groups of vectorswhere σv(γ,G) denotes the centrality index γ (one of the four indices) of node v (either a street-centreline or a street junction) computed in graph bold-italicG (one of the three graphs).…”
Section: Methodsmentioning
confidence: 99%