Network analysis with the aid of the path length matrix (Q6145580)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Network analysis with the aid of the path length matrix |
scientific article; zbMATH DE number 7785654
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Network analysis with the aid of the path length matrix |
scientific article; zbMATH DE number 7785654 |
Statements
Network analysis with the aid of the path length matrix (English)
0 references
9 January 2024
0 references
Even though the usual approach to investigate the properties of a graph representing a network is to exploit its adjacency matrix, here the authors address the study of properties of the graph using its path length matrix. It is shown that several known measures of communication (i.e. closeness centrality, harmonic centrality, eccentricity) are related to the path length matrix. Moreover, new measures of communication are introduced. Applications of the presented approach include city planning and information transmission. Several MATLAB codes are presented which implement useful functions. Some numerical examples are reported and discussed in details to enlighten the features of the presented approach
0 references
network analysis
0 references
path length matrix
0 references
harmonic centrality
0 references
global efficiency
0 references
0.7580050826072693
0 references
0.7391115427017212
0 references
0.7311972379684448
0 references
0.7289270162582397
0 references
0.7186868786811829
0 references
