similar to: question about Assortative and Disassortative Mixing

Dear colleagues, I'm trying to have a look at the Assortative and Disassortative ( http://en.wikipedia.org/wiki/Assortative_mixing) of the network I have. But it seems that the igraph hasn't mentioned that yet. I have to get the in/out degree of the vertices of each edge and calculate the Pearson's Correlation coefficient which seems to be quite a huge task for me. :( So I wonder if

Dear all, I'm looking for a method to quantify assortative mixing in undirected graphs, preferably something that is compatible with the igraph-library for network analysis. Is anybody aware of an already existing function/library for this or an easy way to implement this functionality in R? Many thanks, Rainer WikipediaWictionaryChambers (UK)Google imagesGoogle defineThe Free

Hi all, Is there anyone who ever used igraph to calculate the index of "centralization" ? I tried my best but can't find it in igraph. The brief introduction to "centralization" can be found here , and I think it's an important index for measuring the centrality on the aggregated level.(http://faculty.ucr.edu/~hanneman/nettext/C10_Centrality.html) Thank you for any

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 using igraph for some analysis about the network I have. I have a question about the function "power.law.fit". I wonder if there is any test for checking whether the "power.law.fit" is good for the input, i.e., under which situation, could we use this function to get a reliable result. I'm afraid even I input a random graph without any property of

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

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, what does this mean? --8<---------------cut here---------------start------------->8--- > graph <- graph.data.frame(merged[!v,], vertices=ve, directed=FALSE) cedta decided 'igraph' wasn't data.table aware cedta decided 'igraph' wasn't data.table aware cedta decided 'igraph' wasn't data.table aware cedta decided 'igraph' wasn't

Hello... I am a system engeenering student and I am using R for first time for Graph Theory. I would like to know if there is anyway you can plot an ghaph (igraph library) and obtain a graph whose vertices dont appear identified with number, instead I would like the vertices to be identified with letters or words, names... is there anyway I can do this? Thanks in Advance for your

When the shape of all vertices is set to "square" and the size of the vertices is also set, one get following error (commands attached): Error in l[[which.min(sapply(l, function(p) (p[1] - x0)^2 + (p[2] - y0)^2))]] : attempt to select less than one element Is there a way to solve this problem? Robbie ## Load the igraph package library(igraph) ## Create and plot a small graph

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.

Hello, I am using the plot.igraph function in the igraph package to plot a network. How do I keep vertices from overlapping? One option would be to pass an argument that restricts vertices to occupy the same coordinates given their size. A second option would be to increase the area of the plot (and multiply the distance between vertices with a constant) while keeping the size of vertices the

Dear all, I have a directed graph - an Igraph to be more precise - which has some vertices attributes (like dorm, year etc). Edges and the graph itself do not have any attributes. Based on the attributes of the vertices, I'd like to calculate correlation among the edges (e.g. how likely people of the same dorm are connected?) for the whole graph. Also, I'd like to calculate

Dear all, I'm doing some experiments with igraph and in particular with graph layouts. I can't figure out how to apply a layout to a given (real) graph avoiding node overlaps. In the following example if the variable NumOfNodes is setted to a small value (10) the layout function generates a plot without node overlaps. But even with a not-so-big number of nodes (50) plotted graph has

Hi everyone! I would appreciate help with using decompose.graph(), community detection functions from igraph and lapply(). I have an igraph object G with vertex attribute "label" and edge attribute "weight". I want to calculate community memberships using different functions from igraph, for simplicity let it be "walktrap.community". This graph is not connected,

Hello All, I am working on graph object using IGRAPH package wanted to do Bonacich Power. This is my graph object. The file 'Graph.RData' (4.2 MB) is available for download at http://dropbox.unl.edu/uploads/20090424/cfe4fcb854bb17f2/Graph.RData Graph size Vertices: 20984 Edges: 326033 Directed: FALSE No graph attributes. Vertex attributes: name. No edge attributes. When I use