[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
## Re: [igraph] test network topology

**From**: |
Gabor Csardi |

**Subject**: |
Re: [igraph] test network topology |

**Date**: |
Fri, 9 May 2008 17:13:32 +0200 |

**User-agent**: |
Mutt/1.5.13 (2006-08-11) |

This question cannot really be answered in general i think,
the answer depends on what you want to show. If you want to
show that the structure you see is not a consequence of the
density of the graph, then use an Erdos-Renyi random graph.
If you want to show that it is not a consequence of the
degree distribution then use the configuration model (i.e.
degree.sequence.game type model). If you want to show that
it is not the consequence of the transitivity, then you
need random graphs conditioned on transitivity, etc.
On Fri, May 09, 2008 at 04:23:21PM +0200, Tamas Nepusz wrote:
>* >I generated 1000 random graphs with similar characteristics to my *
>* >empirical graph. I then calculated the the transitivity and *
>* >shortest path length for each random graph.*
>* I think I would have done the same. The random graphs would have had *
>* the same degree distribution as my original graph (see the rewiring *
>* functionality of igraph or the degree sequence game. the latter one *
>* does not prevent multiedges and loops, but the graph can be simplified *
>* afterwards).*
Btw. degree.sequence.game is biased, it does not generate all graphs with
the same probability.
G.
[...]
--
Csardi Gabor <address@hidden> UNIL DGM