[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [igraph] Estimation of the average distance

From: Gábor Csárdi
Subject: Re: [igraph] Estimation of the average distance
Date: Mon, 9 Jun 2014 14:51:08 -0400

Hi Vincent,

you can sample some source vertices and calculate distances from them
to all other vertices. This be unbiased for uncorrelated graphs, but
not for correlated ones (like real graphs).

There are also more sophisticated ways, e.g. a quick search got me this:


On Mon, Jun 9, 2014 at 11:37 AM, Vincent Labatut
<address@hidden> wrote:
> Hello,
> I want to process the average distance of some large graphs. I do not need
> the paths themselves, or the individual lengths of all possible shortest
> paths, but just the average value over the whole graph.
> However, when using the function average.path.length() (R version of
> igraph), it takes too long (weeks) due to the size of the graphs. I could do
> with only an estimation of the average distance, so I was wondering if there
> was any way of processing such an approximation (I noticed some functions
> such as betweenness() have an 'estimate' version).
> Best regards,
> Vincent
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help

reply via email to

[Prev in Thread] Current Thread [Next in Thread]