similar to: per-vertex statistics of edge weights

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

Hi all, I want to find all the mappings of one graph in another graph, based on their vertex labels Is there any way to do this in igraph based on vertex labels. (as far as i know Igraph allows the subgraph isomorphism based only on vertex and edge colors) Eg: graph 1: x(1) x(2) x(2) y(3) y(4) x(1) z(5) x(2) graph 2: x(1) y(2) # the brackets contain the corresponding vertex ids i would like my

Using Igraph, I create shortest paths, then convert the matrix into three column vectors - "vertex1", "vertex2", "shortestpath" - as the code below shows. #code for generating shortest path matrix and creating a 3 columns from an igraph graph object "y" y_s<-shortest.paths(y, weights = NULL) y_s <- melt(y_s)[melt(upper.tri(y_s))$value,] #Step 2: this

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.

I am using the code below to output some network measures: central_social <- data.frame(V(s641_social)$name, indegree_social, outdegree_social, incloseness_social, outcloseness_social, betweenness_social, eigen_social) and I get the following error: Error in Re(z) : non-numeric argument to function I know this has to do with V but I cannot figure out what is wrong. s641-social is a graph

Hello Everyone! This is my first post to the mailing list so please forgive me if I am a bit deflected from the general format of this mailing list posts. Since I need help in this matter urgently, I would cover up any of my mistakes in posting later. That said, I have a problem in merging 2 graphs that have common nodes between them. I have a graph G1, that have nodes N1 and edge set E1 and

Hi, Does anyone know of a package in R that has a function to convert network data (e.g. an adjacency matrix or ) from 2-mode to 1-mode? I am conducting social network analysis. I know that Pajek has this function under Net --> Transform --> 2-mode to 1-mode --> Rows. I have searched the documentation under packages 'sna', 'network', 'igraph', and

Dear R Users, I have a network of 25000 total nodes and a list of 500 node which is a subset of all nodes. Now I want to calculate the APSP (all pair shortest path) matrix only for these 500 nodes. I would appreciate any help. Thanks in advance Dinesh -- Dinesh Kumar Barupal Research Associate Metabolomics Fiehn Lab UCD Genome Center 451 East Health Science Drive GBSF Builidng University of

Hi, I've installed the igraph package and have been otherwise using it successfully, but when I try to use graph.bfs I get the error: could not find function "graph.bfs" Moreover, I don't seem to have the documentation installed either. (per ?graph.bfs and ??graph.bfs). I'm using RStudio v0.95.262 on windows 7. Below is the info for my R build: R version 2.14.0

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'm working on some social networks and I managed to create the graphs with labels and edges weight, but I would also like to change the size of the vertices according to the age of the persons in the network and the shape according to the gender. Now for the age, I have people with ages between 20 and 78, and I would like to have 4 categories (sizes): 20-35, 36-50, 50-65, >65. I have

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

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

I realize that matrix indexing has been addressed in various flavors, but I''m stumped and didn''t find anything in the archives. It''s not clear if it is an igraph issue or a more general problem. Thanks in advance for your patience. I am using igraph to read a gml file (http://www-personal.umich.edu/~mejn/netdata/football.zip ). The gml file contains vertex attributes

I am using 'igraph' package to make some graphs of 'gene-gene interaction'. I can get a data.frame which has three columns. gene1 gene2 pvalue AGT MLR 1.2e-04 MLR 11BHSD1 1.71e-05 IFG2 11BHSD2 2.2e-07 . . . . . . . . . AGTR1 NPPA

Hello, I am exporting a graph in "gml" format from igraph 0.5.5. When I open the file in Cytoscape v.2.7 I can't map the color attribute that I assign to the graph when I export it from igraph. Could anyone help me in this? Thanks. -- Warm Regards, Sandeep Amberkar BioQuant,BQ26, Im Neuenheimer Feld 267, D-69120,Heidelberg Tel: +49-6221-5451354 [[alternative HTML version

Hello there, I am using the igraph package to build graphs from my data. If I plot a graph though, it's not easy for me to see what's going on. Does anybody know how to rearrange a graph to get a plot without too many crossing lines? Maybe other packages? Thanks a lot in advance for any pointers, -- D --------------------------------- [[alternative

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, I have a simple beginner's question on removing a list of objects. Say I have objects C243.Daily1, C243.Daily2...C243.Daily5 in my workspace. I'd like to remove these without using rm five times. So I write. > a <- list(paste("C243.Daily",sep="",1:5)) > rm(a) Obviously this wouldn't work, as it would only remove the object a. But is there any way

Dear All, in some functions of my package, I use the Matrix S4 class, as defined in the Matrix package. I don't want to depend on Matrix, however, because my package is perfectly fine without Matrix, most of the functionality does not need Matrix. Matrix is so included in the 'Suggests' line. I load Matrix via require(), from the functions that really need it. This mostly works