similar to: matrix into vector with vertex names

Hi, I'm trying to do some basic social network analysis with igraph in R, but I'm new to R and haven't been able to find documentation on a couple basic things: I want to run igraph's community detection algorithms on a couple thousand small graphs but don't know how to automate igraph looking at multiple graphs described in a single csv file. My data look like something in

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

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]

Hi, I am running R 3.3.3 and getting the following error: Error in add_edges(res, edges = t(as.matrix(el[, 1:2])), attr = weight) : long vectors not supported yet: ../../src/include/Rinlinedfuns.h:138 when passing a 13 GB TransitionLayer object to shortestPath from the package 'gdistance'. The error, albeit in a different context, is discussed here:

This looks to me like a package development issue... which may be under discussion in R-sig-geo (search the archives), but more likely to be appropriate to discuss with the maintainer by email or through their development repository (R-forge, though it looks unused). -- Sent from my phone. Please excuse my brevity. On February 14, 2018 7:43:51 AM PST, Loris Bennett <loris.bennett at

Hi Jeff, Jeff Newmiller <jdnewmil at dcn.davis.ca.us> writes: >> Hi, >> >> I am running R 3.3.3 and getting the following error: >> >> Error in add_edges(res, edges = t(as.matrix(el[, 1:2])), attr = weight) >> : >> long vectors not supported yet: ../../src/include/Rinlinedfuns.h:138 >> >> when passing a 13 GB TransitionLayer

Hi, Calling gdistance::shortestPath gives me the error Error in asMethod(object) : not a symmetric matrix; consider forceSymmetric() or symmpart() The output of dput(.traceback()) is pairlist("stop(\"not a symmetric matrix; consider forceSymmetric() or symmpart()\")", "asMethod(object)", "as(Laplacian,\"symmetricMatrix\")",

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

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

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

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

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

I have a multiple text files, separated by a single space, that I need to combine into a single data.frame. Below is the track I'm on using list.files to capture the names of the files and then lapply with read.table. But I run into problems making a usable dataframe out of the data. #Creating example data in similar format to data I have sub <- rep(1,10) trial <- seq(1,10,1) size

I have a table with some data structured something like this: book ---- title (varchar) pages (int) completed_on (date) While I can find the shortest book completed in each year with something like this: select min( pages ), year from book group by year I would also like to get the title of the shortest book in each year. Is there any way to do this by modifying the previous query to pull

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

Hi, David. Spill intervals must be precolored because they can't be spilled once more. They are the shortest intervals precisely over each def/use of the original interval. That is why they also have their weights set to #INF. Imagine that on a second iteration allocation algorithm figures out that some spilled interval can't be assigned a physical register. Allocator can't spill it

Hi everyone, I have successfully created and analyzed my network data. I am new to R, and Network Analysis too, but I want to color my vertex based on some of the centrality measures calculated. Can someone point me in the right direction? Again, I am new to R, but given how powerful R appears to be, I figure this is probably pretty easy to do, I just wish I could figure it out. Many thanks