[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
## Re: [igraph] Named vertexes from imported adjacency matrix

**From**: |
Csardi Gabor |

**Subject**: |
Re: [igraph] Named vertexes from imported adjacency matrix |

**Date**: |
Mon, 2 Jun 2008 12:10:38 +0200 |

**User-agent**: |
Mutt/1.5.9i |

On Mon, Jun 02, 2008 at 12:13:42AM +1000, Szabolcs Feczak wrote:
>* > is it possible to get the standard deviation of the average produced*
>* > by Graph.density() ?*
>* *
>* >*
>* > >I don't really understand this question;*
>* >*
>* > actually I thought about ego network for every actor, number of ties*
>* > divided by the number of pairs average*
>* >*
>* *
>* Another thought, what about weights during density calculation,*
>* is there any method there, which takes weights into account during*
>* density calculation ?*
Hmmmm, this might make some sense if the weights have an upper
bound, e.g. the weight of an edge is the probability
that it exists. Then the density is the sum of all weights divided
by the number of possible edges. I don't think we need an igraph
function for this, e.g. in R it just
sum(E(g)$weight) / vcount(g)*(vcount(g)-1)
for a directed graph. Multiply by 2 for an undirected graph.
G.
>* _______________________________________________*
>* igraph-help mailing list*
>* address@hidden*
>* http://lists.nongnu.org/mailman/listinfo/igraph-help*
--
Csardi Gabor <address@hidden> MTA RMKI, ELTE TTK