similar to: For Social Network Analysis-Graph Analysis - How to convert 2 mode data to 1 mode data?

Hi I am using igraph package in R. My goal is to read a network (in "pajek" format) and decompose the network into components. In addition, I am also interested in sending this output to to a file. I am having problem in while writing to a file! my code looks like this g <- read.graph ("F://test.net", "pajek") compo <- decompose.graph(g,

hi I am struck with a problem in igraph package of R. My problem is as follows I want to plot a power law fit for my data (in .net format --- pajek format) syntax for that in R is g <- read.graph("filename.net", "pajek") d <- degree (g, mode="in") power.law.fit (d+1, 2) it gives me desired out put if my if input a single file but I want to use a variable

I am getting some unexpected results from some functions of igraph and it is possible that I am misinterpreting the vertex numbers. Eg., the max betweenness measure seems to be from a vertex that is not connected to a single other vertex. Below if my code snippet: require(igraph) my.graph <- graph.adjacency(adjmatrix = my.adj.matrix, mode=c("undirected")) most.between.vert <-

Hey, all. I'm looking for packages that are good at two things 1) Drawing directed graphs (i.e nodes and edges), both with single and double headed arrows, as well as allowing for differences in line width and solid versus dashed. Note: I've tried Rgraphviz here, but have run into some problems (which seem fixable and I may go with it in the end), and it doesn't satisfy need

Hello R Help Team, I have created graph from weighted adjecency matrix .Is there a way I can find highly connected nodes in Igraph like the Package RBGL does. nathan -- View this message in context: http://www.nabble.com/Highly-Connected-Nodes-in-Igraph-tp22377522p22377522.html Sent from the R help mailing list archive at Nabble.com.

Hello: I've been trying for days now to get igraph working on a debian sarge install. There does not appear to be any pre-built packages, and when I try and install within R, it blows up on the final linking, claiming its unable to find libgfortran (which IS installed, and IS working for all other users of the compiler). I started up R and ran: install.packages("igraph"). It

Hello I am a relatively new user of R and am struggling to use the 'network' package. I have a correlation matrix (produced using 'cor'), and want to draw a network where each item showing correlation above a threshold (say 0.5) is joined by a green line, and each item showing correlation below a threshold (say -0.5) is joined by a red line. Does anyone have any hints of how to

Hi all, I'm very new to R and read a few tutorials, however I'm having difficulty trying to figure out how to plot a minimum spanning tree. I have a csv file that contains an n-by-n matrix of distances between strains of bacteria called matrix.csv. Looks like: id,strain1, strain2,strain3 strain1,0,.2,.8 strain2,.3,0,.7 strain3,.4,.6,0 I've been messing around with some information

Hi, I have a data set consisting of the x and y coordinate locations of 1600 points. I would like to generate a graph using the functions in igraph. However the graph making functions in igraph requires the data to be in the form of an adjacency matrix. I'd like some advice on how to convert my point pattern to an adjacency matrix or functions out there that would do it directly. I've

Hello R experts, I went through R mailing,Nabble R.I could not find solution.Can someone help me. I have undirected Graph. Here is an example of spreadsheet I have( Unique 3559 Nodes) snippet of 4 rows. Node1 Node2 Weights 1 2 5 2 3 30 2 4 30 1 4 5 3 4 30 1 3 2 I created a program reading the csv and created a Adjacency matrix.From the adjacency matrix I created graph.I am not sure the

Hello all, I'm having a spot of trouble. I have made a very nice distance matrix from some comparison calculations. However, the matrix is 3096 x 3096, so it's relatively large. Currently I'm using the svn package as it seems to work for my data. The graph package errors and says the "adjacency matrix must be symmetric for undirected graphs". I though 3096 x 3096 was

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

I am having trouble plotting one of my graphs (think graph theory graph with edges and vertices, not scatterplots or histograms). For some pairs of vertices, I want multiple edges to be visible in my graph. As an example of this, in my script below, I want two edges to be visible from vertex 1 and vertex 9 (among some others) yet when I plot it, only one edge is visible.

Hi R users, I am using built-in functions in igraph package to draw networks . I need to compare several network with exactly the same structure but with edge hightlighted differently. I am wondering if there is a way to save the layout so that every graph will look the same as each other except for the colors of edges. Or is there any parameter I can set for this purpose?? Thanks in advance,

I have a number of (directed) graphs based on social groups, where the members have expresed likes and dislikes in respect to the other members. tkgraph makes it simple to draw the graphs in a very pleasing way, but I would like to differentiate between positive and negative relations in the graph by having the edges for the negative relations dashed and the positive ones continuous. Is

I'm trying to draw an arrow with a curved shaft on the graph as a straight one looks messy on a detailed graph. I've looked in arrows but it doesn't seem to give an option. larrows doesn't look much more promising. I had a look in the archive and couldn't find anything. Any thoughts? Thanks Paul -- View this message in context:

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 have a erdos-renyi game with 6000 nodes and probability 0.003. g1 = erdos.renyi.game(6000, 0.003) How to create a Watts Strogatz game with the same probability. g1 = watts.strogatz.game(1, 6000, ?, ?) What should be the third and fourth parameter to this argument. -- View this message in context: http://r.789695.n4.nabble.com/Watts-Strogatz-game-tp3491922p3491922.html Sent from the R

igraph is a package for graphs/networks. It has a C core and uses a simple and fast graph representation allowing millions of vertices and edges. LINKS Release notes for the 0.5.2 version: http://igraph.sourceforge.net/relnotes-0.5.2.html Release notes for the 0.5.1 version: http://igraph.sourceforge.net/relnotes-0.5.1.html Complete list of changes: http://igraph.sourceforge.net/news.html The

igraph is a package for graphs/networks. It has a C core and uses a simple and fast graph representation allowing millions of vertices and edges. LINKS Release notes for the 0.5.2 version: http://igraph.sourceforge.net/relnotes-0.5.2.html Release notes for the 0.5.1 version: http://igraph.sourceforge.net/relnotes-0.5.1.html Complete list of changes: http://igraph.sourceforge.net/news.html The