search for: clauset

...assess the goodness of fit. Because the null distribution of the KS statistic is not known when the distribution parameters are estimated from the data I would like to use simulations to generate a more accurate p-value (following the methods explained in the second to last paragraph on page 11 of Clauset et al. [2007] available at http://arxiv.org/abs/0706.1062 - also attached) Specifically: I would like to generate a random dataset (?x?) from a distribution (e.g. exponential): x<-rweibull(1500,shape,scale) calculate the parameters of the best-fit distribution: fitdistr(x,"weibull&quot...

...220588235294118, 0.0269607843137255, 0) Out of curiosity, I plotted the double-log CDF and the Pareto Q-Q plots. This provided me with a visual cue of a potential power-law distribution (at least, that's what I am boldly thinking). So I went ahead and performed the procedure as suggested by Clauset, Shalizi, and Newman (2007/09), by reusing the essentials found in http://tuvalu.santafe.edu/~aaronc/powerlaws/plfit.r. I obtained and tested the following fitting estimates based on dat1: xmin <- 0.01715686 alpha <- 2.381581 I then simply wanted to print the observed and fitted dists in...

...algorithm by Blondel et al. was added, see multilevel.community(). - Distance between two community structures: compare.communities(). - Community structure via exact modularity optimization, optimal.community(). - Hierarchical random graphs and community finding, porting the code from Aaron Clauset. See hrg.game(), hrg.fit(), etc. - Added the InfoMAP community finding method, thanks to Emmanuel Navarro for the code. See infomap.community(). Shortest paths -------------- - Eccentricity (eccentricity()), and radius (radius()) calculations. - Shortest path calculations with get.shortest.paths...

...algorithm by Blondel et al. was added, see multilevel.community(). - Distance between two community structures: compare.communities(). - Community structure via exact modularity optimization, optimal.community(). - Hierarchical random graphs and community finding, porting the code from Aaron Clauset. See hrg.game(), hrg.fit(), etc. - Added the InfoMAP community finding method, thanks to Emmanuel Navarro for the code. See infomap.community(). Shortest paths -------------- - Eccentricity (eccentricity()), and radius (radius()) calculations. - Shortest path calculations with get.shortest.paths...