similar to: igraph package, version 0.5

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

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

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

Hi, I am a Newbie for R. I just installed R-base on my notebook with openSuSE 11. However, I always got compilation errors in installing add-on packages. For example, when installing "igraph" I got the following error: ___________________________________________________________________ * Installing *source* package 'igraph' ... checking for gcc... gcc checking for C compiler

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

Hi everyone, I'm writting a script that will open multiple files in a single folder and then will do some calculations to finally save everything in a big table. So here is the pseudo code #read all files in the given directory myfiles <-list.files("c:\\myDir") #initialize table ??? #loop through files for(f in myfiles[-1]) { netMat <-

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

On 03/14/2017 07:50 PM, Adam Nemet wrote: > >> On Mar 14, 2017, at 11:33 AM, Hal Finkel <hfinkel at anl.gov >> <mailto:hfinkel at anl.gov>> wrote: >> >> >> >> On 03/14/2017 12:11 PM, Adam Nemet wrote: >>> >>>> On Mar 14, 2017, at 9:49 AM, Hal Finkel <hfinkel at anl.gov >>>> <mailto:hfinkel at

Hi, I am having trouble with some code that I am dyn.loading. I am writing an interface to ARPACK. I compile my interface (dssimp.cc), and link it against the ARPACK library (libarpack_SUN4.a): g++ -shared -static -fPIC dssimp.cc -o dssimp.so -larpack_SUN4 -lg2c -lm I can dyn.load the code and it appears OK. However, when I call my function, the call to the function in the ARPACK library

Dear all, I am currently working on the calculation of eigenvalues (and -vectors) of large matrices. Since these are mostly sparse matrices and I remember some specific functionalities in MATLAB for sparse matrices, I started a research how to optimize the calculation of eigenvalues of a sparse matrix. The function eigen itself works with the LAPACK library which has no special handling for

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

Hello All, I went through lot of searching for papers to do clustering on Co-Authroship.I ran SNA metrics on my Undirected Graph(betweenness,Closeness,Eigen Vector) using R. After running the sna Metrics I found important nodes and did clustering on those nodes based on Binding strength .This clustering is done through if they are connected.I would like to do clustering based on Weight of the

Has anyone here implemented Jon Kleinberg's burst detection algorithm ("Bursty and Hierarchical Structure in Streams" http://www.cs.cornell.edu/home/kleinber/bhs.pdf)? I'd rather not reimplement if there's already running code available.... Thanks, -s [[alternative HTML version deleted]]

On 03/14/2017 12:11 PM, Adam Nemet wrote: > >> On Mar 14, 2017, at 9:49 AM, Hal Finkel <hfinkel at anl.gov >> <mailto:hfinkel at anl.gov>> wrote: >> >> >> On 03/14/2017 11:21 AM, Adam Nemet wrote: >>> >>>> On Mar 14, 2017, at 6:00 AM, Nema, Ashutosh <Ashutosh.Nema at amd.com >>>> <mailto:Ashutosh.Nema at

Hi to all, I have two graphs with the same number of nodes but with different connectivities and also with a different number of clusters. The two graphs represent the same "system" under different "conditions" and then there is a one-to-one correspondence between a given node in the two graphs. It is correct to use the eigenvector centrality score as a measure of the relevance

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

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,