Hi All,
I'm working with igraph in R and I'm trying to create an edge attribute in
my network based on nodes' similarity on a vertex attribute. I already have
the vertex attribute read into the igraph object.
For example, "speakers" is an igraph object with vertex attribute
"birthyear." I want to
Dear List,
I'm attempting to conduct an analysis that mirrors part of the analysis in
the Moody & White (2003) cohesive blocks paper. The authors conducted a QAP
analysis where the dependent graph was a similarity matrix on a node level
characteristic and the focal predictor matrix was joint member
Follow up on Cohesive.blocks.
For other users of the list, here is the loop I wrote following Gabor's
suggestion. There may be a more parsimonious approach but this worked.
camp <- graph.formula(Harry:Steve:Don:Bert - Harry:Steve:Don:Bert,
Pam:Brazey:Carol:Pat - Pam:Brazey:Ca
On Sat, Nov 15, 2014 at 2:00 PM, Gábor Csárdi
wrote:
> Nice! Thanks for sharing!
>
> On Sat, Nov 15, 2014 at 1:17 PM, Richard Benton
> wrote:
> [...]
> > #loop over the matrix#
> > for (b in seq(from=1, to=length(bl))){
> > for (i in seq(from=1, to=18)){
> >
Hi All,
I'm trying to create a vertex label that just flags whether or not the
respective node is in the giant component. What would be the best way to
approach this problem?
Thanks,
Richard
___
igraph-help mailing list
igraph-help@nongnu.org
https://list
Hi All,
Apologies for forgetting to note the platform. I'm using igraph in R and
I'm trying to construct a vertex level attribute that just flags TRUE or
FALSE for whether the vertex is in the graph's giant component.
Thank you,
Richard
___
igraph-help ma
which.max(cl$csize)
}
I'm trying to think through how I can create a vertex.attribute flag on
these graphs that indicates whether the vertex *ever *appeared in the main
component in any of the 23 graphs.
Any ideas would be helpful.
Thanks!
Richard Benton
A
