similar to: superimposing network graphs

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

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

Hi everyone, I have a dataset of friendship with this format: ego alter 4746 1 2 9742 1 3 14738 1 NA 4747 2 NA 9743 2 3 14739 2 1 4748 3 13 9744 3 5 14740 3 14 4749 4 NA 9745 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

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

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

Hello everone, I am a computer science researcher in the UK - and have a quick question regarding importing data into R and more specifically latentnet. I 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=

Hi R-users, I'm using igraph for an undirected graph. i used clusters() igraph function to know the component size(subgraphs) as shown bellow: 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

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 could not find a clue how to do this in

Hello All, I have been trying to do bonpow for a while now.Bonpow works for few graphs and for 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

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

Hi friends, Is there anyone who happened to import data set in the "DL" format 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

Hi all, I have two networks for the same group of the users. I want to compare individual's degree in different networks. But how 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

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 4 5 6 i.e. all 676529098667 would become

**Hi, I wanted to create 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

Dear R users I'm a novice user of R and have absolutely no prior knowledge of social network analysis, so apologies if 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

Hi, I am an R newbie. I am running R2.5.1 on WinXP. I am trying to run a pacakge (BNArray1.0) that depends on deal 1.2-26 and dynamicGraph 0.2.0.1 . These are available on http://www.cls.zju.edu.cn/binfo/BNArray/#OLE9 . I have installed the 3 packages (using local files). When I try to run BNArray, I reveicd this error message > local({pkg <- select.list(sort(.packages(all.available =

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

Hi, I have a large dataset with info on individuals (B) that have been involved in projects (A) during multiple years (C). The dataset contains three columns: A, B, C. Example: A B C 1 1 a 1999 2 1 b 1999 3 1 c 1999 4 1 d 1999 5 2 c 2001 6 2 d 2001 7 3 a 2004 8 3 c 2004 9 3 d 2004 I am interested in how well all the individuals in a project know each other. To

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 Everyone, I am new to R and just trying my 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