Hi Guy - don't know about weights in igraph, but if you use tnet (built on
igraph, I believe) it specifically supports this. Function reference here:
http://opsahl.co.uk/tnet/content/view/54/30/Blog post describing the procedure here:
http://toreopsahl.com/2009/05/01/projecting-two-mode-networks-onto-weighted-one-mode-networks/Once you have it as a weighted one-mode network, use other tnet functions
for weighted centrality measures (betweenness, degree, closeness).
Hope that helps.
R
On , Guy Bourne <
address@hidden> wrote:
Hi,
I'm looking to collapse large 2-mode networks into 1-mode networks to
analyse centrality between nodes in one vertext set. To do this I was
planning on using bipartite.projection, but I wasn't sure if the output
of this could be a weighted graph. The data that I've used doesn't seem
to produce repeated edges (presumably as the output is a simple graph) so
I was wondering if there was an option for a weighted graph output?
Thanks in advance for your time!
Kind regards,
Guy