|
From: | Marco Milano |
Subject: | Re: [igraph] Node-level triad census with igraph for R |
Date: | Sun, 19 Jan 2014 17:18:55 +0100 |
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. Node-level triad census with igraph for R (Marco Milano)
2. Re: Node-level triad census with igraph for R (G?bor Cs?rdi)
----------------------------------------------------------------------
Message: 1
Date: Wed, 15 Jan 2014 11:49:08 +0100
From: Marco Milano <address@hidden>
To: address@hidden
Subject: [igraph] Node-level triad census with igraph for R
Message-ID:
<address@hidden>
Content-Type: text/plain; charset="iso-8859-1"
Dear igraph list,
I'm currently working on extracting node-level properties from a social
network and I'm stuck with the triad census calculation. As there isn't a
function to call on the graph to perform such task, this is the most
updated solution I found so far:
http://stackoverflow.com/questions/12374534/how-to-mine-for-motifs-in-r-with-igraph
.
When I try to iterate the triad census on each node in my graph though, I
get some strange results. First of all, being an undirected graph I should
be getting 4 values but instead I get 16. Moreover, I don't know which
resulting census corresponds to which node. The name attribute I call to
iterate on the list of nodes seems to contain the NULL value but it
correctly contains the vertex names at graph level before calling the
graph.neighborhood function.
My problem is: how can I have each node printed out along with its triad
census?
And, please forgive me for adding a side-question to my main one but seen
that we are talking about triads, I was wondering if anyone is aware of a
way to calculate the Kalish & Robins Strong-Weak-NoTie relation?
Thanks. I appreciate any help or advice.
Marco
--
*Find me on LinkedIn:*
linkedin.com/in/marcomilano <http://www.linkedin.com/in/marcomilano>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.nongnu.org/archive/html/igraph-help/attachments/20140115/8fdfc91b/attachment.html>
------------------------------
Message: 2
Date: Wed, 15 Jan 2014 10:28:54 -0500
From: G?bor Cs?rdi <address@hidden>
To: Help for igraph users <address@hidden>
Subject: Re: [igraph] Node-level triad census with igraph for R
Message-ID:
<CABtg=K=address@hidden>
Content-Type: text/plain; charset="iso-8859-1"
Hi Marco,
On Wed, Jan 15, 2014 at 5:49 AM, Marco Milano <address@hidden> wrote:
> Dear igraph list,
>
> I'm currently working on extracting node-level properties from a social
> network and I'm stuck with the triad census calculation. As there isn't a
> function to call on the graph to perform such task, this is the most
> updated solution I found so far:
> http://stackoverflow.com/questions/12374534/how-to-mine-for-motifs-in-r-with-igraph
> .
>
actually there is triad.census:
http://igraph.sourceforge.net/doc/R/triad.census.html
>
> When I try to iterate the triad census on each node in my graph though, I
> get some strange results. First of all, being an undirected graph I should
> be getting 4 values but instead I get 16. Moreover, I don't know which
> resulting census corresponds to which node. The name attribute I call to
> iterate on the list of nodes seems to contain the NULL value but it
> correctly contains the vertex names at graph level before calling the
> graph.neighborhood function.
>
To be honest, it is hard to follow what you are doing, without seeing your
code. If just calling triad.census() is not an option for you, then please
include your code. Thanks.
Best,
Gabor
>
> My problem is: how can I have each node printed out along with its triad
> census?
> And, please forgive me for adding a side-question to my main one but seen
> that we are talking about triads, I was wondering if anyone is aware of a
> way to calculate the Kalish & Robins Strong-Weak-NoTie relation?
>
> Thanks. I appreciate any help or advice.
>
>
> Marco
>
>
> --
> *Find me on LinkedIn:*
> linkedin.com/in/marcomilano <http://www.linkedin.com/in/marcomilano>
>
> _______________________________________________
> 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/20140115/593adaa9/attachment.html>
------------------------------
_______________________________________________
igraph-help mailing list
address@hidden
https://lists.nongnu.org/mailman/listinfo/igraph-help
End of igraph-help Digest, Vol 90, Issue 10
*******************************************
[Prev in Thread] | Current Thread | [Next in Thread] |