similar to: igraph plot - vertex colors

Displaying 20 results from an estimated 1000 matches similar to: "igraph plot - vertex colors"

2008 Mar 05
4
vertex labels in igraph from adjacency matrix
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 <-
2009 Nov 27
6
Learning R - View datasets
Hi All, I am making a serious effort to try to learn R, but one hurdle I am facing is that I need to "see" the data as I walk through the examples in the packages. For instance, many examples on the web start by a command like data("wines"). How can I actually view what the dataset looks like prior to transformations and analysis? I have tried to use edit() , print, and
2006 Mar 01
2
Weighted networks and multigraphs
I would like to apply network measures (such as betweenness centrality, upper boundedness, etc.) to a weighted graph with non-integer weights, defined by a euclidean distance matrix. The package sna provides the measures that I want to use, but seems only to operate on binary graphs. I have read work by Mark Newman (http://aps.arxiv.org/abs/cond-mat/0407503/), who suggests that a weighted graph
2008 Feb 20
0
igraph package, version 0.5
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
2008 Feb 20
0
igraph package, version 0.5
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
2012 Jun 18
0
igraph 0.6 released
Dear All, we have released version 0.6 of the igraph package today. This is a major new version, with a lot of new features, and (sadly) it is not completely compatible with code that was written for the previous igraph versions. (See "Major new features" below for details.) I have included below a list of (bigger) changes. Please see the details in the release notes and the NEWS
2012 Jun 18
0
igraph 0.6 released
Dear All, we have released version 0.6 of the igraph package today. This is a major new version, with a lot of new features, and (sadly) it is not completely compatible with code that was written for the previous igraph versions. (See "Major new features" below for details.) I have included below a list of (bigger) changes. Please see the details in the release notes and the NEWS
2010 Apr 07
1
It This data viz possible in R?
Hi All, I am new to R, but it has been a lot of fun learning as I go and have been blow away by what it can do. Came across this example and wanted to see if ggplot2 or some other visualization package could make this sort of graphic.
2009 Jan 26
3
Tinn-R
Hi Everyone, I was hoping someone could help me with the settings for Tinn-R. I see in the screen shots that it has syntax help, or something similar (tips on what functions, etc). I can not seem to get this to turn on in the program, and I am wondering if I have to set up a few options. I quickly read through the help and could not figure it out. Many thanks! - Brock P.S. It appears as
2009 Mar 25
1
Weighted Graph Link strength ( I am making mistake please help)
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
2009 Apr 18
0
igraph 0.5.2
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
2009 Apr 18
0
igraph 0.5.2
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
2017 Jun 20
2
Problem with shortestPath in igraph and qgraph
hello, I have a graph and i use qgraph package to calculate centrality parameters. Now I want to know the maximum value of shortest path for each vertex with discarding the Inf value in short pathes. For this I use the ShortestPathLengths of centrality function in qgraph. but when I want to get the maximum the result is wrong. here is my code: cen<-centrality(Q)
2017 Jun 21
0
Problem with shortestPath in igraph and qgraph
Hard to follow data analysis without data. Try making your example reproducible [1][2][3] and post in plain text (a setting in your emailer). Read the Posting Guide mentioned in the footer to avoid other posting pitfalls. [1] http://stackoverflow.com/questions/5963269/how-to-make-a-great-r-reproducible-example [2] http://adv-r.had.co.nz/Reproducibility.html [3]
2009 Apr 06
2
Bonpower Crashes Trying Sparse Matrix (Igraph)
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
2009 Jul 23
1
RMySQL Error
Hi Everyone, I am relatively new to R, but I want to try to learn how to use it and potentially replace the other commercial packages I have learned to use over the years. That said, I need to get at data in databases, more specifically, MySQL. I installed the RMySQL package without error, but when I try to load it, I get the following error: > library(RMySQL) Loading required package: DBI
2009 Jan 26
1
PCALG Package
Hi all, Can anyone help me setup this package so I can use it. I am getting errors with the Rgraphviz package and have tried a number of ways to get this to work. Any help will be greatly appreciated! I am sorta new to R but have been actively trying to get into using it as my main analysis software. Thanks, Brock [[alternative HTML version deleted]]
2009 Nov 28
1
Kohonen Package
Hi All, I am still learning R, but making, IMO, great strides. I learned about Kohonen/Self-Organizing Maps in class and I would like to try to replicate some of the things we have seen in class. Below is my code. I am trying to create a u-matrix. In the documentation on page 9 it appears the type of plot, dist.neighbours should do the trick, however, I am getting an error: (Error in
2009 Dec 01
1
Overlapping Plot Labels and Color Palette
Hi all, I am new to R, but with the help I have received thus,I have already been able to work through a bunch of questions on my own in just a few days. I imagine my questions are relatively simple, but here she goes. 1) I am using a package where one of the objects generated represents X/Y coordinates for each observation. I have been able to plot my row names onto the graph using text()
2008 Jul 18
1
Calculating Betweenness - Efficiency problem
Hello, I am calculating 'Betweenness' of a large network using R. Currently, I have the node-node information (City1-City2) in an excel file, present in two columns where column A has City1 and column B has City2 that city1 is connected to. These are the steps that I go through to calculate betweenness of my network. a) Convert the City1-City2 (text) into Number1-Number2 in the excel