igraph-help
[Top][All Lists]
Advanced

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

Re: [igraph] igraph-help Digest, Vol 130, Issue 8


From: 闵超
Subject: Re: [igraph] igraph-help Digest, Vol 130, Issue 8
Date: Sun, 11 Jun 2017 15:02:31 -0400

I did set the value of mode to "OUT". That's why I feel the result is so 
strange.
> 
> Message: 2
> Date: Sat, 10 Jun 2017 21:50:25 +0200
> From: Tamas Nepusz <address@hidden>
> To: Help for igraph users <address@hidden>
> Subject: Re: [igraph] Suspicious results produced by the function
>    neighborhood_size
> Message-ID:
>    <address@hidden>
> Content-Type: text/plain; charset="utf-8"
> 
> Hi,
> 
> Did you set the value of the "mode" argument to "OUT"? Note that the
> default value is "ALL", meaning that directed edges will be followed in
> both directions.
> 
> T.
> 
>> On Sat, Jun 10, 2017 at 9:40 PM, ?? <address@hidden> wrote:
>> 
>> Hi all!
>> 
>> I came across some suspicious results by the igraph function
>> neighborhood_size:
>> 
>> neighborhood_size
>> <http://igraph.org/python/doc/igraph.GraphBase-class.html#neighborhood_size>
>> (vertices=None, order=1, mode=ALL)
>> 
>> For each vertex specified by vertices, this function should return the
>> number of vertices reachable from that vertex in at most *order *steps.
>> My network is a directed citation network containing 531, 480 vertices
>> (each is a paper) and their citation relationships (about 6 million edges).
>> I used neighborhood_size to calculate the number of vertices reachable from
>> a vertex in at most 50 steps and it returned a result of 506, 255. I am
>> quite sure there couldn't be so many vertices reachable from that vertex.
>> So I used Networkx to calculate the same thing and it returned a result
>> of 17, 564, which seems to be more reasonable.
>> 
>> All the output about my current research is based on igraph. But I found
>> so many suspicious results of this kind. Can anyone help me find out what
>> the problem is?
>> 
>> Thanks!
>> Chao
>> --
>> Chao MIN, ??
>> Visiting PhD student, School of Informatics and Computing, Indiana
>> University Bloomington
>> PhD candidate, School of Information Management, Nanjing University
>> 
>> _______________________________________________
>> igraph-help mailing list
>> address@hidden
>> https://lists.nongnu.org/mailman/listinfo/igraph-help
>> 
>> 
> -------------- next part --------------
> An HTML attachment was scrubbed...
> URL: 
> <http://lists.nongnu.org/archive/html/igraph-help/attachments/20170610/d8438935/attachment.html>
> 
> ------------------------------
> 
> Subject: Digest Footer
> 
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help
> 
> 
> ------------------------------
> 
> End of igraph-help Digest, Vol 130, Issue 8
> *******************************************



reply via email to

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