Social network analysis (SNA) is the methodical analysis of social networks. Social network analysis views social relationships in terms of network theory, consisting of nodes (representing individual actors within the network) and ties (which represent relationships between the individuals, such as friendship, kinship, organizational position, sexual relationships, etc.)
Questions tagged [sna]
296 questions
1
vote
1 answer
different community detection algorithms - very different results
I am doing a community-level network analysis and I am trying to detect communities in my network. I used three different algorithms
(1) Community detection based on edge betweenness (Newman-Girvan) - Detected: 50 communities, modularity 0.1
ceb <-…
1
vote
1 answer
plotting the most represented node in my igraph object in R
I have the fblog data set that is about french political party blogs.and is an object of igraph
I just want to plot the most represented party(node) in my the set
I used degree as below,
but now I dont know how to use it to plot it
I want just to…
eli
- 184
- 2
- 12
1
vote
1 answer
Converting edgelist (occurance) to incidence matrix for social network
I'm new to R/network analysis, and apologize if this is a stupid question. I'm currently trying to convert an edgelist into a network matrix, where the shared category of a group indicates the presence of an edge. (ie. 1 if they are in the same…
A Lee
- 13
- 4
1
vote
0 answers
How to check whether my network is scale free or not in R(igraph)
I made two-mode network to analyze if it's scale free or not.
I used igraph package in R. I made two-mode to one-mode network by cross-product. And I made igraph for each period data. It is an undirected network. I know how to make scale-free…
quovadisss
- 21
- 3
1
vote
0 answers
Network graph looks different in PNG and PDF using ggplot
I have a weighted undirect graph as an igraph object :
IGRAPH 7d6665b UNW- 168 2345 --
+ attr: name (v/c), label (v/c), degree_alpha (v/n)
+ edges from 7d6665b (vertex names):
[1] 7 --13 7 --15 13--15 11--16 15--17 6 --18 15--20 6 --25 18--25 6…
mhr
- 147
- 1
- 10
1
vote
1 answer
How can I mark all triads of a specific type (e.g. 030T) in a graph?
I have a dataframe df with:
Source, Target
aaaa, bbbb
aaaa, cccc
aaaa, dddd
bbbb, cccc
cccc, dddd
and so on.
File "total_edges.csv" (71kb): https://uni-duisburg-essen.sciebo.de/s/WLDD4ytkjekVcIL
I get a graph object and, according to the github…
Vega
- 2,661
- 5
- 24
- 49
1
vote
0 answers
Error in calculate_centralities(net, include = "Information Centrality") : The input is not an igraph object or may not be connected
I am trying to get Information centrality by using package CINNA.
library(CINNA)
my.data <- data.frame(fun$screen_name, fun$retweet_name)
net <- graph.data.frame(my.data, directed = T)
calculate_centralities(net, include = "Information…
muhammad ali baig
- 119
- 6
1
vote
1 answer
How to calculate a triad census for an undirected, weighted graph
I would like to calculate a triad census of an undirected, weighted edgelist in R (using sna, igraph and statnet packages). gdrkz is an object of class igraph.
When using the following command:
triad.census(gdrkz, g=NULL, mode = c("graph"))
I get…
morph
- 21
- 2
1
vote
1 answer
igraph: adding vertices = X creating clusters of size = 1
I am currently working through some graph theory problems and have a question I can't seem to find an answer to. When creating a graph using:
x <- graph_from_data_frame(el, directed = F, vertices = x)
The addition of the vertices = x creates…
williamg15
- 77
- 7
1
vote
1 answer
Selecting clusters based on number of nodes iGraph/R
Is there a way to select a subgraph/subset where clusters have maximum number of vertices?
Essentially I want to do something like:
want <- components(X)$csize < 20
I thought about merging the cluster id's from the graph data frame to the node…
williamg15
- 77
- 7
1
vote
1 answer
Social Network Analysis and Component size - igraph R SNA
I have a social network of approximately 1,400 cases and partners. I am using igraph to create the network and also extract some metrics (density, average degree, betweenness etc)
I want to analyze the data by component size (create categories for…
A_P
- 13
- 2
1
vote
1 answer
Different results from betweenness score weighted graph vs multigraph
I am playing around with StatsBomb FIFA World Cup 18 data and am trying to figure out the central players in each team. I do this by constructing a network of passes (directed graph with player making a pass and player receiving the pass). Then I…
Kellopeli
- 21
- 3
1
vote
1 answer
using igraph to plot asymmetric ties
HAVE is a two-mode adjacency matrix of lead actors (ids in the 1st column) and supporting actors (ids in the column names).
f1 f2 f3 f4 f5 f6 f7
f1 0 1 0 2 5 0 6
f2 0 0 3 0 0 6 0
f3 9 4 0 1 0 0 …
J.Q
- 971
- 1
- 14
- 29
1
vote
1 answer
converting edgelist to two-mode network matrix
HAVE is an edge-list for an odd two mode network. People in actor are major award-winning actors; people in supporter are other actors who performed in one or more films as a supporting role. Note: actor includes some members of supporter but not…
J.Q
- 971
- 1
- 14
- 29
1
vote
3 answers
Sum of weights following vertices attributes
In R, I have a weighted undirected graph as an igraph object :
IGRAPH 60a5b9d UNW- 2777 19103 --
+ attr: name (v/c), label (v/c), nom (v/c), sigle (v/c), statut (v/c), champ (v/c), cp (v/c), info (v/c),
+ edges from 60a5b9d (vertex names):
[1]…
mhr
- 147
- 1
- 10