Re: [igraph] Mean Time-First Passage

[Gábor Csárdi]

Sylvain, unfortunately I don't think that we have it.

Btw. you mean some numerical approximation, or it is possible to
calculate this exactly for general networks? (I guess not, but I am
not really up to date with random walks.)

Can you suggest some algorithms for this?

Best,
Gabor

On Wed, May 20, 2009 at 8:00 PM, Sylvain Loiseau <address@hidden> wrote:
> Hello all,
>
> Is there any implementation of an algorithm for computing Mean Time-First
> passage in random walk with the igraph library?
>
> Thanks for it anyhow,
> Best,
> Sylvain
>
> --
> Sylvain Loiseau
> address@hidden
>
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help
>



-- 
Gabor Csardi <address@hidden>     UNIL DGM