search for: edgelist

Hi, I have network data in the form of a couple of edgelists containing weights in the format "x,y,weight" whereby x represents row header and y represents column header. All edgelists are based on links among 634 nodes and I need to convert them into a 634*634 weighted matrix. I searched for online help using possible keywords I know, but I...

Hello All, I have had considerable bad luck with attempting the following with for loops. Here is the problem: # Suppose we have a data.frame with the following data, which can be considered a type of edgelist (for those with networks backgrounds): # # V1 V2 # 1 A # 1 A # 1 B # 2 A # 3 C # 3 A # 3 C # 3 B # # I want the output of the function to produce a matrix, such that #each factor of V1 is a row, and each corresponding value at position k of V2 is the i,j^th element of the new matrix, with mis...

I'm interested in computing densities of a number of small ego-centred or local networks. I've installed both the R program and the sna package. My next task is importing the data into R. Our data was entered into Spss in an edgelist format in which each case specifies the link between an alter and an ego. For example: 10101 10102 1 10101 10103 3 10102 10104 2 10201 10203 4 10203 10204 2 The following data fragment for example shows an ego-centred network of 2 persons: 101 and 102. Person 101 for example rep...

Hi I am using R with igraph to analyze an edgelist that is greater than the said amount. Does anyone know a way around this? Thanks Inder

...5 4 NA 14741 4 NA 4750 5 NA 9746 5 13 14742 5 10 4751 6 12 9747 6 7 ... NA means that individuals don't select any friend. Does anyone know how to format this dataset to use sna or igraph packages? I don't know how to convert it into a matrix or a edgelist in R without losing isolated individuals . Next question, anyone knows if there is a package to perform a Moody's Crowds routine to identify groups using R, or other algorithms designed to search groups by maximizing modularity scores? Thank you in advance! -- Sebasti?n Daza sebastian....

...am trying to import data such as a text file containing: (This is based on the Sampson data set) ----------- Network attributes: vertices = 3 directed = TRUE hyper = FALSE loops = FALSE multiple = FALSE total edges= 3 Vertex attribute names: group vertex.names edgelist matrix: [,1] [,2] [1,] 3 1 [2,] 2 1 [3, ] 3 2 ------------ What command should I use to import this data? I have attempted many such as "read.delim" and "read.table" - but either an error message is returned, or the strings in the data (such as edge...

Dear all, I have a undirected network (g), representing all the sexual relationships that ever existed in a model community. I also have a directed edgelist (e) which is a subset of the edgelist of g. e represents the transmission pathway of HIV. Now I would like to superimpose the picture of the sexual relationships with arrows in a different colour, to indicate where in the network HIV was transmitted. Any ideas on how to do this? Many thanks, Wim...

1 down vote favorite my problem is the following: I am using the R SNA package for social network analysis. Lets say, my starting point is an edgelist with the following characteristics. Every row contains a firm name, the ID of a project they are involved and further characteristics, let's say the projects year. Firms can be in several projects, and one project can consist of a cooperation of more than one firm. Example: Name Project Ye...

Dear colleagues, I'm trying to have a look at the Assortative and Disassortative ( http://en.wikipedia.org/wiki/Assortative_mixing) of the network I have. But it seems that the igraph hasn't mentioned that yet. I have to get the in/out degree of the vertices of each edge and calculate the Pearson's Correlation coefficient which seems to be quite a huge task for me. :( So I wonder if

Hi, So I've been figuring out how to use igraph in R and like it for it's speed and simplicity. Now I have a graph built from an edgelist where vectors have a $name attribute. I have another dataframe with attributes tied to a vector ID, which is the same as the $name attribute of vectors represented in the graph. How can I iterate over the graph by V(g)$name and do set.vector.attributes for the other attributes in the vector dat...

...low: c <-clusters(g)    # component sizes size <- sort(c$csize, decreasing=TRUE) cat("Top 20 cluster of the graph","\n") for (i in 1:20) {   cat(i,"  size:",size[i] ,"\n") } Can anyone help how to extract the subgraph components  based on the size as  edgelist-format. Thanks in advance [[alternative HTML version deleted]]

...few others it goes out of memory. I did see reply to one of the posting Alph Centrality Crashed in Igraph memory error. The solution in the posting was to use sparse matrix. This is the link of the message. http://lists.gnu.org/archive/html/igraph-help/2008-04/msg00071.html I was able to obtain edgelist for the graph and I do not know how to convert that to sparse matrix and obtain bonpow. Can someone help me. This is what I tried Summary(g) Vertices: 8047 Edges: 99060 Directed: FALSE No graph attributes. Vertex attributes: name. No edge attributes. I use get.adjacency( graph,Sparse=TR UE) to...

...y hand at plotting a network from my dataset. I am trying to teach myself network analysis, so this is probably an easy question. Using the package network, I have successfully plotted my network. I simply want to add labels to my vertices, with the label corresponding to the data I fed into the edgelist. For simplicity sake, my edgelist looks like 1 4 3 4 I want to plot the labels, 1, 3, 4, and so on. Here is my code. library(network) path <- path myedges <- read.table(path) net <- network(myedges) plot(net) Any help will be greatly appreciated. I am not looking to do advanced an...

...t into R for further analysis? In the package of "network", there's only a method named "read.paj()". So now, I have to get the dl file from the original data set, and use UCINET to convert it to .net file. It's too complicated. :( In the package of "igraph", edgelist is one the format which can be imported, however, weight can not be expressed. As for the format "ncol", weight is considered, but it's always undirected. Thank you for comments and suggestions! Best! Weijia [[alternative HTML version deleted]]

...ow could I get the degrere of the nodes according to its name? When I use degree(g1), I could only get a vector of the degree of each node. But when I turn to g2, I don't know whose degree it is so I can't match it with the degree(g2). Now I'm trying to make the users appearing in the edgelist in the same sequence. for example: in g1 input file A B 1 C D 2 C B 3 in g2 input file A B 0 C D 12 C B 0 If I make the two input file like this, will it help? I mean the degree vector will be exactly the same in the two graph? Thanks! [[a...

Dear All, Some of the functions in Linkcomm return an error: unused argument(s) (v = V(x$igraph)) Although I follow the guidance in the manual a number of the functions return this error. The igraph vector is an edgelist. Many thanks for any guidance. Best, Nick

I have a text file full of numbers (it's a edgelist for a graph) and I would like to recode the numbers as they are way too big to work with. So for instance the following: 676529098667 1000198767829 676529098667 100867672856227 676529098667 91098726278 676529098667 98928373 1092837363526 716172829 would become: 0 1 0 2 0 3 0...

...my question is trivial. I've spent alot of time trying to solve this on my own but I really can't so hope someone here can help me out. Cheers! The dataset: I'm trying to predict the existance of links (True or False) in a test set using a training set. Both data sets are in an "edgelist" format, where User IDs represents nodes in both columns with the 1st column directing to the 2nd column (see figure 1 below). Using the AUC to evaluate the performance, I am looking for the best algorithm to predict the existance of links in the test data (50% are true and rest are false)....

Dear all, I have some network data - about 300 vertices and several thousand edges. I am looking for a way to turn multiple edges into weights of the edges. I looked around and - surprisingly? - haven't found anything. Is there an easy way to do this? Best, Jonas [[alternative HTML version deleted]]

...a network of drugs that are being studied together. So, I created a file as a graph. But plot of my network is not corect! It looks like to me that something else is lying behind this network links created. Could someone help me with this? Thanx! a<-read.graph(file=file.choose(), format="edgelist") plot.igraph(a) File (number present ID of drug): 15 2 10 4 10 4 10 4 13 4 13 4 15 4 18 4 11 5 2 6 7 6 7 6 7 6 12 6 15 6 15 6 19 6 22 6 24 6 6 7 5 12 5 12 7 12 11 12 13 12 13 12 13 12 13 12 16 12 17 12 23 12 23 12 23 12 23 12 6 13 12 13 6 14 6 15 9 15 12 15 13 15 17 16 16 17 1 18 12 18 23 1...