Re: [igraph] igraph-help Digest, Vol 115, Issue 1

[MikeS]

Dear Gabor,
Thanks for reply.
I have opened a new issue in the GitHub issue tracker
https://github.com/igraph/igraph/issues/918
--
Mike

2016-02-03 23:01 GMT+06:00  <address@hidden>:
> Send igraph-help mailing list submissions to
>         address@hidden
>
> To subscribe or unsubscribe via the World Wide Web, visit
>         https://lists.nongnu.org/mailman/listinfo/igraph-help
> or, via email, send a message with subject or body 'help' to
>         address@hidden
>
> You can reach the person managing the list at
>         address@hidden
>
> When replying, please edit your Subject line so it is more specific
> than "Re: Contents of igraph-help digest..."
>
>
> Today's Topics:
>
>    1. Function 'neighborhood' for non-integer distance (MikeS)
>    2. Re: Function 'neighborhood' for non-integer distance
>       (G?bor Cs?rdi)
>
>
> ----------------------------------------------------------------------
>
> Message: 1
> Date: Wed, 3 Feb 2016 08:55:58 +0600
> From: MikeS <address@hidden>
> To: address@hidden
> Subject: [igraph] Function 'neighborhood' for non-integer distance
> Message-ID:
>         <address@hidden>
> Content-Type: text/plain; charset=UTF-8
>
> Hello!
> I have a weighted undirected network G = (V, E), is V = {v1, v2, ... ,
> vn} and the edge set E = {e1, e2, ... , em}.
>
> I need to calculate a local dimension of nodes.
>
> The local dimension of nodes means the local dimensional limit of the
> space around a node. F.N. Silva, L.d.F. Costa, Local dimension of
> complex networks, ArXiv Preprint http://arxiv.org/pdf/1209.2476v3.pdf.
>
> In igraph term the "local dimension of nodes" is the "neighborhood of
> graph vertices".
>
> I can use the built-in function neighborhood.size(G, r, V(G)) for
> topological distance r = 0, 1, 2, 3. The r value should be integer.
>
> Could someone please say does exist in igraph built-in function for
> non-integer distance, for example, r=1.5?
>
> I have found only external solution:
> http://stackoverflow.com/questions/32470713/how-to-calculate-the-neighborhood-of-a-graph-with-order-1-5
>
> Thanks.
> --
>
> Mike
>
>
>
> ------------------------------
>
> Message: 2
> Date: Wed, 3 Feb 2016 10:19:09 +0000
> From: G?bor Cs?rdi <address@hidden>
> To: Help for igraph users <address@hidden>
> Subject: Re: [igraph] Function 'neighborhood' for non-integer distance
> Message-ID:
>         <address@hidden>
> Content-Type: text/plain; charset=UTF-8
>
> Hi!
>
> The neighborhood functions do not take edge weights into account,
> unfortunately.
> Their terminology is also unfortunate, they should say 'hops' instead
> of 'distance'.
>
> You may open an issue in the GitHub issue tracker and make a case for
> this feature.
>
> Gabor
>
> On Wed, Feb 3, 2016 at 2:55 AM, MikeS <address@hidden> wrote:
>> Hello!
>> I have a weighted undirected network G = (V, E), is V = {v1, v2, ... ,
>> vn} and the edge set E = {e1, e2, ... , em}.
>>
>> I need to calculate a local dimension of nodes.
>>
>> The local dimension of nodes means the local dimensional limit of the
>> space around a node. F.N. Silva, L.d.F. Costa, Local dimension of
>> complex networks, ArXiv Preprint http://arxiv.org/pdf/1209.2476v3.pdf.
>>
>> In igraph term the "local dimension of nodes" is the "neighborhood of
>> graph vertices".
>>
>> I can use the built-in function neighborhood.size(G, r, V(G)) for
>> topological distance r = 0, 1, 2, 3. The r value should be integer.
>>
>> Could someone please say does exist in igraph built-in function for
>> non-integer distance, for example, r=1.5?
>>
>> I have found only external solution:
>> http://stackoverflow.com/questions/32470713/how-to-calculate-the-neighborhood-of-a-graph-with-order-1-5
>>
>> Thanks.
>> --
>>
>> Mike
>>
>> _______________________________________________
>> igraph-help mailing list
>> address@hidden
>> https://lists.nongnu.org/mailman/listinfo/igraph-help
>
>
>
> ------------------------------
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help
>
>
> End of igraph-help Digest, Vol 115, Issue 1
> *******************************************