similar to: Latentnet Data Import

Unbuntu 10.04 R 2.10 I am trying to install Rcmdr and receive the following messages: The downloaded packages are in ?/tmp/RtmpzhjDZG/downloaded_packages? Warning messages: 1: In install.packages("Rcmdr", dependencies = TRUE) : installation of package 'Rmpi' had non-zero exit status 2: In install.packages("Rcmdr", dependencies = TRUE) : installation of package

Dear List I just downloaded and installed R 2.12.0 and then installed R Commander . First it got RCmdr and Car, and then suggested for other packages for utilizing the full functionality- I clicked yes! I got 140 packages installed!!! Cran Mirror was UCLA... Here is the list. Is this intentional- I can see some packages like snow and multicore which are desirable but quite optional.(see list

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 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 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

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

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

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

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

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

On 08/05/2010 01:45 AM, David Greene wrote: > Do pushes to the LLVM git mirror get forwarded to the svn trunk > automatically? For various reasons it may be more convenient > for me to work on LLVM through git but I don't want to go through > a lot of pain to send patches to trunk via git. It should be > easy. > > Does anyone do their primary development via the git

Hello everone, In my Company we are going through a network redesign and Planning to retire our Novel edirectory, and Novel Servers and replace them with Samba4 (Over 150 Servers). We have setup a Samba4 test environment which seems to be working well so far. We are an organization with multiple locations and over 1200 users, we are also very heavy users of google apps. I have couple of questions

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]]

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

Hi all First I want to wish for everone a happy new year... Well... I have run asterisk 1.4.16.1 in a server. I have this IVR, in extensions.conf: [ura] ;exten => s, 1, Wait,1 exten => s, 1, Answer() exten => s, n, Noop() exten => s, n(debug),DumpChan() exten => s, n, Set(LANGUAGE()=pt_BR) exten => s, n, Set(CALLFILENAME=/var/spool/asterisk/monitor/entrada/) exten => s,

If user1 creates a file on the share, why with this configuration can user2 delete that file created by user1? Thanks, Michael [global] idmap gid = 16777216-33554431 idmap uid = 16777216-33554431 path = /var/www/ unix password sync = yes workgroup = cmny os level = 20 auto services = advertising editorial null passwords = yes encrypt passwords = yes winbind use default domain = no

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

On 5 August 2010 02:14, Tobias Grosser <grosser at fim.uni-passau.de> wrote: > On 08/05/2010 01:45 AM, David Greene wrote: > > Do pushes to the LLVM git mirror get forwarded to the svn trunk > > automatically? For various reasons it may be more convenient > > for me to work on LLVM through git but I don't want to go through > > a lot of pain to send patches

Hello everone,            Anyone who knows how to force a cubic smoothing spline to pass through a particular point?            I found on website  someone said that we can use "cobs package" to force the spline pass through certain points or impose shape           constraints (increasing, decreasing). However,  this package is using  B-spline and can only do linear and quadratic