Algorithms

The real benefit of networks comes from the different operations that can be performed on them using the underlying structure.

luv_graph %>% 
  tidygraph::activate(nodes) %>% 
             mutate(centrality = centrality_pagerank()) %>% 
             arrange(desc(centrality))

## # A tbl_graph: 1313 nodes and 1312 edges
## #
## # A rooted tree
## #
## # Node Data: 1,313 × 5 (active)
##    height leaf  label members centrality
##     <dbl> <lgl> <chr>   <int>      <dbl>
##  1      0 TRUE  207         1   0.000763
##  2      0 TRUE  315         1   0.000763
##  3      0 TRUE  208         1   0.000763
##  4      0 TRUE  316         1   0.000763
##  5      0 TRUE  205         1   0.000763
##  6      0 TRUE  313         1   0.000763
##  7      0 TRUE  206         1   0.000763
##  8      0 TRUE  314         1   0.000763
##  9      0 TRUE  245         1   0.000763
## 10      0 TRUE  353         1   0.000763
## # ℹ 1,303 more rows
## #
## # Edge Data: 1,312 × 2
##    from    to
##   <int> <int>
## 1  1187  1079
## 2  1187  1080
## 3   942   797
## # ℹ 1,309 more rows