scispace - formally typeset
A

Aaron Clauset

Researcher at University of Colorado Boulder

Publications -  145
Citations -  29900

Aaron Clauset is an academic researcher from University of Colorado Boulder. The author has contributed to research in topics: Random graph & Computer science. The author has an hindex of 42, co-authored 133 publications receiving 25306 citations. Previous affiliations of Aaron Clauset include Santa Fe Institute & University of New Mexico.

Papers
More filters
Journal ArticleDOI

Power-Law Distributions in Empirical Data

TL;DR: This work proposes a principled statistical framework for discerning and quantifying power-law behavior in empirical data by combining maximum-likelihood fitting methods with goodness-of-fit tests based on the Kolmogorov-Smirnov (KS) statistic and likelihood ratios.
Journal ArticleDOI

Finding community structure in very large networks.

TL;DR: A hierarchical agglomeration algorithm for detecting community structure which is faster than many competing algorithms: its running time on a network with n vertices and m edges is O (md log n) where d is the depth of the dendrogram describing the community structure.
Journal ArticleDOI

Hierarchical structure and the prediction of missing links in networks

TL;DR: This work presents a general technique for inferring hierarchical structure from network data and shows that the existence of hierarchy can simultaneously explain and quantitatively reproduce many commonly observed topological properties of networks.
Journal ArticleDOI

A communal catalogue reveals Earth’s multiscale microbial diversity

TL;DR: A meta-analysis of microbial community samples collected by hundreds of researchers for the Earth Microbiome Project is presented, creating both a reference database giving global context to DNA sequence data and a framework for incorporating data from future studies, fostering increasingly complete characterization of Earth’s microbial diversity.
Journal ArticleDOI

Performance of modularity maximization in practical contexts

TL;DR: It is shown that the modularity function Q exhibits extreme degeneracies: it typically admits an exponential number of distinct high-scoring solutions and typically lacks a clear global maximum, implying that the output of any modularity maximization procedure should be interpreted cautiously in scientific contexts.