similar to: Modify the vertex label

Hi, I am plotting a graph with kamada.kawai layout. But I am getting direction arrows in the graphs. Please let me know how to avoid this. g <- watts.strogatz.game(1, 2000, 5, 0.4) comps <- clusters(g)$membership colbar <- rainbow(max(comps)+1) V(g)$color <- colbar[comps+1] png(filename) plot(g, layout=layout.kamada.kawai, vertex.size=2, vertex.label=NA) dev.off() Please find

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

Dear R users, I am trying to draw a network using igraph package. I intend to place the hub nodes (the ones with the relatively more connection with other nodes) in the center of the graph. Also, the graph need to be in the fashion that the higher the correlation between two nodes is , the closer the two nodes will be. Is there any layout that can help or any other way to do this? Thanks in

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.

Dear r-help, Could you help me to find the function which create an empty matrix. I use matrix(), but it gives *a single value that is NA and length of this matrix is 1.* ** *Best Regards* [[alternative HTML version deleted]]

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

Hollo I'm new, My name is Ariel Arelovich I've encountered the following problem trying to sue metaflac. I used the following command: c:\Archivos de programa\FLAC>metaflac --set-tag-from-file="CUESHEET=sola.cue" so la.flac sola.flac: ERROR: file 'sola.cue' for 'CUESHEET' tag value has embedded NULs And I've got that error. See I have the flac that is

Dear R users and developers After upgrading to Windows XP and R 1.9.1 and 2.0, I retried to execute plot.baysian() to a data set that I had used previously to plot with no problem in win2000 R1.8. The error I get is: Error in points(Mbar[-index], lods[-index], pch = ".") : only 0's may mix with negative subscripts Thanx in advance Dino P.S. I allready sent this message

Hi, I am using 'igraph' to make some plots. The problem I got is that I don't know how to label the nodes with gene names. My sample code: ## suppose I have 100 gene (nodes) ## --------------------------------------------------------------------------- graph <- set.vertex.attribute(graph, "color", value=c(rep(c('green','red'),50))) graph <-

Hi, I have a small doubt regarding naive Bayes. I am able to classify the data's properly but i am just stuck up with how to get the probability values for naive bayes. In the case of SVM we have "attr" function that helps in displaying the probability values. Is there any function similar to "attr" in naive Bayes that can be used for displaying the attribute values. my

I have a directed graph which is represented as a matrix on the form 0 4 0 1 6 0 0 0 0 1 0 5 0 0 4 0 Each row correspond to an author (A, B, C, D) and the values says how many times this author have cited the other authors. Hence the first row says that author A have cited author B four times and author D one time. Thus the matrix represents two groups of authors: (A,B) and (C,D) who cites

Hi Thanks for replying my question! What really interested me is that the package providing some complex form sampling, such as wishart, multinomial, dirichlet. And others for example conditional beta distribution confining the random variable in the interval (a, b). Since these concept are widely used in the baysian, I wonder whether somebody has already written this package. Thanks! Best

Hello, Is there any literature there that says that the EM is better/worse than a Baysian model when it comes to differentiating univariate mixture of normal distributions? -- Thanks, Jim. [[alternative HTML version deleted]]

Hello, I am using the plot.igraph function in the igraph package to plot a network. How do I keep vertices from overlapping? One option would be to pass an argument that restricts vertices to occupy the same coordinates given their size. A second option would be to increase the area of the plot (and multiply the distance between vertices with a constant) while keeping the size of vertices the

Hi, I would like to be able to develop a function to plot an igraph object with lattice (trellis type displays will be usefull for grouping etc). Anyway, I mostly feeble Igraph requires that you convert two columns of data two an igraph object and to be able to plot the graph...I have tried a very, very simplistic (if not naive) approach and surprise, surprise, it didn't work. First of all,

I read through the editorial. This is the one of the most mega-ultra-super-biased articles I've ever read. e.g. The authors encourage Baysian methods, and literally encourage subjective approaches. However, there's only one reference to robust methods and one reference to nonparametric methods, both of which are labelled as purely exploratory methods, which I regard as extremely

igraph is a package for graphs and networks. It has a C core and uses a simple and fast graph representation allowing millions of vertices and edges. NEW FEATURES: - We use the ARPACK library for graph related eigenvalue problems, like Page Rank calculation, Kleinberg's hub and authority scores, eigenvector centrality, etc. There is also a generic interface if someone wants to use

igraph is a package for graphs and networks. It has a C core and uses a simple and fast graph representation allowing millions of vertices and edges. NEW FEATURES: - We use the ARPACK library for graph related eigenvalue problems, like Page Rank calculation, Kleinberg's hub and authority scores, eigenvector centrality, etc. There is also a generic interface if someone wants to use

Please refer following Mr. Steven''s mail posted on June 24th. Message-ID: <20080624131313.GB18379@weybridge.uk.xensource.com> Message-ID: <20080624131256.GA18379@weybridge.uk.xensource.com> Signed-off-by: Tomonari Horikoshi <t.horikoshi@jp.fujitsu.com> Signed-off-by: Jun Kamada <kama@jp.fujitsu.com> ----- Jun Kamada