Re: [igraph] test network topology

[Colin Garroway]

Hi Simone ,

I am certainly no graph theory expert but have done something similar and would be interested in what others thought too.   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 took my graph to have small world characteristics if the empirical  transitivity was greater than some proportion of the transitivity values of the random graphs (greater than 95% of random transitivity??) and the shortest path for the empirical and random graphs were similar.  

What do you think?  Make any sense?

Colin

2008/5/9 simone gabbriellini <address@hidden>:

Hello List,

I have a methodological question for you: suppose you have an empiric network and you want to see which theoretical model (random graph or small world) is more close to it, what igraph functions will you combine?
I know how to simulate in igraph random graphs and small world graphs with similar characteristic than the empirical network (number of nodes, links, mean degree), but what could be the right "test" at the end?

thank you,
Simone


dott. Simone Gabbriellini - PhD Student
Department of Social Sciences
University of Pisa
address@hidden






_______________________________________________
igraph-help mailing list
address@hidden
http://lists.nongnu.org/mailman/listinfo/igraph-help

-- 
Colin Garroway (PhD candidate)
Wildlife Research and Development Section
Ontario Ministry of Natural Resources
c/o Trent University
DNA Building
2140 East Bank Drive
Peterborough, ON, K9J 7B8
Canada
Phone: 705-755-1535