Daniel B. Larremore

Statistical and Nonlinear Physics · 2015–2021

A researcher in the Science corpus: 5 papers; trusts 4 researchers and is trusted by 0 researchers here, as inferred from the citation graph.

Subfields

Whom Daniel B. Larremore trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

  1. Tiago P. Peixoto
  2. Mark Newman
  3. Jaewon Yang
  4. Jure Leskovec

Papers from Daniel B. Larremore's perspective

Ordered by how strongly the researchers Daniel B. Larremore trusts endorse each paper. Same corpus, a different order for every researcher.

  1. Defining and evaluating network communities based on ground-truth
  2. Community-Affiliation Graph Model for Overlapping Network Community Detection (2012 IEEE 12th International Conference on Data Mining)
  3. An Impossibility Theorem for Clustering (Neural Information Processing Systems)
  4. Random graphs
  5. Empirical comparison of algorithms for network community detection (The Web Conference)
  6. Community detection thresholds and the weak Ramanujan property (Symposium on the Theory of Computing)
  7. Hierarchical block structures and high-resolution model selection in large networks (arXiv.org)
  8. The Lack of A Priori Distinctions Between Learning Algorithms
  9. Information theoretic measures for clusterings comparison: is a correction for chance necessary? (International Conference on Machine Learning)
  10. Structure and dynamics of core/periphery networks (J. Complex Networks)

Their papers