similar to: igraph o network

Estimado Luisfo Chiroque Hay aristas múltiples, eso es por la preparación de los datos, es que separe por componentes, no me refiero al término componente estadístico, sino a descomposición de algo en los componentes que lo construyen, algunos son comunes y otros no, cuándo son comunes hay una relación en la red. Voy a probar con simplify, cuándo lo leí yo lo descarté, lo releeré, ¿Qué opina de

Estimados Copio un mensaje de error que da igraph, es más fácil verlo que explicarlo. > fastgreedy.community(udatos) Error in .Call("R_igraph_community_fastgreedy", graph, as.logical(merges), : At fast_community.c:553 : fast-greedy community finding works only on graphs without multiple edges, Invalid value > cluster_louvain(udatos) IGRAPH clustering multi level, groups: 7,

Hi everyone, I am using the fastgreedy.community function to get the $merges matrix and the $modularity vector. This serves my purpose of testing modularity of my graph. But I am "greedy" to plot the heat map and dendrrogram based on the $merges dendogram matrix. I know that heatplot does the graphics part but I am not sure if the dendogram generated by the heatplot will match the one

Estimado Javier, Me alegra que hayas avanzado con tu error. Te respondo a esto último. La función induced.subgraph() espera como segundo parámetro una lista de los IDs de los vértices, mientras que tú le estás pasando una lista de 'edges'. Prueba lo siguiente: c <- induced.subgraph(datos.network, which(V(datos.network)$name == 'Casa')) Si entendí bien todo, debería

Estimados Tengo un problema. Con igraph creo una red a partir de un data.frame, las dos primeras columnas son V y las restantes E. Hay un trabajo anterior, yo me pregunté ¿Qué pasaría si las cosas hablaran entre ellas?, entonces hay un cruce de información de todos contra todos y elimino los nulos y duplicados. Al ver los listados E, V tienen la información. Hasta ahí estaría todo bien (me

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

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

Hello, I am working with graph and adjacency matrix, the package 'graph' seems to be appropriate for this. An example in the package > mat <- rbind(c(0, 0, 1, 1), + c(0, 0, 1, 1), + c(1, 1, 0, 1), + c(1, 1, 1, 0)) > rownames(mat) <- colnames(mat) <- letters[1:4] > graph1 <- new("graphAM", adjMat=mat) > graph1 A

Estimados compañeros estoy con un trabajo sobre redes pathfinder y quería saber si conocéis alguna librería o función para dada la matriz de proximidades sacar la matriz de la red pathfinder. Un cordial saludo y un mejor año 2013. Juan -- ========================================================= Juan Antonio Gil Pascual Prof. Titular de Metodología Cuantitatíva correo: jgil en edu.uned.es

Hi R-users, I'm using igraph for an undirected graph. i used clusters() igraph function to know the component size(subgraphs) as shown bellow: c <-clusters(g)    # component sizes size <- sort(c$csize, decreasing=TRUE) cat("Top 20 cluster of the graph","\n") for (i in 1:20) {   cat(i,"  size:",size[i] ,"\n") } Can anyone help how to extract the

Hi friends, Is there anyone who happened to import data set in the "DL" format into R for further analysis? In the package of "network", there's only a method named "read.paj()". So now, I have to get the dl file from the original data set, and use UCINET to convert it to .net file. It's too complicated. :( In the package of "igraph", edgelist is

Dear all, I'm having some problems getting my recursive function to work. At first I though that maybe my data was too big and I increase option(expressions=50000). Then I thought that I would try it on some smaller data. Still not working. :( I would have thought there should be a function for this already, so any suggestions are welcomed for other methods. I did try igraph but couldn't

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

Hola, quiero hacer un estudio de no inferioridad para ver si tres tratamientos quirúrgicos son equivalentes en el tratamiento de una patología. Me gustaría saber qué librerías se pueden utilizar y ver algún ejemplo. Gracias J Martín

I am doing some work the Rgraphviz, a Bioconductor package, but since my question is of a more general nature, thought I would send to this list in hopes that a graph theory expert could answer my question. I wish to do some statistics on node-node relationships. In particular, I want to see if two connected nodes share a common property. I believe that the more "connected" the two

Hi, I''m trying to use dtrace to signal threads in my app when certain events happen, and the raise() action seemed adequate -- looking at the kernel sources, it sends a signal to the currently executing thread, and a quick microbenchmark confirmed this. However, further testing showed that if lots of threads hit the event simultaneously, the signal only gets delivered once, and may also

Estimado Matias, Reenvio a la lista. Es tarde aqui y hay que descansar. Quizas alguien en otra parte del mundo pueda darte una mano. En unas horas te envio mi opinion. Saludos, Jorge.- 2013/6/11 Matias Ledesma <> > Hola Jorge, > > Muchas gracias por las referencias, ya consegui el libro asi que me voy > aponer a leerlo aver si encuentro una solucion. > > La data