Net w ork anal y sis in R : A tid y approach N E TW OR K AN ALYSIS - - PowerPoint PPT Presentation

net w ork anal y sis in r a tid y approach
SMART_READER_LITE
LIVE PREVIEW

Net w ork anal y sis in R : A tid y approach N E TW OR K AN ALYSIS - - PowerPoint PPT Presentation

Net w ork anal y sis in R : A tid y approach N E TW OR K AN ALYSIS IN TH E TIDYVE R SE Massimo Franceschet Prof . of Data Science , Uni v ersit y of Udine ( Ital y) NETWORK ANALYSIS IN THE TIDYVERSE NETWORK ANALYSIS IN THE TIDYVERSE NETWORK


slide-1
SLIDE 1

Network analysis in R: A tidy approach

N E TW OR K AN ALYSIS IN TH E TIDYVE R SE

Massimo Franceschet

  • Prof. of Data Science, University of

Udine (Italy)

slide-2
SLIDE 2

NETWORK ANALYSIS IN THE TIDYVERSE

slide-3
SLIDE 3

NETWORK ANALYSIS IN THE TIDYVERSE

slide-4
SLIDE 4

NETWORK ANALYSIS IN THE TIDYVERSE

slide-5
SLIDE 5

NETWORK ANALYSIS IN THE TIDYVERSE

slide-6
SLIDE 6

NETWORK ANALYSIS IN THE TIDYVERSE

slide-7
SLIDE 7

NETWORK ANALYSIS IN THE TIDYVERSE

Building the network

# load packages for network exploration library(readr) library(igraph) # read nodes and ties data into variables nodes <- read_csv("nodes.csv") ties <- read_csv("ties.csv") # build a network from data frames g <- graph_from_data_frame(d = ties, directed = FALSE, vertices = nodes)

slide-8
SLIDE 8

NETWORK ANALYSIS IN THE TIDYVERSE

Exploring the network

# explore the set of nodes and print the number of nodes V(g) vcount(g) # explore the set of ties and print the number of ties E(g) ecount(g) # add the name attribute "Madrid network" to the network and print it g$name <- "Madrid network" g$name # add node attribute id and print the node `id` attribute V(g)$id <- 1:vcount(g) # print the tie `weight` attribute E(g)$weight

slide-9
SLIDE 9

Let's start the investigation!

N E TW OR K AN ALYSIS IN TH E TIDYVE R SE

slide-10
SLIDE 10

Visualizing networks

N E TW OR K AN ALYSIS IN TH E TIDYVE R SE

Massimo Franceschet

  • Prof. of Data Science, University of

Udine (Italy)

slide-11
SLIDE 11

NETWORK ANALYSIS IN THE TIDYVERSE

ggraph()

# load packages for data manipulation and visualization library{igraph) library(dplyr) library(ggplot2) library(ggraph) # visualize the network ggraph(g, layout = "with_kk") + geom_edge_link(aes(alpha = weight)) + geom_node_point()

slide-12
SLIDE 12

NETWORK ANALYSIS IN THE TIDYVERSE

slide-13
SLIDE 13

Let's practice!

N E TW OR K AN ALYSIS IN TH E TIDYVE R SE

slide-14
SLIDE 14

Centrality measures

N E TW OR K AN ALYSIS IN TH E TIDYVE R SE

Massimo Franceschet

  • Prof. of Data Science, University of

Udine (Italy)

slide-15
SLIDE 15

NETWORK ANALYSIS IN THE TIDYVERSE

slide-16
SLIDE 16

NETWORK ANALYSIS IN THE TIDYVERSE

Node centrality

Which are the most important nodes in a network? Important web pages about a certain topic Inuential academic papers covering a given issue Internet routers whose failure would greatly aect network connectivity

slide-17
SLIDE 17

NETWORK ANALYSIS IN THE TIDYVERSE

slide-18
SLIDE 18

NETWORK ANALYSIS IN THE TIDYVERSE

Computing degree

# compute node degrees degree(g) Jamal Zougam Mohamed Bekkali Mohamed Chaoui 29 2 27 Vinay Kholy Suresh Kumar Mohamed Chedadi 10 10 7 Imad Eddin Barakat Abdelaziz Benyaich Abu Abderrahame 22 6 4 Omar Dhegayes Amer Azizi Abu Musad Alsakaoui 2 18 10 Mohamed Atta Ramzi Binalshibh Mohamed Belfatmi 10 10 11 Said Bahaji Galeb Kalaje Abderrahim Zbakh 11 16 15

slide-19
SLIDE 19

NETWORK ANALYSIS IN THE TIDYVERSE

slide-20
SLIDE 20

NETWORK ANALYSIS IN THE TIDYVERSE

Computing strength

# compute node strengths strength(g) Jamal Zougam Mohamed Bekkali Mohamed Chaoui 43 2 34 Vinay Kholy Suresh Kumar Mohamed Chedadi 10 10 7 Imad Eddin Barakat Abdelaziz Benyaich Abu Abderrahame 35 7 4 Omar Dhegayes Amer Azizi Abu Musad Alsakaoui 3 27 10 Mohamed Atta Ramzi Binalshibh Mohamed Belfatmi 12 14 19 Said Bahaji Galeb Kalaje Abderrahim Zbakh 17 21 15

slide-21
SLIDE 21

Let's find the most central terrorists in the network!

N E TW OR K AN ALYSIS IN TH E TIDYVE R SE