Re: [igraph] Mean Time-First Passage

[Gábor Csárdi]

On Fri, May 22, 2009 at 3:51 PM, Sylvain Loiseau <address@hidden> wrote:
[...]
> http://www.datalab.uci.edu/papers/white_smyth.pdf

This is indeed an interesting paper, thanks.

[...]
> If I understand correctly, it seems that it is possible to calculate exactly
> an expected value, without approximation: "A useful property of using mean
> first passage times, besides having a natural Markov interpretation, is that
> one can directly compute a mean first passage matrix giving the mean first
> passage times for all pairs of nodes." (270).

Yes, but it seems that the calculation involves inverting a dense
matrix, so it is probably not feasible for large graphs. Anyway, I
added this to the TODO list:
https://bugs.launchpad.net/igraph/+bug/381228

Best,
G.

> Yours,
> Sylvain
>
>
>> 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
>>>
>>
>>
>>
>
> --
> Sylvain Loiseau
> address@hidden
>
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help
>



-- 
Gabor Csardi <address@hidden>     UNIL DGM